Abstract
We generalize many of the results on efficient points for linear multiple objective optimization problems to the nonlinear case by focusing on an auxiliary problem. The approach, which relies on duality theory, is a straightforward development that even in the linear case yields simpler proofs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H.P. Benson and T.L. Morin, “The vector maximization problem: proper efficiency and stability”,SIAM Journal on Applied Mathematics, to appear.
A. Charnes and W.W. Cooper,Management models and industrial applications of linear programming, vol. 1 (Wiley, New York, 1961).
J.G. Ecker and I.A. Kouada, “Finding efficient points for linear multiple objective programs”,Mathematical Programming 3 (1975) 375–377.
J.P. Evans and R.E. Steuer, “A revised simplex method for linear multiple objective programs”,Mathematical Programming 4 (1972) 54–72.
A.M. Geoffrion, “Proper efficiency and the theory of vector maximization”,Journal of Mathematical Analysis and Applications 22 (3) (1968) 618–630.
A.M. Geoffrion, “Duality in nonlinear programming”,SIAM Review 13 (1971) 1–37.
H. Isermann, “Proper efficiency and the linear vector maximum problem”,Operations Research 22 (1) (1974) 189–191.
T. Koopmans, “Analysis of production as an efficient combination of activities”, in:activity analysis of production and allocation, Cowles Commission Monograph vol. 13 (Wiley, New York, 1951) pp. 33–97.
E.L. Peterson and J.G. Ecker, “A unified duality theory for quadratically constrained quadratic programs andl p -constrainedl p -approximation problems”,Bulletin of the American Mathematical Society 74 (1968) 316–321.
E.L. Peterson and J.G. Ecker, “Geometric programming: duality in quadratic programming andl p -approximation I”, in: H.W. Kuhn and A.W. Tucker, eds.,Proceedings of international symposium on mathematical programming (Princeton, NJ 1967).
E.L. Peterson and J.G. Ecker, “Geometric programming: duality in quadratic programming andl p -approximation II (canonical programs)”,SIAM Journal on Applied Mathematics 17 (1969) 317–340.
E.L. Peterson and J.G. Ecker, “Geometric programming: duality in quadratic programming andl p -approximation III (degenerate programs)”,Journal of Mathematical Analysis and Applications 29 (1970) 365–383.
J. Philip, “Algorithms for the vector maximization problem”,Mathematical Programming 2 (1972) 207–229.
R.T. Rockafellar, “Lagrange multipliers in optimization”, in: R.W. Cottle, ed.,Proceedings of symposia in applied mathematics IX, (Am. Math. Soc., Providence, RI, to appear).
R.T. Rockafellar, “Ordinary convex programs without a duality gap”,Journal of Optimization Theory and Applications 7 (3) (1971) 143–148.
R.T. Rockafellar, “Some convex programs whose duals are linearly constrained”, in:Nonlinear programming (Academic Press, New York, 1970) pp. 293–322.
R.E. Wendell, A.P. Hurter, Jr. and T.J. Lowe, “Efficient points in location problems”,Journal of Mathematical Analysis and Applications 49 (2) (1975) 430–468.
P.L. Yu and M. Zeleny, “The set of all nondominated solutions in linear cases and a multicriteria simplex method”,AIIE Transactions, to appear.
P.L. Yu and M. Zeleny, “On some linear multi-parametric programs”, Rept. No. CSS 73-05, Center for System Science, University of Rochester, Rochester, NY (1973).
Author information
Authors and Affiliations
Additional information
This research was partially supported by the National Science Foundation through Grant No. ENG 74-15488.
Rights and permissions
About this article
Cite this article
Wendell, R.E., Lee, D.N. Efficiency in multiple objective optimization problems. Mathematical Programming 12, 406–414 (1977). https://doi.org/10.1007/BF01593807
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01593807