A concept of a robust solution of a multicriterial linear programming problem

A new concept of a robust solution of a multicriterial linear programming problem is proposed. The robust solution is understood here as the best starting point, prepared while the preferences of the decision maker with respect to the criteria are still unknown, for the adaptation of the solution to the preferences of the decision maker, once they are finally known. The objective is the total cost of the initial preparation and of the later potential adaptation of the solution. In the starting robust solution the decision variables may have interval values. The problem can be solved by means of the simplex algorithm. A numerical example illustrates the approach.     

Some Theory and an Approach to Solving Sequential Multiple-Criteria Decision Problems

This paper examines a sequential multiple-criteria decision problem. The problem arises when a decision-maker is unable to consider all possible decision alternatives simultaneously. The decision-maker evaluates only a subset of all decision alternatives, from which he chooses the most preferred solution. Obviously, this solution is not necessarily ‘globally’ best. An interesting question is: how good is the most preferred solution and what are the chances of finding a better solution by considering additional alternatives? A unified approach to solving this problem based on probability theory is presented and illustrated with numerical examples.     

A multiobjective decomposition-coordination framework with an application to vehicle layout and configuration design

This short paper addresses both researchers in multiobjective optimization as well as industrial practitioners and decision makers in need of solving optimization and decision problems with multiple criteria. To enhance the solution and decision process, a multiobjective decomposition-coordination framework is presented that initially decomposes the original problem into a collection of smaller-sized subproblems that can be solved for their individual solution sets. A common solution for all decomposed and, thus, the original problem is then achieved through a subsequent coordination mechanism that uses the concept of epsilon-efficiency to integrate decisions on the desired tradeoffs between these individual solutions. An application to a problem from vehicle configuration design is selected for further illustration of the results in this paper and suggests that the proposed method is an effective and promising new solution technique for multicriteria decision making and optimization. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

An application of multi-objective modeling: The case of the Indian sugar industry

A multi-objective linear programming model is developed for the Indian sugar industry to plan for additional output by production technique, geographical region and forecasted year. Various policy scenarios generated by assigning different values to the policy variables in the model are studied. Thus a useful planning tool which demonstrates the exact impact of the policy parameters on various objectives is provided to the central decision maker. A satisficing multi-objective decision making method is developed based on an existing method of solution and used in policy analysis. The solution method is ideally suited to any general planning problem.     

Interactive procedure for a multiobjective stochastic discrete dynamic problem

Multiple objectives and dynamics characterize many sequential decision problems. In the paper we consider returns in partially ordered criteria space as a way of generalization of single criterion dynamic programming models to multiobjective case. In our problem evaluations of alternatives with respect to criteria are represented by distribution functions. Thus, the overall comparison of two alternatives is equivalent to the comparison of two vectors of probability distributions. We assume that the decision maker tries to find a solution preferred to all other solutions (the most preferred solution). In the paper a new interactive procedure for stochastic, dynamic multiple criteria decision making problem is proposed. The procedure consists of two steps. First, the Bellman principle is used to identify the set of efficient solutions. Next interactive approach is employed to find the most preferred solution. A numerical example and a real-world application are presented to illustrate the applicability of the proposed technique.     

An Asset Liability Management Model for Casualty Insurers: Complexity Reduction vs. Parameterized Decision Rules

In this paper we study possibilities for complexity reductions in large scale stochastic programming problems with specific reference to the asset liability management (ALM) problem for casualty insurers. We describe a dynamic, stochastic portfolio selection model, within which the casualty insurer maximizes a concave objective function, indicating that the company perceives itself as risk averse. In this context we examine the sensitivity of the solution to the quality and accuracy with which economic uncertainties are represented in the model. We demonstrate a solution method that combines two solution approaches: A truly stochastic, dynamic solution method that requires scenario aggregation, and a solution method based on ex ante decision rules, that allow for a greater number of scenarios. This dynamic/fix mix decision policy, which facilitates a huge number of outcomes, is then compared to a fully dynamic decision policy, requiring fewer outcomes. We present results from solving the model. Basically we find that the insurance company is likely to prefer accurate representation of uncertainties. In order to accomplish this, it will accept to calculate its current portfolio using parameterized decision rules.     

Finite approximations of data-based decision problems under imprecise probabilities

In decision theory under imprecise probabilities, discretizations are a crucial topic because many applications involve infinite sets whereas most procedures in the theory of imprecise probabilities can only be calculated for finite sets so far. The present paper develops a method for discretizing sample spaces in data-based decision theory under imprecise probabilities. The proposed method turns an original decision problem into a discretized decision problem. It is shown that any solution of the discretized decision problem approximately solves the original problem.In doing so, it is pointed out that the commonly used method of natural extension can be most instable. A way to avoid this instability is presented which is sufficient for the purpose of the paper.     

Bicriteria optimization in the newsvendor problem with uniformly distributed demand

This paper analytically addresses the Bicriteria decision newsvendor problem of a retailer with the conflicting goals of maximizing the expected profit and the probability of exceeding it and obtains a closed form solution for a uniformly distributed demand. This is done by using the existence of a closed form solution for the second criterion to arrive at the solution for the Bicriteria problem. The decision variable remains the traditional order quantity intended to satisfy an uncertain demand, but there is no solution that maximizes each goal simultaneously. The search for optimality reduces to simple comparisons between parameters and the estimation of a critical weight. A numerical example is used throughout the paper to highlight the nature of the solutions and to illustrate the key properties of the various elements of the Bicriteria problem.     

The supplier selection problem of a manufacturing company using the weighted multi-choice goal programming and MINMAX multi-choice goal programming

This paper presents two methods of decision making, Weighted multi-choice goal programming (MCGP) and MINMAX MCGP. With the proposed Weighted MCGP method, decision makers can set different weights w_i for each goal with linguistic terms, such as high, average and low, which can be transformed into trapezoidal fuzzy numbers. Meanwhile, with the proposed MINMAX MCGP method, this study also let decision makers set the satisfaction membership function for each goal according to their preference in order to eliminate the effect of different scales in each goal.This paper also investigates the relationship between Weighted multi-choice goal programming and MINMAX multi-choice goal programming. According to the sensitivity analysis, decision makers can get the solution with the minimum aggregate deviation for all multiple goals from the Weighted multi-choice goal programming. Meanwhile, decision makers can get the solution with the most balanced solution between all multiple goals from the MINMAX multi-choice goal programming method. The weight variable is introduced to the above two methods to provide decision-makers with a mechanism to evaluate the discrepancy between the maximum aggregate achievement and the most balanced solution, enabling decision-makers to reach the preferable decision for their situation. A real-world problem of supplier selection by the purchasing and sales managers of a manufacturing company is used to illustrate the differing solutions given by the two models.     

Deterministic solution approach for some classes of nonlinear multilevel programs with multiple followers

In this paper we investigate multilevel programming problems with multiple followers in each hierarchical decision level. It is known that such type of problems are highly non-convex and hard to solve. A solution algorithm have been proposed by reformulating the given multilevel program with multiple followers at each level that share common resources into its equivalent multilevel program having single follower at each decision level. Even though, the reformulated multilevel optimization problem may contain non-convex terms at the objective functions at each level of the decision hierarchy, we applied multi-parametric branch-and-bound algorithm to solve the resulting problem that has polyhedral constraints. The solution procedure is implemented and tested for a variety of illustrative examples.     

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.     

Two level hierarchical time minimizing transportation problem

A two level hierarchical balanced time minimizing transportation problem is considered in this paper. The whole set of source-destination links consists of two disjoint partitions namely Level-I links and Level-II links. Some quantity of a homogeneous product is first shipped from sources to destinations by Level-I decision maker using only Level-I links, and on its completion the Level-II decision maker transports the remaining quantity of the product in an optimal fashion using only Level-II links. Transportation is assumed to be done in parallel in both the levels. The aim is to find that feasible solution for Level-I decision maker corresponding to which the optimal feasible solution for Level-II decision maker is such that the sum of shipment times in Level-I and Level-II is the least. To obtain the global optimal feasible solution of this non-convex optimization problem, related balanced time minimizing transportation problems are defined. Based upon the optimal feasible solutions of these related problems, standard cost minimizing transportation problems are constructed whose optimal feasible solutions provide various pairs for shipment times for Level-I and Level-II decision makers. The best out of these pairs is finally selected. Being dependent upon solutions of a finite number of balanced time minimizing and cost minimizing transportation problems, the proposed algorithm is a polynomial bound algorithm. The developed algorithm has been implemented and tested on a variety of test problems and performance is found to be quite encouraging.     

A naïve approach for solving MCDM problems: the GUESS method

We present a simple multiple criteria decision making solution technique called the GUESS method. This method has been used in MCDM experiments where different solution methods have been compared. The GUESS method is an interactive solution method designed to be used with continuous multiple criteria decision problems. It is based on a class of solution methods called reference point methods whereby the decision maker generates a sequence of solutions based on a sequence of guesses or aspiration vectors. In this paper we explain the basic concepts of the GUESS method and describe the algorithm of the solution method. An illustrative example is provided, along with a discussion of the method from a behavioural decision making perspective.     

一类线性规划问题的快速解法

研究了在组合投资和多属性决策指标权重确定中有着重要应用的一类线性规划问题,得到了该类线性规划问题有可行解的充要条件,以及在有可行解的情况下寻求最优解的快速解法.     

A fuzzy closeness approach to fuzzy multi-attribute decision making

The aim of this paper is to develop a new fuzzy closeness (FC) methodology for multi-attribute decision making (MADM) in fuzzy environments, which is an important research field in decision science and operations research. The TOPSIS method based on an aggregating function representing “closeness to the ideal solution” is one of the well-known MADM methods. However, while the highest ranked alternative by the TOPSIS method is the best in terms of its ranking index, this does not mean that it is always the closest to the ideal solution. Furthermore, the TOPSIS method presumes crisp data while fuzziness is inherent in decision data and decision making processes, so that fuzzy ratings using linguistic variables are better suited for assessing decision alternatives. In this paper, a new FC method for MADM under fuzzy environments is developed by introducing a multi-attribute ranking index based on the particular measure of closeness to the ideal solution, which is developed from the fuzzy weighted Minkowski distance used as an aggregating function in a compromise programming method. The FC method of compromise ranking determines a compromise solution, providing a maximum “group utility” for the “majority” and a minimum individual regret for the “opponent”. A real example of a personnel selection problem is examined to demonstrate the implementation process of the method proposed in this paper.     

A fuzzy theoretic approach to simulation metamodeling

In this paper, we explore the potential application of fuzzy linear regression in developing simulation metamodels. It should be noted that the basic construct for simulation metamodels involves uncertainties and ambiguities that may be better addressed through fuzzy linear regression application. The solution techniques employed by fuzzy linear regression are very familiar, and the generation of fuzzy outputs may offer a wide range of solution space to the decision maker, thereby reducing the risk of making an incorrect economic decision. A numerical example is presented to show how a possibility distribution is used to capture the vagueness in a dependent variable for a regression metamodel.     

群体决策问题的一种最优均衡解

本文引进了群体决策问题的一个最优解概念—s~*-最优均衡解,s~*-最优均衡解可以作为群体决策问题的一种解,它的实际意义是为所有的决策者找到一个最优解。我们证明了求解s~*-最优均衡解等价于求解一个相应的单目标优化问题,且在一定条件下s~*-最优均衡解总是存在的。我们也讨论按比例分配的s~*-最优均衡解问题。本文为解决群体决策问题提供了一种新的途径。     

Robust optimization for interactive multiobjective programming with imprecise information applied to R&D project portfolio selection

A multiobjective binary integer programming model for R&D project portfolio selection with competing objectives is developed when problem coefficients in both objective functions and constraints are uncertain. Robust optimization is used in dealing with uncertainty while an interactive procedure is used in making tradeoffs among the multiple objectives. Robust nondominated solutions are generated by solving the linearized counterpart of the robust augmented weighted Tchebycheff programs. A decision maker’s most preferred solution is identified in the interactive robust weighted Tchebycheff procedure by progressively eliciting and incorporating the decision maker’s preference information into the solution process. An example is presented to illustrate the solution approach and performance. The developed approach can also be applied to general multiobjective mixed integer programming problems.     

Interactive weight assessment in multiple attribute decision making

A weight assessing method is given for solving a multiple attribute decision problem involving one decision maker. The method provides significant freedom to the decision maker who is asked only to specify certain groups of attributes and the corresponding joint weights. The method then provides a sophisticated interaction between various levels of the attributes involved. Furthermore, if the decision maker wishes to give additional information of the above-mentioned kind, he establishes an interaction on the level of the solution process. This can compensate for the inherent limitations of any method based on scalar utility functions by allowing a certain intransitivity and incomparability of preferences, which are natural in multiple attribute situations.     

A survey of algorithmic methods for partially observed Markov decision processes

A partially observed Markov decision process (POMDP) is a generalization of a Markov decision process that allows for incomplete information regarding the state of the system. The significant applied potential for such processes remains largely unrealized, due to an historical lack of tractable solution methodologies. This paper reviews some of the current algorithmic alternatives for solving discrete-time, finite POMDPs over both finite and infinite horizons. The major impediment to exact solution is that, even with a finite set of internal system states, the set of possible information states is uncountably infinite. Finite algorithms are theoretically available for exact solution of the finite horizon problem, but these are computationally intractable for even modest-sized problems. Several approximation methodologies are reviewed that have the potential to generate computationally feasible, high precision solutions.