An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem
 Harold P. Benson
 … show all 1 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
Various difficulties have been encountered in using decision setbased vector maximization methods to solve a multiple objective linear programming problem (MOLP). Motivated by these difficulties, some researchers in recent years have suggested that outcome setbased approaches should instead be developed and used to solve problem (MOLP). In this article, we present a finite algorithm, called the Outer Approximation Algorithm, for generating the set of all efficient extreme points in the outcome set of problem (MOLP). To our knowledge, the Outer Approximation Algorithm is the first algorithm capable of generating this set. As a byproduct, the algorithm also generates the weakly efficient outcome set of problem (MOLP). Because it works in the outcome set rather than in the decision set of problem (MOLP), the Outer Approximation Algorithm has several advantages over decision setbased algorithms. It is also relatively easy to implement. Preliminary computational results for a set of randomlygenerated problems are reported. These results tangibly demonstrate the usefulness of using the outcome set approach of the Outer Approximation Algorithm instead of a decision setbased approach.
 Cohon, J. L. (1978), Multiobjective Programming and Planning, Academic Press, New York.
 Evans, G. W. (1984), An Overview of Techniques for Solving Multiobjective Mathematical Programs, Management Science 30, 1268–1282.
 Goicoechea, A., Hansen, D. R. and Duckstein, L. (1982), Multiobjective Decision Analysis with Engineering and Business Applications, John Wiley and Sons, New York.
 Luc, D. T. (1989), Theory of Vector Optimization, Springer Verlag, Berlin/New York.
 Sawaragi, Y., Nakayama, H. and Tanino, T. (1985), Theory of Multiobjective Optimization, Academic Press, Orlando, Florida.
 Steuer, R. E. (1986), Multiple Criteria Optimization: Theory, Computation, and Application, John Wiley and Sons, New York.
 Yu, P. L. (1985), Multiple Criteria Decision Making, Plenum, New York.
 Zeleny, M. (1982), Multiple Criteria Decision Making, McGrawHill, New York.
 Kuhn, H. W. and Tucker, A. W. (1950), Nonlinear Programming, in J. Neyman (ed.), Proceedings of the 2nd Berkeley Symposium on Mathematical Statistics and Probability, University of California Press, Berkeley, California, pp. 481–492.
 Geoffrion, A. M. (1968), Proper Efficiency and the Theory of Vector Maximization, Journal of Mathematical Analysis and Applications 22, 618–630. CrossRef
 Philip, J. (1972), Algorithms for the Vector Maximization Problem, Mathematical Programming 2, 207–229. CrossRef
 Evans, J. P. and Steuer, R. E. (1973), Generating Efficient Extreme Points in Linear Multiple Objective Programming: Two Algorithms and Computing Experience, in J. L. Cochrane and M. Zeleny (eds.), MultipleCriteria Decision Making, University of South Carolina Press, Columbia, South Carolina, pp. 349–365.
 Yu, P. L. and Zeleny, M. (1975), The Set of All Nondominated Solutions in Linear Cases and a Multicriteria Simplex Method, Journal of Mathematical Analysis and Applications 49, 430–468. CrossRef
 Benson, H. P. (1979), Vector Maximization with Two Objective Functions, Journal of Optimization Theory and Applications 28, 253–257. CrossRef
 Isermann, H. (1977), The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program, Operational Research Quarterly 28, 711–725.
 Bitran, G. R. (1979), Theory and Algorithms for Linear Multiple Objective Programs with ZeroOne Variables, Mathematical Programming 17, 362–390. CrossRef
 Villarreal, B. and Karwan, M. H. (1981), Multicriteria Integer Programming: A (Hybrid) Dynamic Programming Recursive Approach, Mathematical Programming 21, 204–223. CrossRef
 Kostreva, M. M. and Wiecek, M. M. (1993), Time Dependency in Multiple Objective Dynamic Programming, Journal of Mathematical Analysis and Applications 173, 289–307. CrossRef
 Marcotte, O. and Soland, R. M. (1986), An Interactive BranchandBound Algorithm for Multiple Criteria Optimization, Management Science 32, 61–75.
 Steuer, R. E. (1976), A FivePhase Procedure for Implementing a VectorMaximum Algorithm for Multiple Objective Linear Programming Problems, in H. Thiriez and S. Zionts (eds.), MultipleCriteria Decision Making: JouyenJosas, France, Springer Verlag, Berlin/New York.
 Benson, H. P. (1997), Generating the Efficient Outcome Set in Multiple Objective Linear Programs: The Bicriteria Case, Acta Mathematica Vietnamica 22, 29–51.
 Sayin, S. (1996), An Algorithm Based on Facial Decomposition for Finding the Efficient Set in Multiple Objective Linear Programming, Operations Research Letters 19, 87–94. CrossRef
 Armand, P. (1993), Finding All Maximal Efficient Faces in Multiobjective Linear Programming, Mathematical Programming 61, 357–375. CrossRef
 Armand, P. and Malivert, C. (1991), Determination of the Efficient Decision Set in Multiobjective Linear Programming, Journal of Optimization Theory and Applications 70, 467–489. CrossRef
 Benson, H. P. (1981), Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program, The Journal of the Operational Research Society 32, 495–498. CrossRef
 Benson, H. P. (1985), Multiple Objective Linear Programming with Parametric Criteria Coefficients, Management Science 31, 461–474.
 Benson, H. P. and Aksoy, Y. (1991), Using Efficient Feasible Directions in Interactive Multiple Objective Linear Programming, Operations Research Letters 10, 203–209. CrossRef
 Ecker, J. G. and Kouada, I. A. (1978), Finding All Efficient Extreme Points for Multiple Objective Linear Programs, Mathematical Programming 14, 249–261. CrossRef
 Ecker, J. G., Hegner, N. S. and Kouada, I. A. (1980), Generating All Maximal Efficient Faces for Multiple Objective Linear Programs, Journal of Optimization Theory and Applications 30, 353–381. CrossRef
 Gal, T. (1977), A General Method for Determining the Set of All Efficient Solutions to a Linear Vector Maximum Problem, European Journal of Operational Research 1, 307–322. CrossRef
 Zeleny, M. (1974), Linear Multiobjective Programming, Springer Verlag, Berlin/New York.
 Benson, H. P. and Sayin, S. (1997), Towards Finding Global Representations of the Efficient Set in Multiple Objective Mathematical Programming, Naval Research Logistics 44, 47–67. CrossRef
 Steuer, R. E. (1989), ADBASE Multiple Objective Linear Programming Package, University of Georgia, Athens, Georgia, 1989.
 Dauer, J. P. and Liu, Y. H. (1990), Solving Multiple Objective Linear Programs in Objective Space, European Journal of Operational Research 46, 350–357. CrossRef
 Dauer, J. P. and Saleh, O. A. (1990), Constructing the Set of Efficient Objective Values in Multiple Objective Linear Programs, European Journal of Operational Research 46, 358–365. CrossRef
 Morse, J. N. (1980), Reducing the Size of the Nondominated Set: Pruning by Clustering, Computers and Operations Research 7, 55–66. CrossRef
 Steuer, R. E. (1976), Multiple Objective Linear Programming with Interval Criterion Weights, Management Science 23, 305–316.
 Steuer, R. E. and Harris, F. W. (1980), IntraSet Point Generation and Filtering in Decision and Criterion Space, Computers and Operations Research 7, 41–53. CrossRef
 Benson, H. P. (1995), A Geometrical Analysis of the Efficient Outcome Set in MultipleObjective Convex Programs with Linear Criterion Functions, Journal of Global Optimization 6, 231–251. CrossRef
 Dauer, J. P. (1987), Analysis of the Objective Space in Multiple Objective Linear Programming, Journal of Mathematical Analysis and Applications 126, 579–593. CrossRef
 Dauer, J. P. (1993), On Degeneracy and Collapsing in the Construction of the Set of Objective Values in a Multiple Objective Linear Program, Annals of Operations Research 47, 279–292. CrossRef
 Gallagher, R. J. and Saleh, O. A. (1995), A Representation of an Efficiency Equivalent Polyhedron for the Objective Set of a Multiple Objective Linear Program, European Journal of Operational Research 80, 204–212. CrossRef
 Dauer, J. P. and Gallagher, R. J. (1996), A Combined ConstraintSpace, ObjectiveSpace Approach for Determining HighDimensional Maximal Efficient Faces of Multiple Objective Linear Programs, European Journal of Operational Research 88, 368–381. CrossRef
 Jahn, J., On the Determination of Minimal Facets and Edges of a Polyhedral Set, Journal of MultiCriteria Decision Analysis, to appear.
 Armann, R. (1989), Solving Multiobjective Programming Problems by Discrete Representation, Optimization 20, 483–492.
 Horst, R. and Tuy, H. (1993), Global Optimization: Deterministic Approaches, 2nd edition, Springer Verlag, Berlin/New York.
 Horst, R. and Pardalos, P., eds. (1995), Handbook of Global Optimization, Kluwer Academic Publishers, Dordrecht/Boston/London.
 Benson, H. P. (1996), Deterministic Algorithms for Constrained Concave Minimization: A Unified Critical Survey, Naval Research Logistics 43, 765–795. CrossRef
 Rockafellar, R. T. (1970), Convex Analysis, Princeton University Press, Princeton, New Jersey.
 Benson, H. P. and Lee, D. (1996), OutcomeBased Algorithm for Optimizing over the Efficient Set of a Bicriteria Linear Programming Problem, Journal of Optimization Theory and Applications 88, 77–105. CrossRef
 Falk, J. E. and Hoffman, K. L. (1976), A Successive Underestimating Method for Concave Minimization Problems, Mathematics of Operations Research 1, 251–259. CrossRef
 Tuy, H. (1983), On Outer Approximation Methods for Solving Concave Minimization Problems, Acta Mathematica Vietnamica 8, 3–34.
 Thieu, T. V., Tam, B. T. and Ban, T. V. (1983), An Outer Approximation Method for Globally Minimizing a Concave Function over a Compact Convex Set, Acta Mathematica Vietnamica 8, 21–40.
 Horst, R., Thoai, N. V. and Devries, J. (1988), On Finding the New Vertices and Redundant Constraints in Cutting Plane Algorithms for Global Optimization, Operations Research Letters 7, 85–90. CrossRef
 Thieu, N. V. (1988), A Finite Method for Globally Minimizing a Concave Function over an Unbounded Polyhedral Convex Set and Its Applications, Acta Mathematica Hungarica 52, 21–36. CrossRef
 Chen, P. C., Hansen, P. and Jaumard, B. (1991), OnLine and OffLine Vertex Enumeration by Adjacency Lists, Operations Research Letters 10, 403–409. CrossRef
 Horst, R. (1991), On the Vertex Enumeration Problem in Cutting Plane Algorithms of Global Optimization, in G. Fandel and H. Gehring (eds.), Operations Research, Springer Verlag, Berlin/New York, pp. 13–22.
 Horst, R. and Thoai, N. V. (1989), Modification, Implementation and Comparison of Three Algorithms for Globally Solving Linearly Constrained Concave Minimization Problems, Computing 42, 271–289. CrossRef
 Stadler, W., ed. (1988), Multicriteria Optimization in Engineering and the Sciences, Plenum Press, New York.
 Benson, H. P. (1982), Admissible Points of a Convex Polyhedron, Journal of Optimization Theory and Applications 38, 341–361. CrossRef
 International Mathematical and Statistical Libraries, Inc. (1991), The IMSL Library Reference Manual, IMSL, Houston, Texas.
 Title
 An Outer Approximation Algorithm for Generating All Efficient Extreme Points in the Outcome Set of a Multiple Objective Linear Programming Problem
 Journal

Journal of Global Optimization
Volume 13, Issue 1 , pp 124
 Cover Date
 19980101
 DOI
 10.1023/A:1008215702611
 Print ISSN
 09255001
 Online ISSN
 15732916
 Publisher
 Kluwer Academic Publishers
 Additional Links
 Topics
 Keywords

 Efficient set
 Global optimization
 Multiple objective linear programming
 Outer approximation
 Vector maximization
 Industry Sectors
 Authors

 Harold P. Benson ^{(1)}
 Author Affiliations

 1. College of Business Administration, Department of Decision and Imformation Sciences, University of Florida, P.O. Box 117169, Gainesville, FL, 32611–7169, USA Email