Abstract
This article performs a geometrical analysis of the efficient outcome setY E of a multiple objective convex program (MLC) with linear criterion functions. The analysis elucidates the facial structure ofY E and of its pre-image, the efficient decision setX E . The results show thatY E often has a significantly-simpler structure thanX E . For instance, although both sets are generally nonconvex and their maximal efficient faces are always in one-to-one correspondence, large numbers of extreme points and faces inX E can map into non-facial subsets of faces inY E , but not vice versa. Simple tests for the efficiency of faces in the decision and outcome sets are derived, and certain types of faces in the decision set are studied that are immune to a common phenomenon called “collapsing”. The results seem to indicate that significant computational benefits may potentially be derived if algorithms for problem (MLC) were to work directly with the outcome set of the problem to find points and faces ofY E , rather than with the decision set.
Similar content being viewed by others
References
Armand, P. and Malivert, C. (1991), Determination of the Efficient Set in Multiobjective Linear Programming,Journal of Optimization Theory and Applications 70, 467–489.
Arrow, K. J., Barankin, E. W., and Blackwell, D. (1953), Admissible Points of Convex Sets, In:Contributions to the Theory of Games, H. W. Kuhn and A. W. Tucker, Eds., Princeton University Press, Princeton, N.J., 87–91.
Benson, H. P. (1991), Complete Efficiency and the Initialization of Algorithms for Multiple Objective Programming,Operations Research Letters 10, 481–487.
Benson, H. P. (1983), Efficiency and Proper Efficiency in Vector Maximization with Respect to Cones,Journal of Mathematical Analysis and Applications 93, 273–289.
Benson, H. P. (1978), Existence of Efficient Solutions for Vector Maximization Problems,Journal of Optimization Theory and Applications 26, 569–580.
Benson, H. P. (1983), On a Domination Property for Vector Maximization with Respect to Cones,Journal of Optimization Theory and Applications 39, 125–132, (1984);Errata Corrige 43, 477–479.
Benveniste, M. (1977), Testing for Complete Efficiency in a Vector Maximization Problem,Mathematical Programming 12, 285–288.
Bitran, G. R. and Magnanti, T. L. (1979), The Structure of Admissible Points with Respect to Cone Dominance,Journal of Optimization Theory and Applications 29, 573–614.
Borwein, J. M. (1983), On the Existence of Pareto Efficient Points,Mathematics of Operations Research 8, 64–73.
Cohon, J. L. (1978),Multiobjective Programming and Planning, Academic Press, New York.
Corley, H. W. (1980), An Existence Result for Maximizations with Respect to Cones,Joumal of Optimization Theory and Applications 31, 277–281.
Dauer, J. P. (1987), Analysis of the Objective Space in Multiple Objective Linear Programming,Journal of Mathematical Analysis and Applications 126, 579–593.
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.
Dauer, J. P. and Gallagher, R. J. (1995), A Combined Constraint-space, Objective-space Approach for Determining High-Dimensional Maximal Efficient Faces of Multiple Objective Linear Programs,European Journal of Operational Research (To Appear).
Dauer, J. P. and Liu, Y.-H. (1990), Solving Multiple Objective Linear Programs in Objective Space,European Journal of Operational Research 46, 350–357.
Dauer, J. P. and Saleh, O. A. (1992), A Representation of the Set of Feasible Objectives in Multiple Objective Linear Programs,Linear Algebra and Its Applications 166, 261–275.
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.
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.
Ecker, J. G. and Kouada, I. A. (1975), Finding Efficient Points for Linear Multiple Objective Programs,Mathematical Programming 8, 375–377.
El-Abyad, A. M. (1986), Geometric Analysis of the Objective Space in Linear Multiple Objective Programming, Ph.D. Dissertation, University of Nebraska-Lincoln, Lincoln, Nebraska.
Evans, G. W. (1984), An Overview of Techniques for Solving Multiobjective Mathematical Programs,Management Science 30, 1268–1282.
Gallagher, R. J. and Saleh, O. A. (1994), A Representation of anEfficiency Equivalent Polyhedron for the Objective Set of a Multiple Objective Linear Program,European Journal of Operational Research (To Appear).
Geoffrion, A. M. (1968), Proper Efficiency and the Theory of Vector Maximization,Journal of Mathematical Analysis and Applications 22, 618–630.
Goicoechea, A., Hansen, D. R. and Duckstein, L. (1982),Multiobjective Decision Analysis with Engineering and Business Applications, Wiley, New York.
Henig, M. I. (1982), Existence and Characterization of Efficient Decisions with Respect to Cones,Mathematical Programming 23, 111–116.
Henig, M. I., (1986), The Domination Property in Multicriteria Optimization,Journal of Mathematical Analysis and Applications 114, 7–16.
Jahn, J. (1988), A Generalization of a Theorem of Arrow, Barankin, and Blackwell,SIAM Journal on Control and Optimization 26, 999–1005.
Jahn, J. (1986), Existence Theorems in Vector Optimization,Journal of Optimization Theory and Applications 50, 397–406.
Kuhn, H. W. and Tucker, A. W. (1950), Nonlinear Programming, In:Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, J. Neyman, Ed., University of California Press, Berkeley, 481–492.
Luc, D. T. (1987), Connectedness of the Efficient Point Sets in Quasiconcave Maximization,Journal of Mathematical Analysis and Applications 122, 346–354.
Luc, D. T. (1984), On the Domination Property in Vector Optimization,Journal of Optimization Theory and Applications 43, 327–330.
Luc, D. T. (1989),Theory of Vector Optimization, Springer-Verlag, Berlin.
Naccache, P. H. (1978), Connectedness of the Set of Nondominated Outcomes in Multicriteria Optimization,Journal of Optimization Theory and Applications 25, 459–467.
Naccache, P. H. (1979), Stability in Multicriteria Optimization,Journal of Mathematical Analysis and Applications 68, 441–453.
Philip, J. (1976), An Algorithm for Combined Quadratic and Multiobjective Programming, In:Multiple Criteria Decision Making, Proceedings of a Conference, Jouy-en-Josas, France, May, 1975, H. Thiriez and S. Zionts, Eds., Springer-Verlag, Berlin, 35–52.
Ringuest, J. L. (1992),Multiobjective Optimization: Behavioral and Computational Considerations, Kluwer Academic Publishers, Boston.
Rockafellar, R. T. (1970),Convex Analysis, Princeton University Press, Princeton, N.J.
Rosenthal, R. E. (1985), Principles of Multiobjective Optimization,Decision Sciences 16, 133–152.
Sawaragi, Y., Nakayama, H. and Tanino, T. (1985),Theory of Multiobjective Optimization, Academic Press, Orlando, Florida.
Stadler, W. (1979), A Survey of Multicriteria Optimization or the Vector Maximum Problem: 1776–1960,Journal of Optimization Theory and Applications 29, 1–52.
Sterna-Karwat, A. (1987), Lipshitz and Differentiable Dependence of Solutions on a Parameter in a Scalarization Method,Journal of the Australian Mathematical Society 42, 354–364.
Steuer, R. E. (1986),Multiple Criteria Optimization: Theory, Computation, and Application, Wiley, New York.
Tanino, T. and Sawaragi, Y. (1980), Stability of Nondominated Solutions in Multicriteria Decision-Making,Journal of Optimization Theory and Applications 30, 229–253.
Truong, X. D. H. (1994), On the Existence of Efficient Points in Locally Convex Spaces,Journal of Global Optimization 4, 265–278.
Warburton, A. R. (1983), Quasiconcave Vector Maximization: Connectedness of the Sets of Pareto-Optimal and Weak Pareto-Optimal Alternatives,Journal of Optimization Theory and Applications 40, 537–557.
Xunhua, Gong (1995), Density of the Set of Positive Proper Minimal Points in the Set of Minimal Points,Journal of Optimization Theory and Applications (To Appear).
Yu, P. L. (1974), Cone Convexity, Cone Extreme Points, and Nondominated Solutions in Decision Problems with Multiobjectives,Journal of Optimization Theory and Applications 14, 319–377.
Yu, P. L. (1985),Multiple Criteria Decision Making, Plenum, New York.
Yu, P. L. (1989), Multiple Criteria Decision Making: Five Basic Concepts, In:Optimization, G. L. Nemhauser, A. H. G. Rinnooy Kan and M. J. Todd, Eds., North-Holland, Amsterdam, 663–699.
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.
Zeleny, M. (1982),Multiple Criteria Decision Making, McGraw Hill, New York.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Benson, H.P. A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functions. J Glob Optim 6, 231–251 (1995). https://doi.org/10.1007/BF01099463
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01099463