共查询到20条相似文献,搜索用时 15 毫秒
1.
Finding an efficient or weakly efficient solution in a multiobjective linear programming (MOLP) problem is not a difficult task. The difficulty lies in finding all these solutions and representing their structures. Since there are many convenient approaches that obtain all of the (weakly) efficient extreme points and (weakly) efficient extreme rays in an MOLP, this paper develops an algorithm which effectively finds all of the (weakly) efficient maximal faces in an MOLP using all of the (weakly) efficient extreme points and extreme rays. The proposed algorithm avoids the degeneration problem, which is the major problem of the most of previous algorithms and gives an explicit structure for maximal efficient (weak efficient) faces. Consequently, it gives a convenient representation of efficient (weak efficient) set using maximal efficient (weak efficient) faces. The proposed algorithm is based on two facts. Firstly, the efficiency and weak efficiency property of a face is determined using a relative interior point of it. Secondly, the relative interior point is achieved using some affine independent points. Indeed, the affine independent property enable us to obtain an efficient relative interior point rapidly. 相似文献
2.
Paul Armand 《Mathematical Programming》1993,61(1-3):357-375
An algorithm for finding the whole efficient set of a multiobjective linear program is proposed. From the set of efficient edges incident to a vertex, a characterization of maximal efficient faces containing the vertex is given. By means of the lexicographic selection rule of Dantzig, Orden and Wolfe, a connectedness property of the set of dual optimal bases associated to a degenerate vertex is proved. An application of this to the problem of enumerating all the efficient edges incident to a degenerate vertex is proposed. Our method is illustrated with numerical examples and comparisons with Armand—Malivert's algorithm show that this new algorithm uses less computer time. 相似文献
3.
Let a multiobjective linear programming problem and any efficient solution be given. Tolerance analysis aims to compute interval tolerances for (possibly all) objective function coefficients such that the efficient solution remains efficient for any perturbation of the coefficients within the computed intervals. The known methods either yield tolerances that are not the maximal possible ones, or they consider perturbations of weights of the weighted sum scalarization only. We focus directly on perturbations of the objective function coefficients, which makes the approach independent on a scalarization technique used. In this paper, we propose a method for calculating the supremal tolerance (the maximal one need not exist). The main disadvantage of the method is the exponential running time in the worst case. Nevertheless, we show that the problem of determining the maximal/supremal tolerance is NP-hard, so an efficient (polynomial time) procedure is not likely to exist. We illustrate our approach on examples and present an application in transportation problems. Since the maximal tolerance may be small, we extend the notion to individual lower and upper tolerances for each objective function coefficient. An algorithm for computing maximal individual tolerances is proposed. 相似文献
4.
This paper develops a method for finding the whole set of efficient points of a multiobjective linear problem. Two algorithms are presented; the first one describes the set of all efficient vertices and all efficient rays of the constraint polyhedron, while the second one generates the set of all efficient faces. The method has been tested on several examples for which numerical results are reported.The authors are grateful to Professor W. Stadler and an anonymous referee for their helpful comments and corrections. 相似文献
5.
It is not a difficult task to find a weak Pareto or Pareto solution in a multiobjective linear programming (MOLP) problem. The difficulty lies in finding all these solutions and representing their structure. This paper develops an algorithm for solving this problem. We investigate the solutions and their relationships in the objective space. The algorithm determines finite number of weights, each of which corresponds to a weighted sum problems. By solving these problems, we further obtain all weak Pareto and Pareto solutions of the MOLP and their structure in the constraint space. The algorithm avoids the degeneration problem, which is a major hurdle of previous works, and presents an easy and clear solution structure. 相似文献
6.
Milan Hladík 《Operations Research Letters》2008,36(3):393-396
We consider a multiobjective linear program. We propose a procedure for computing an additive and multiplicative (percentage) tolerance in which all the objective function coefficients may simultaneously and independently vary while preserving the efficiency of a given solution. For a nondegenerate basic solution, the procedure runs in polynomial time. 相似文献
7.
《Optimization》2012,61(6):905-911
In this paper so-called ε-approximations for the efficiency set of vector minimization problems are defined. A general generating algorithm for such E-approximations is given which will be modified for linear continuous problems by means of the Dual Simplex Method. 相似文献
8.
We use normal directions of the outcome set to develop a method of outer approximation for solving generalized convex multiobjective programming problems. We prove the convergence of the method and report some computational experiments. As an application, we obtain an algorithm to solve an associated multiplicative problem over a convex constraint set. 相似文献
9.
Curve fitting is an interesting and important subject in mathematics and engineering. It has been studied extensively and a number of approaches, mostly based on polynomials and piecewise polynomials, have been employed. In the usual setting, some data points are given and one wants to find a polynomial function with the minimum violations measured by a norm in the given data points. In these approaches, norms are applied to aggregate all violations as a scalar. 相似文献
10.
In equitable multiobjective optimization all the objectives are uniformly optimized, but in some cases the decision maker believes that some of them should be uniformly optimized. To solve this problem in this paper, the original problem is decomposed into a collection of smaller subproblems, according to the decision maker, and then the subproblems are solved by the concept of equitable efficiency. Furthermore, by using the concept of P-equitable efficiency two models are presented to coordinate equitably efficient solutions of subproblems. 相似文献
11.
Farhad Hosseinzadeh Lotfi Abbas Ali Noora Gholam Reza Jahanshahloo Mohammad Khodabakhshi Ali Payan 《Applied Mathematical Modelling》2010
In a multi-objective linear fractional programming problem (MOLFPP), it is often useful to check the efficiency of a given feasible solution, and if the solution is efficient, it is useful to check strong or weak efficiency. In this paper, by applying a geometrical interpretation, a linear programming approach is achieved to test weak efficiency. Also, in order to test strong efficiency for a given weakly efficient point, a linear programming approach is constructed. 相似文献
12.
R.K Ahuja 《Operations Research Letters》1985,4(3):131-134
In this paper, we consider the following minimax linear programming problem: min z = max1 ≤ j ≤ n{CjXj}, subject to Ax = g, x ≥ 0. It is well known that this problem can be transformed into a linear program by introducing n additional constraints. We note that these additional constraints can be considered implicitly by treating them as parametric upper bounds. Based on this approach we develop two algorithms: a parametric algorithm and a primal—dual algorithm. The parametric algorithm solves a linear programming problem with parametric upper bounds and the primal—dual algorithm solves a sequence of related dual feasible linear programming problems. Computation results are also presented, which indicate that both the algorithms are substantially faster than the simplex algorithm applied to the enlarged linear programming problem. 相似文献
13.
Hideki Katagiri Masatoshi SakawaKosuke Kato Ichiro Nishizaki 《European Journal of Operational Research》2008
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. 相似文献
14.
15.
This paper presents a new concept of efficient solution for the linear vector maximization problem. Briefly, these solutions are efficient with respect to the constraints, in addition to being efficient with respect to the multiple objectives. The duality theory of linear vector maximization is developed in terms of this solution concept and then is used to formulate the problem as a linear program.This research has been partially supported by grants from the Canada Council and the National Research Council of Canada. 相似文献
16.
In most of studies on multiobjective noncooperative games, games are represented in normal form and a solution concept of
Pareto equilibrium solutions which is an extension of Nash equilibrium solutions has been focused on. However, for analyzing
economic situations and modeling real world applications, we often see cases where the extensive form representation of games
is more appropriate than the normal form representation. In this paper, in a multiobjective two-person nonzero-sum game in
extensive form, we employ the sequence form of strategy representation to define a nondominated equilibrium solution which
is an extension of a Pareto equilibrium solution, and provide a necessary and sufficient condition that a pair of realization
plans, which are strategies of players in sequence form, is a nondominated equilibrium solution. Using the necessary and sufficient
condition, we formulate a mathematical programming problem yielding nondominated equilibrium solutions. Finally, giving a
numerical example, we demonstrate that nondominated equilibrium solutions can be obtained by solving the formulated mathematical
programming problem. 相似文献
17.
In this paper we present a new approach, based on the Nearest Interval Approximation Operator, for dealing with a multiobjective programming problem with fuzzy-valued objective functions. 相似文献
18.
A compromise solution for the multiobjective stochastic linear programming under partial uncertainty
This paper solves the multiobjective stochastic linear program with partially known probability. We address the case where the probability distribution is defined by crisp inequalities. We propose a chance constrained approach and a compromise programming approach to transform the multiobjective stochastic linear program with linear partial information on probability distribution into its equivalent uniobjective problem. The resulting program is then solved using the modified L-shaped method. We illustrate our results by an example. 相似文献
19.
20.
When solving a multiobjective programming problem by the weighted sum approach, weights represent the relative importance
associated to the objectives. As these values are usually imprecise, it is important to analyze the sensitivity of the solution
under possible deviations on the estimated values. In this sense, the tolerance approach provides a direct measure of how
weights may vary simultaneously and independently from their estimated values while still retaining the same efficient solution.
This paper provides an explicit expression to the maximum tolerance on weights in a multiobjective linear fractional programming
problem when all the denominators are equal. An application is also presented to illustrate how the results may help the decision
maker to choose a most satisfactory solution in a production problem. 相似文献