IMOST: Interactive Multiple Objective System Technique

An interactive multiple objective system technique (IMOST) is investigated to improve the flexibility and robustness of multiple objective decision making (MODM) methodologies. The interactive concept provides a learning process about the system, whereby the decision maker can learn to recognize good solutions, the relative importance of factors in the system, and then design a high-productivity and zero-buffer system instead of optimizing a given system. This interactive technique provides integration-oriented, adaptation and dynamic learning features by considering all possibilities of a specific domain of MODM problems which are integrated in logical order. It encompasses the decision-making processes of formulating problems, constructing a model, solving the model, testing/examining its solution, and improving/reshaping the model and its solution in a specific problem domain. Although IMOST deals with multiple objective programming problems, it also provides some valuable orientation of integrated system methodologies.     

Interactive TOPSIS algorithms for solving multi-level non-linear multi-objective decision-making problems

This paper extended the concept of the technique for order preference by similarity to ideal solution (TOPSIS) to develop a methodology for solving multi-level non-linear multi-objective decision-making (MLN-MODM) problems of maximization-type. Also, two new interactive algorithms are presented for the proposed TOPSIS approach for solving these types of mathematical programming problems. The first proposed interactive TOPSIS algorithm includes the membership functions of the decision variables for each level except the lower level of the multi-level problem. These satisfactory decisions are evaluated separately by solving the corresponding single-level MODM problems. The second proposed interactive TOPSIS algorithm lexicographically solves the MODM problems of the MLN-MOLP problem by taking into consideration the decisions of the MODM problems for the upper levels. To demonstrate the proposed algorithms, a numerical example is solved and compared the solutions of proposed algorithms with the solution of the interactive algorithm of Osman et al. (2003) [4]. Also, an example of an application is presented to clarify the applicability of the proposed TOPSIS algorithms in solving real world multi-level multi-objective decision-making problems.     

A hybrid inexact-stochastic water management model

An inexact-stochastic water management (ISWM) model is proposed and applied to a case study of water quality management within an agricultural system. The model is based on an inexact chance-constrained programming (ICCP) method, which improves upon the existing inexact and stochastic programming approaches by allowing both distribution information in B and uncertainties in A and C to be effectively incorporated within its optimization process. In its solution process, the ICCP model (under a given pi level) is first transformed into two deterministic submodels, which correspond to the upper and lower bounds for the desired objective function value. This transformation process is based on an interactive algorithm, which is different from normal interval analysis or best/worst case analysis. Interval solutions, which are feasible and stable in the given decision space, can then be obtained by solving the two submodels sequentially. Thus, decision alternatives can be generated by adjusting decision variable values within their solution intervals. The obtained ICCP solutions are also useful for decision makers to obtain insight regarding tradeoffs between environmental and economic objectives and between increased certainties and decreased safeties (or increased risks). Results of the case study indicate that useful solutions for the planning of agricultural activities in the water quality management system have been obtained. A number of decision alternatives have been generated and analyzed based on projected applicable conditions. Generally, some alternatives can be considered when water quality objective is given priority, while the others may provide compromises between environmental and economic considerations. The above alternatives represent various options between environmental and economic tradeoffs. Willingness to accept low agricultural income will guarantee meeting the water quality objectives. A strong desire to acquire high agricultural income will run into the risk of violating water quality constraints.     

An interactive algorithm to find the most preferred solution of multi-objective integer programs

In this paper, we develop an interactive algorithm that finds the most preferred solution of a decision maker (DM) for multi-objective integer programming problems. We assume that the DM’s preferences are consistent with a quasiconcave value function unknown to us. Based on the properties of quasiconcave value functions and pairwise preference information obtained from the DM, we generate constraints to restrict the implied inferior regions. The algorithm continues iteratively and guarantees to find the most preferred solution for integer programs. We test the performance of the algorithm on multi-objective assignment, knapsack, and shortest path problems and show that it works well.     

Algorithms for nonlinear integer bicriterion problems

Two algorithms to solve the nonlinear bicriterion integer mathematical programming (BIMP) problem are presented. One is a noninteractive procedure that generates the entire efficient set, and the second one is an interactive procedure that determines the best compromise solution of the decision maker (DM). A Tchebycheff norm related approach is used for generating the efficient points for the BIMP problem. An application of the interactive procedure for a quality control problem is also presented.This research was supported by the National Science Foundation Grant No. ECS-82-12076 with the University of Oklahoma.     

An interactive fuzzy satisficing method for multiobjective 0–1 programming problems with fuzzy numbers through genetic algorithms with double strings

In this paper, by considering the experts' vague or fuzzy understanding of the nature of the parameters in the problem-formulation process, multiobjective 0–1 programming problems involving fuzzy numbers are formulated. Using the a-level sets of fuzzy numbers, the corresponding nonfuzzy α-programming problem is introduced. The fuzzy goals of the decision maker (DM) for the objective functions are quantified by eliciting the corresponding linear membership functions. Through the introduction of an extended Pareto optimality concept, if the DM specifies the degree α and the reference membership values, the corresponding extended Pareto optimal solution can be obtained by solving the augmented minimax problems through genetic algorithms with double strings. Then an interactive fuzzy satisficing method for deriving a satisficing solution for the DM efficiently from an extended Pareto optimal solution set is presented. An illustrative numerical example is provided to demonstrate the feasibility and efficiency of the proposed method.     

Interactive Sequential Goal Programming

This paper introduces a new solution method based on Goal Programming for Multiple Objective Decision Making (MODM) problems. The method, called Interactive Sequential Goal Programming (ISGP), combines and extends the attractive features of both Goal Programming and interactive solution approaches for MODM problems. ISGP is applicable to both linear and non-linear problems. It uses existing single objective optimization techniques and, hence, available computer codes utilizing these techniques can be adapted for use in ISGP. The non-dominance of the "best-compromise" solution is assured. The information required from the decision maker in each iteration is simple. The proposed method is illustrated by solving a nutrition problem.     

Target setting in the general combined-oriented CCR model using an interactive MOLP method

The traditional data envelopment analysis (DEA) model does not include a decision maker’s (DM) preference structure while measuring relative efficiency, with no or minimal input from the DM. To incorporate DM’s preference information in DEA, various techniques have been proposed. An interesting method to incorporate preference information, without necessary prior judgment, is the use of an interactive decision making technique that encompasses both DEA and multi-objective linear programming (MOLP). In this paper, we will use Zionts-Wallenius (Z-W) method to reflecting the DM’s preferences in the process of assessing efficiency in the general combined-oriented CCR model. A case study will conducted to illustrate how combined-oriented efficiency analysis can be conducted using the MOLP method.     

A generalized geometric-programming solution to “An economic production quantity model with flexibility and reliability considerations”

The classical economic production quantity (EPQ) model assumes that items are produced by a perfectly reliable production process with a fixed set-up cost. While the reliability of the production process cannot be perfected cost-free, the set-up cost can be reduced by investment in flexibility improvement. In this paper, we propose an EPQ model with a flexible and imperfect production process. We formulate this inventory decision problem using geometric programming (GP), establish more general results using the arithmetic-geometric mean inequality, and solve the problem to obtain a closed-form optimal solution. Following the theoretical treatment, we provide a numerical example to demonstrate that GP has potential as a valuable analytical tool for studying a certain class of inventory control problems. Finally we discuss some aspects of sensitivity analysis of the optimal solution based on the GP approach.     

Fuzzy bicriteria multi-index transportation problems for coal allocation planning of Taipower

Taipower, the official electricity authority of Taiwan, encounters several difficulties in planning annual coal purchase and allocation schedule, e.g., with multiple sources, multiple destinations, multiple coal types, different shipping vessels, and even in uncertain demand and supply. In this study, these concerns are formulated as a fuzzy bicriteria multi-index transportation problem. Furthermore, an effective and interactive algorithm is proposed which combines reducing index method and interactive fuzzy multi-objective linear programming technique to cope with a complicated problem which may be prevalent in other industries. Results obtained in this study clearly demonstrate that this model can not only satisfy more of the actual requirements of the integral system but also offer more information to the decision makers (DMs) for reference in favor of exalting decision making quality.     

Multiobjective linear programming with context-dependent preferences

Multiobjective linear programming algorithms are typically based on value maximization. However, there is a growing body of experimental evidence showing that decision maker behavior is inconsistent with value maximization. Tversky and Simonson provide an alternative model for problems with a discrete set of choices. Their model, called the componential context model, has been shown to capture observed decision maker behavior. In this paper, an interactive multiobjective linear programming algorithm is developed which follows the rationale of Tversky and Simonson. The algorithm is illustrated with an example solved using standard linear programming software. Finally, an interactive decision support system based on this algorithm is developed to field test the usefulness of the algorithm. Results show that this algorithm compares favorably with an established algorithm in the field.     

Minimum values over the efficient set in multiple objective decision making

In multiple objective decision making (MODM), it is often helpful to provide the decision maker (DM) with bounds on the values of each of the objectives. Ideal solutions are relatively easy to calculate and provide upper bounds on the value of each objective over the set of efficient solutions. Ideal solutions also provide lower bounds on the value of each objective over the ideal set. However, the lower bounds over the set of efficient solutions can be strictly less than the ideal lower bounds, but are, in general, more difficult to determine. Thus MODM procedures which utilize the ideal lower bound may overlook elements of the set of efficient solutions. This study explores the differences between the subset of the set of efficient solutions to a MODM problem bounded by its ideal solutions and the complete efficient set.     

Gradient projection and local region search for multiobjective optimisation

This paper presents a new method for multiobjective optimisation based on gradient projection and local region search. The gradient projection is conducted through the identification of normal vectors of an efficient frontier. The projection of the gradient of a nonlinear utility function onto the tangent plane of the efficient frontier at a given efficient solution leads to the definition of a feasible local region in a neighbourhood of the solution. Within this local region, a better efficient solution may be sought. To implement such a gradient-based local region search scheme, a new auxiliary problem is developed. If the utility function is given explicitly, this search scheme results in an iterative optimisation algorithm capable of general nonseparable multiobjective optimisation. Otherwise, an interactive decision making algorithm is developed where the decision maker (DM) is expected to provide local preference information in order to determine trade-off directions and step sizes. Optimality conditions for the algorithms are established and the convergence of the algorithms is proven. A multiobjective linear programming (MOLP) problem is taken for example to demonstrate this method both graphically and analytically. A nonlinear multiobjective water quality management problem is finally examined to show the potential application of the method to real world decision problems.     

A Reference Direction Algorithm for Solving Multiple Objective Integer Linear Programming Problems

In this paper, we propose a reference direction approach and an interactive algorithm to solve the general multiple objective integer linear programming problem. At each iteration, only one mixed integer linear programming problem is solved to find an (weak) efficient solution. Each intermediate solution is integer. The decision maker has to provide only the reference point at each iteration. No special software is required to implement the proposed algorithm. The algorithm is illustrated with an example.     

Strange: An interactive method for multi-objective linear programming under uncertainty

In the field of investment planning within a time horizon, problems typically involve multiple objectives, and basic data are uncertain. In a large number of cases, these decision problems can be written as linear programming problems in which time dependent uncertainties affect the coefficients and the right hand side of constraints. Given the possibility of defining plausible scenarios on basic data, discrete sets of such coefficients are given, each with its subjective probability of occurrence. The corresponding structure is then characteristic for Multi-Objective Stochastic Linear Programming (MOSLP).In the paper, an interactive procedure is described to obtain a best compromise for such a MOSLP problem. This algorithm, called Strange, extends the Stem method to take the random aspects into account. It involves in particular, the concepts of stochastic programming with recourse. In its interactive steps, the efficiency projection techniques are used to provide the decision-maker with detailed graphical information on efficient solution families.As an illustration of the successive steps, a didactic example is solved in some detail, and the results of a case study in energy planning are given.     

Interactive fuzzy programming approach to Bi-level quadratic fractional programming problems

In this paper we propose an interactive fuzzy programming method for obtaining a satisfactory solution to a “bi-level quadratic fractional programming problem” with two decision makers (DMs) interacting with their optimal solutions. After determining the fuzzy goals of the DMs at both levels, a satisfactory solution is efficiently derived by updating the satisfactory level of the DM at the upper level with consideration of overall satisfactory balance between both levels. Optimal solutions to the formulated programming problems are obtained by combined use of some of the proper methods. Theoretical results are illustrated with the help of a numerical example.     

Interactive multiobjective fuzzy random linear programming: Maximization of possibility and probability

This paper considers multiobjective linear programming problems with fuzzy random variables coefficients. A new decision making model is proposed to maximize both possibility and probability, which is based on possibilistic programming and stochastic programming. An interactive algorithm is constructed to obtain a satisficing solution satisfying at least weak Pareto optimality.     

安全约束条件下的经济调度优化模型研究

发电侧放开竞争的电力系统需要更加有效、准确的决策工具对有限的资源进行调度规划。短期经济调度优化问题是一个混合整数非线性规划问题,很难得到有效最优解,尤其是对于大规模电力系统。为了提高求解效率,本文提出了一个考虑安全约束的经济调度优化模型(Security-Constrained Economics Dispatch,SCED),主要采用线性化思想处理经济调度优化问题的模型以及各种约束,采用基于校正的交替求解方法,使得调度优化结果在运行成本最小化的前提下满足系统的安全稳定约束。同时,将本文方法运用到IEEE 30节点系统进行测试,从而验证本文方法有效性。     

基于时间窗延迟的资源约束项目调度双层优化研究

本研究从业主—承包商交互的视角构建了一种RCPSP(resource-constrained project scheduling problem)双层优化模型,即在可更新资源约束条件下,项目双方如何进行交互决策达到双方NPV(Net present value)最大化的目标。首先对研究问题进行界定,构建资源约束下的max-NPV项目调度双层优化模型;然后利用延迟优先规则设计了一种基于时间窗延迟的嵌套式自适应遗传算法来求解该模型,以达到双方NPV最大化;最后用一个算例验证算法的有效性,同时通过PSPLIB数值实验说明算法的稳定性,并分析关键参数对项目双方收益的影响。研究结果为项目进程的安排以及奖励机制的设计提供依据,以提高双方利益。     

Hierarchical multi-objective decision making

This paper proposes a hierarchical procedure for solving decision problems with multiple objectives. The procedure consists of two levels, a top- and a base-level. The main idea is that the top-level only provides general preference information. Taking this information into account the base-level then determines a compromise solution. For a multi-objective linear program it will be shown how such a hierarchical procedure can be structured by deriving weight restrictions from the general preference information of the top-level and by using the interactive MODM procedure of Zionts and Wallenius on the base-level.