作者：
STEUER, REUniv of Georgia
Coll of Business Administration Athens GA USA Univ of Georgia Coll of Business Administration Athens GA USA
Single objective cost minimization linear programming models are used as computerized decision-aids in sausage manufacturing (hot dogs, bologna, salami, etc.). However, sausage blending is clearly a problem with multi...
详细信息
Single objective cost minimization linear programming models are used as computerized decision-aids in sausage manufacturing (hot dogs, bologna, salami, etc.). However, sausage blending is clearly a problem with multiple conflicting criteria (cost, color, fat, protein, moisture, etc.) Presented in this paper is a vector-maximum/filtering MOLP (multipleobjective linear programming) methodology for use as an improved decision-making approach with single formula sausage blending problems.
The paper describes the Multi-Criteria Branch and Bound (MCBB) algorithm. a vector maximization algorithm capable of deriving all efficient extreme points, for small and medium-sized Mixed 0-1 multipleobjective Linea...
详细信息
The paper describes the Multi-Criteria Branch and Bound (MCBB) algorithm. a vector maximization algorithm capable of deriving all efficient extreme points, for small and medium-sized Mixed 0-1 multipleobjective Linear programming (Mixed 0-1 MOLP). Particular emphasis is given to computational aspects aiming principally at accelerating the solution procedure. For facilitating the decision maker's search toward the most preferred efficient solution, the notion of efficient combinations of the binary variables is further exploited. It is also shown that the MCBB algorithm can be used in single objective problems (Mixed Integer LP problems) in order to determine all alternative optima, as well as in Mixed Integer MOLP problems and Pure 0-1 MOLP problems that frequently arise in practice. A computational experiment is included in the paper in order to illustrate the performance of the algorithm. (c) 2005 Elsevier Inc. All rights reserved.
Facing the increasing global competition of steel production and the rapid growth of the output of steel products,to use more scrap steel instead of iron ore has been well acknowledged as an available strategy to supp...
详细信息
Facing the increasing global competition of steel production and the rapid growth of the output of steel products,to use more scrap steel instead of iron ore has been well acknowledged as an available strategy to support longterm development for the iron and steel *** and practitioners have paid more and more attentions on the issues related effective utilizing scrap steel for the reason that the reverse logistics of scrap steel commonly has many specialties distinguishing from other *** paper studies the combinatorial optimization problem integrating the specialties of scrap steel recycling under considerations of economic profit and protection of environment.A model consisting of multiple suppliers under push and pull policy,one dealer and multiple users is presented,which has two important objective functions,*** is the total cost of the whole network for scrap steel recycling,and the other is the total discharge of industrial pollutants of recycling *** is expected that this work could contribute to strategic management of supply chain for industrial manufacturers and other similar scenarios.
When making decisions with multiple criteria, a decision maker often thinks in terms of an aspiration point or levels of achievement for the criteria. In multipleobjective mathematical programming, solution methods b...
详细信息
When making decisions with multiple criteria, a decision maker often thinks in terms of an aspiration point or levels of achievement for the criteria. In multipleobjective mathematical programming, solution methods based on aspiration points can generate nondominated solutions using a variety of scalarizing functions. These reference point solution methods commonly use a scalarizing function that reaches down from the ideal solution, in a direction specified by the aspiration point. Conversely, a similar scalarizing function can push out from the nadir point toward a specified aspiration point. These scalarizing functions are similar in structure but diametrically opposed in their reference points. In this paper we examine how these approaches behave from a technical point of view and conduct an experiment to understand better the human behaviour of users of these approaches. Insights we gain on the evenness of dispersion are relevant when attempting to construct a representation of the nondominated set. Further, the technical characteristics of the two formulations' solutions, combined with behavioural tendencies, allow us to comment on the implications for their use in interactive multipleobjective methods. (C) 2002 Elsevier Science B.V. All rights reserved.
In this paper we propose a new method to determine the exact nadir (minimum) criterion values over the efficient set in multipleobjective linear programming (MOLP). The basic idea of the method is to determine, for e...
详细信息
In this paper we propose a new method to determine the exact nadir (minimum) criterion values over the efficient set in multipleobjective linear programming (MOLP). The basic idea of the method is to determine, for each criterion, the region of the weight space associated wit It the efficient solutions that have a value in that criterion below the minimum already known (by default, the minimum in the payoff table). If this region is empty, the nadir value has been found. Otherwise, a new efficient solution is computed using a weight vector picked from the delimited region and a new iteration is performed. The method is able to find the nadir Values ill MOLP problems with ally number of objective functions, although the computational effort increases significantly with the number of objectives. Computational experiments are described and discussed, comparing two slightly different versions of the method. (C) 2008 Elsevier B.V. All rights reserved.
This paper describes an approach for markedly reducing the time required to obtain all efficient extreme points of a multipleobjective linear program (MOLP) with three objectives. The approach is particularly useful ...
详细信息
This paper describes an approach for markedly reducing the time required to obtain all efficient extreme points of a multipleobjective linear program (MOLP) with three objectives. The approach is particularly useful when working with such MOLPs possessing large numbers of efficient extreme points. By subdividing the criterion cone into sub-cones, the paper shows how the task of computing all efficient extreme points can be broken down into parts so that the parts can be solved concurrently, thus allowing all efficient extreme points to be computed in much reduced elapsed time. The paper investigates several schemes for conducting this task and reports on a volume of computational experience. (C) 2019 Published by Elsevier B.V.
An approach to generating all efficient solutions for multipleobjective programs with piecewise linear objective functions and linear constraints is presented. The approach is based on the decomposition of the feasib...
详细信息
In this paper we consider solution generation method for multipleobjective linear programming problems. The set of efficient or Pareto optimal solutions for the problems can be regarded as global information in multi...
详细信息
In this paper we consider solution generation method for multipleobjective linear programming problems. The set of efficient or Pareto optimal solutions for the problems can be regarded as global information in multipleobjective 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. (C) 2003 Elsevier B.V. All rights reserved.
A nonlinear multiple objective programming problem is considered where the functions involved are nondifferentiable. By considering the concept of weak minima, the Fritz John type and Karush-Kuhn-Tucker type necessary...
详细信息
A nonlinear multiple objective programming problem is considered where the functions involved are nondifferentiable. By considering the concept of weak minima, the Fritz John type and Karush-Kuhn-Tucker type necessary optimality conditions and Wolfe and Mond-Weir type duality results are given in terms of the right differentials of the functions. The duality results are stated by using the concepts of generalized semilocally convex functions.
Most of the known methods for finding the efficient set of a multipleobjective linear programming (MOLP) problem are bottom-up search methods. Main difficulties of the known bottom-up search methods are to find all e...
详细信息
Most of the known methods for finding the efficient set of a multipleobjective linear programming (MOLP) problem are bottom-up search methods. Main difficulties of the known bottom-up search methods are to find all efficient extreme points adjacent to and to enumerate all efficient faces incident to an efficient degenerate extreme point. Main drawbacks of these methods are that the computational cost is still large and an implementation of them is still difficult. In this paper we propose a new local bottom-up search method for finding all maximal efficient faces for an MOLP problem. Our method is based on the maximal descriptor index sets for efficient edges and extreme rays for the MOLP problem in which the maximal descriptor index sets for edges and extreme rays incident to an efficient degenerate extreme point are easily found on the basis of solving some special linear programming problems. In addition, all efficient extreme points adjacent to and all efficient faces incident to an efficient extreme point can be easily found without using the simplex tables corresponding to bases of this point. Our method can overcome difficulties caused by the degeneracy of faces and is easy to implement. Some comparisons of our method with the known bottom-up search methods are presented. A numerical example is given to illustrate the method.
暂无评论