共查询到20条相似文献,搜索用时 15 毫秒
1.
G Mavrotas D Diakoulaki D Assimacopoulos 《The Journal of the Operational Research Society》1998,49(5):549-557
In multiple objective linear programming (MOLP) problems the extraction of all the efficient extreme points becomes problematic as the size of the problem increases. One of the suggested actions, in order to keep the size of the efficient set to manageable limits, is the use of bounds on the values of the objective functions by the decision maker. The unacceptable efficient solutions are screened out from further investigation and the size of the efficient set is reduced. Although the bounding of the objective functions is widely used in practice, the effect of this action on the size of the efficient set has not been investigated. In this paper, we study the effect of individual and simultaneous bounding of the objective functions on the number of the generated efficient points. In order to estimate the underlying relationships, a computational experiment is designed, in which randomly generated multiple objective linear programming problems of various sizes are systematically examined. 相似文献
2.
In this paper, an interactive paired comparison simplex based method formultiple objective linear programming (MOLP) problems
is developed and compared to other interactive MOLP methods. The decision maker (DM)’s utility function is assumed to be unknown,
but is an additive function of his known linearized objective functions. A test for ‘utility efficiency’ for MOLP problems
is developed to reduce the number of efficient extreme points generated and the number of questions posed to the DM. The notion
of ‘strength of preference ’ is developed for the assessment of the DM’s unknown utility function where he can express his
preference for a pair of extreme points as ‘strong ’, ‘weak ’, or ‘almost indifferent ’. The problem of ‘inconsistency of
the DM’ is formalized and its resolution is discussed. An example of the method and detailed computational results comparing
it with other interactive MOLP methods are presented. Several performance measures for comparative evaluations of interactive
multiple objective programming methods are also discussed.
All rights reserved. This study, or parts thereof, may not be reproduced in any form without written permission of the authors. 相似文献
3.
Multiobjective linear optimization problems (MOLPs) arise when several linear objective functions have to be optimized over a convex polyhedron. In this paper, we propose a new method for generating the entire efficient set for MOLPs in the outcome space. This method is based on the concept of adjacencies between efficient extreme points. It uses a local exploration approach to generate simultaneously efficient extreme points and maximal efficient faces. We therefore define an efficient face as the combination of adjacent efficient extreme points that define its border. We propose to use an iterative simplex pivoting algorithm to find adjacent efficient extreme points. Concurrently, maximal efficient faces are generated by testing relative interior points. The proposed method is constructive such that each extreme point, while searching for incident faces, can transmit some local informations to its adjacent efficient extreme points in order to complete the faces’ construction. The performance of our method is reported and the computational results based on randomly generated MOLPs are discussed. 相似文献
4.
Nguyen V. Thoai 《Journal of Global Optimization》2012,52(3):499-508
Two of the main approaches in multiple criteria optimization are optimization over the efficient set and utility function
program. These are nonconvex optimization problems in which local optima can be different from global optima. Existing global
optimization methods for solving such problems can only work well for problems of moderate dimensions. In this article, we
propose some ways to reduce the number of criteria and the dimension of a linear multiple criteria optimization problem. By
the concept of so-called representative and extreme criteria, which is motivated by the concept of redundant (or nonessential)
objective functions of Gal and Leberling, we can reduce the number of criteria without altering the set of efficient solutions.
Furthermore, by using linear independent criteria, the linear multiple criteria optimization problem under consideration can
be transformed into an equivalent linear multiple criteria optimization problem in the space of linear independent criteria.
This equivalence is understood in a sense that efficient solutions of each problem can be derived from efficient solutions
of the other by some affine transformation. As a result, such criteria and dimension reduction techniques could help to increase
the efficiency of existing algorithms and to develop new methods for handling global optimization problems arisen from multiple
objective optimization. 相似文献
5.
《European Journal of Operational Research》2005,160(1):242-251
In this paper we consider solution generation method for multiple objective linear programming problems. The set of efficient or Pareto optimal solutions for the problems can be regarded as global information in multiple objective decision making situation. In the past three decades as solution generation techniques various conventional algorithms based on simplex-like approach with heavy computational burden were developed. Therefore, the development of novel and useful directions in efficient solution generation method have been desired. The purpose of this paper is to develop theoretical results and computational techniques of the efficient solution generation method based on extreme ray generation method that sequentially generates efficient points and rays by adding inequality constraints of the polyhedral feasible region. 相似文献
6.
7.
In this paper, we address linear bilevel programs when the coefficients of both objective functions are interval numbers. The focus is on the optimal value range problem which consists of computing the best and worst optimal objective function values and determining the settings of the interval coefficients which provide these values. We prove by examples that, in general, there is no precise way of systematizing the specific values of the interval coefficients that can be used to compute the best and worst possible optimal solutions. Taking into account the properties of linear bilevel problems, we prove that these two optimal solutions occur at extreme points of the polyhedron defined by the common constraints. Moreover, we develop two algorithms based on ranking extreme points that allow us to compute them as well as determining settings of the interval coefficients which provide the optimal value range. 相似文献
8.
This paper considers a class of quadratic programs where the constraints ae linear and the objective is a product of two linear functions. Assuming the two linear factors to be non-negative, maximization and minimization cases are considered. Each case is analyzed with the help of a bicriteria linear program obtained by replacing the quadratic objective with the two linear functions. Global minimum (maximum) is attained at an efficient extreme point (efficient point) of the feasible set in the solution space and corresponds to an efficient extreme point (efficient point) of the feasible set in the bicriteria space. Utilizing this fact and certain other properties, two finite algorithms, including validations are given for solving the respective problems. Each of these, essentially, consists of solving a sequence of linear programs. Finally, a method is provided for relaxing the non-negativity assumption on the two linear factors of the objective function. 相似文献
9.
《European Journal of Operational Research》2005,162(2):484-496
In this paper we employ regression analysis to construct relationships for predicting the number of efficient extreme points in MOLPs (multiple objective linear programs) with up to 120,000 efficient extreme points, and the CPU time to compute them. Principal among the factors affecting the number of efficient extreme points and CPU time are the number of objectives, criterion cone size, number of constraints, number of variables, and the nonzero density of the constraint matrix. The regression equations show the degree to which interactions are present among the factors and provide a more formal basis for understanding how the complexity of the efficient set, an indicator of the difficulty involved in solving a multiple criteria problem, increases with problem size. 相似文献
10.
Bilevel programming involves two optimization problems where the constraint region of the first level problem is implicitly determined by another optimization problem. This paper develops a genetic algorithm for the linear bilevel problem in which both objective functions are linear and the common constraint region is a polyhedron. Taking into account the existence of an extreme point of the polyhedron which solves the problem, the algorithm aims to combine classical extreme point enumeration techniques with genetic search methods by associating chromosomes with extreme points of the polyhedron. The numerical results show the efficiency of the proposed algorithm. In addition, this genetic algorithm can also be used for solving quasiconcave bilevel problems provided that the second level objective function is linear. 相似文献
11.
In this paper an algorithm is developed to generate all nondominated extreme points and edges of the set of objective values of a multiple objective linear program. The approach uses simplex tableaux but avoids generating unnecessary extreme points or bases of extreme points. The procedure is based on, and improves, an algorithm Dauer and Liu developed for this problem. Essential to this approach is the work of Gal and Kruse on the neighborhood problem of determining all extreme points of a convex polytope that are adjacent to a given (degenerate) extreme point of the set. The algorithm will incorporate Gal's degeneracy graph approach to the neighborhood problem with Dauer's objective space analysis of multiple objective linear programs. 相似文献
12.
Herminia I. Calvete Carmen Galé 《Journal of Computational and Applied Mathematics》2010,234(4):950-959
Bilevel programming has been proposed for dealing with decision processes involving two decision makers with a hierarchical structure. They are characterized by the existence of two optimization problems in which the constraint region of the upper level problem is implicitly determined by the lower level optimization problem. Focus of the paper is on general bilevel optimization problems with multiple objectives at the upper level of decision making. When all objective functions are linear and constraints at both levels define polyhedra, it is proved that the set of efficient solutions is non-empty. Taking into account the properties of the feasible region of the bilevel problem, some methods of computing efficient solutions are given based on both weighted sum scalarization and scalarization techniques. All the methods result in solving linear bilevel problems with a single objective function at each level. 相似文献
13.
In this paper we develop a method for finding all efficient extreme points for multiple objective linear programs. Simple characterizations of the efficiency of an edge incident to a nondegenerate or a degenerate efficient vertex are given. These characterizations form the basis of an algorithm for enumerating all efficient vertices. The algorithm appears to have definite computational advantages over other methods. Some illustrative examples are included. 相似文献
14.
F. Hosseinzadeh Lotfi A. A. Noora G. R. Jahanshahloo J. Jablonsky M. R. Mozaffari J. Gerami 《Central European Journal of Operations Research》2009,17(1):1-11
In this paper a multiple objective linear programming (MOLP) problem whose feasible region is the production possibility set
with variable returns to scale is proposed. By solving this MOLP problem by multicriterion simplex method, the extreme efficient
Pareto points can be obtained. Then the extreme efficient units in data envelopment analysis (DEA) with variable returns to
scale, considering the specified theorems and conditions, can be obtained. Therefore, by solving the proposed MOLP problem,
the non-dominant units in DEA can be found. Finally, a numerical example is provided. 相似文献
15.
This paper presents an ADBASE-based parallel algorithm forsolving multiple objective linear programs (MOLPs). Job balance,speedup and scalability are of primary interest in evaluatingefficiency of the new algorithm. The scalability of a parallelalgorithm is a measure of its capacity to increase performance withrespect to the number of processors used. Implementation results onIntel iPSC/2 and Paragon multiprocessors show that the algorithmsignificantly speeds up the process of solving MOLPs, which isunderstood as generating all or some efficient extreme points andunbounded efficient edges. The algorithm is shown to be scalable andgives better results for large problems. Motivation andjustification for solving large MOLPs are also included. 相似文献
16.
《European Journal of Operational Research》2002,139(1):26-41
Various computational difficulties arise in using decision set-based vector maximization methods to solve multiple objective linear programming problems. As a result, several researchers have begun to explore the possibility of solving these problems by examining subsets of their outcome sets, rather than of their decision sets. In this article, we present and validate a basic weight set decomposition approach for generating the set of all efficient extreme points in the outcome set of a multiple objective linear program. Based upon this approach, we then develop an algorithm, called the Weight Set Decomposition Algorithm, for generating this set. A sample problem is solved using this algorithm, and the main potential computational and practical advantages of the algorithm are indicated. 相似文献
17.
An interactive method is developed for solving the general nonlinear multiple objective mathematical programming problems. The method asks the decision maker to provide partial information (local tradeoff ratios) about his utility (preference) function at each iteration. Using the information, the method generates an efficient solution and presents it to the decision maker. In so doing, the best compromise solution is sought in a finite number of iterations. This method differs from the existing feasible direction methods in that (i) it allows the decision maker to consider only efficient solutions throughout, (ii) the requirement of line search is optional, and (iii) it solves the problems with linear objective functions and linear utility function in one iteration. Using various problems selected from the literature, five line search variations of the method are tested and compared to one another. The nonexisting decision maker is simulated using three different recognition levels, and their impact on the method is also investigated. 相似文献
18.
Bilevel programming has been proposed for dealing with decision processes involving two decision makers with a hierarchical
structure. They are characterized by the existence of two optimization problems in which the constraint region of the upper
level problem is implicitly determined by the lower level optimization problem. In this paper a genetic algorithm is proposed
for the class of bilevel problems in which both level objective functions are linear fractional and the common constraint
region is a bounded polyhedron. The algorithm associates chromosomes with extreme points of the polyhedron and searches for
a feasible solution close to the optimal solution by proposing efficient crossover and mutation procedures. The computational
study shows a good performance of the algorithm, both in terms of solution quality and computational time. 相似文献
19.
This paper deals with a class of multiple objective linear programs (MOLP) called lexicographic multiple objective linear programs (LMOLP). In this paper, by providing an efficient algorithm which employs the preceding computations as well, it is shown how we can solve the LMOLP problem if the priority of the objective functions is changed. In fact, the proposed algorithm is a kind of sensitivity analysis on the priority of the objective functions in the LMOLP problems. 相似文献
20.
Hadi Charkhgard Martin Savelsbergh Masoud Talebian 《4OR: A Quarterly Journal of Operations Research》2018,16(2):151-171
We study the connection between biobjective mixed integer linear programming and normal form games with two players. We first investigate computing Nash equilibria of normal form games with two players using single-objective mixed integer linear programming. Then, we define the concept of efficient (Pareto optimal) Nash equilibria. This concept is precisely equivalent to the concept of efficient solutions in multi-objective optimization, where the solutions are Nash equilibria. We prove that the set of all points in the payoff (or objective) space of a normal form game with two players corresponding to the utilities of players in an efficient Nash equilibrium, the so-called nondominated Nash points, is finite. We demonstrate that biobjective mixed integer linear programming, where the utility of each player is an objective function, can be used to compute the set of nondominated Nash points. Finally, we illustrate how the nondominated Nash points can be used to determine the disagreement point of a bargaining problem. 相似文献