207Accesses
Abstract
In this paper relationships between Pareto points and saddle points are studied in convex and nonconvex multiple objective programming. The analysis is based on partitioning the index sets of objectives and constraints and splitting the original problem into subproblems having a special structure. The results are based on scalarizations of multiple objective programs and related linear and augmented Lagrangian functions. In the nonconvex case, a saddle point characterization of Pareto points is possible under assumptions that guarantee existence of Pareto points and stability conditions of single objective problems. Essentially, these conditions are not stronger than those in analogous results for single objective programming.
This is a preview of subscription content,log in via an institution to check access.
Access this article
Subscribe and save
- Get 10 units per month
- Download Article/Chapter or eBook
- 1 Unit = 1 Article or 1 Chapter
- Cancel anytime
Buy Now
Price includes VAT (Japan)
Instant access to the full article PDF.
Similar content being viewed by others
References
K.J. Arrow P.J. Gould S.M. Howe (1973)ArticleTitleA general saddle point result for constrained optimizationMathematical Programming5 225–234
M.S. Bazaraa H.D. Sherali C.M. Shetty (1993) Nonlinear Programming: Theory and Algorithms John Wiley New York
W.W. Breckner M. Sekatzek C. Tammer (2001) Approximate saddle point assertions for a general class of approximation problems M. Lassonde (Eds) Approximation, Optimization and Mathematical Economics Physica Heidelberg 71–80
Buys J.D. Dual Algorithms for Constrained Optimization. Ph.D. thesis, University of Leiden
A. Charnes W. Cooper (1961) Management Models and Industrial Applications of Linear Programming John Wiley and Sons New York
J. Dutta V. Vetrivel (2001)ArticleTitleOn approximate minima in vector optimizationNumerical Functional Analysis and Optimization22IssueID7–8 845–859
Ehrgott M. (1997). Multiple Criteria Optimization – Classification and Methodology. Shaker Verlag, Aachen. Ph.D. Dissertation, University of Kaiserslautern
M. Ehrgott H.W. Hamacher K. Klamroth S. Nickel A. Schöbel M.M. Wiecek (1997)ArticleTitleA note on the equivalence of balance points and Pareto solutions in multiple-objective programmingJournal of Optimization Theory and Applications92IssueID1 209–212
A.M. Geoffrion (1968)ArticleTitleProper efficiency and the theory of vector maximizationJournal of Mathematical Analysis and Applications22 618–630
X.X. Huang X.Q. Yang (2001)ArticleTitleDuality and exact penalization for vector optimization via augmented lagrangianJournal of Optimization Theory and Applications111IssueID3 615–640
P. Iacob (1986)ArticleTitleSaddle point duality theorems for Pareto optimizationL’Analyse Numerique et la Theorie de l’ Approximation15IssueID1 37–40
L. Neralić S. Zlobec (1996)ArticleTitleLFS functions in multi-objective programmingApplications of Mathematics41IssueID4 347–366
R.T. Rockafellar (1974)ArticleTitleAugmented Lagrange multiplier functions and duality in nonconvex programmingSIAM Journal on Control12IssueID2 268–285
T.J. Rockafellar (1971) New applications of duality in convex programming In Proceedings of the 4th Conference on Probability Brasov, Romania
W.D. Rong Y.N. Wu (2000)ArticleTitleε-weak minimal solutions of vector optimization problems with set-valued mapsJournal of Optimization Theory and Applications106IssueID3 569–579
Y. Sawaragi H. Nakayama T. Tanino (1985) Theory of Multiobjective Optimization Academic Press Orlando
C. Singh D. Bhatia N. Rueda (1996)ArticleTitleDuality in nonlinear multiobjective programming using augmented Lagrangian functionsJournal of Optimization Theory and Applications88IssueID3 659–670
M.L. TenHuisen M.M. Wiecek (1994)ArticleTitleVector optimization and generalized Lagrangian dualityAnnals of Operations Research51 15–32
M.L. TenHuisen M.M. Wiecek (1997)ArticleTitleEfficiency and solution approaches to bicriteria nonconvex programsJournal of Global Optimization11IssueID3 225–251
M.L. TenHuisen M.M. Wiecek (1998) An augmented Lagrangian scalarization for multiple objective programming R. Caballero F. Ruiz R.E. Steuer (Eds) Advances in Multiple Objective and Goal Programming: Proceedings of the MOPGP’96 Conference, Malaga, Spain, volume 455 of Lecture Notes in Economics and Mathematical Systems Springer Verlag Berlin 151–159
I. Valyi (1987)ArticleTitleApproximate saddle-point theorems in vector optimizationJournal of Optimization Theory and Applications55IssueID3 435–448
M. RooyenParticlevan X. Zhou S. Zlobec (1994)ArticleTitleA saddle-point characterization of Pareto optimaMathematical Programming67IssueID1 77–88
M.M. Wiecek W. Chen J. Zhang (2001)ArticleTitlePiecewise quadratic approximation of the non-dominated set for bi-criteria programsJournal of Multi-Criteria Decision Analysis10 35–47
S. Zlobec (1984)ArticleTitleTwo characterizations of Pareto minima in convex multicriteria optimizationAplikace Matematiky29IssueID5 342–349
Author information
Authors and Affiliations
Department of Engineering Science, University of Auckland, Auckland, New Zealand
Matthias Ehrgott
Department of Mathematical Sciences, Clemson University, Clemson, SC, 29634, USA
Margaret M. Wiecek
- Matthias Ehrgott
You can also search for this author inPubMed Google Scholar
- Margaret M. Wiecek
You can also search for this author inPubMed Google Scholar
Corresponding author
Correspondence toMatthias Ehrgott.
Additional information
This research was partially supported by ONR Grant N00014-97-1-784
AMS Subject Classification: 90C29, 90C26
Rights and permissions
About this article
Cite this article
Ehrgott, M., Wiecek, M.M. Saddle Points and Pareto Points in Multiple Objective Programming.J Glob Optim32, 11–33 (2005). https://doi.org/10.1007/s10898-004-5902-6
Received:
Accepted:
Issue Date:
Share this article
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative