Abstract
The multiple objective program (MOP) is related to its ε-constraint single-objective counterpart for which an augmented Lagrangian is developed. The resulting scalarization generates qk-approachable points that are identified as locally efficient and/or efficient points of the MOP. An illustrative example is enclosed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bernau, H.: Use of exact penalty functions to determine efficient decisions, European Journal of Operational Research, 49 (1990) 348–355
Haimes Y.Y, V. Chankong, Multiobjective Decision Making - Theory and Methodology. North Holland, New York 1983
Isac, G., M.M. Kostreva and M.M. Wiecek: Multiple objective approximation of feasible but unsolvable linear complementarity problems, Journal of Optimization Theory and Applications 86 (1995) 389–405
Jahn, J., J. Klose and A. Merkel: On the application of a method of reference point approximation to bicriterial optimization problems in chemical engineering. In: W. Oettli, D. Pallaschke (eds): Advances in Optimization. Springer-Verlag, Berlin, 1992, pp. 478–491
Kopsidas, G.C.: Multiobjective optimization of table olive preparation systems. European Journal of Operations Research 85 (1995) 383–398
Kostreva, M.M., T. Ordoyne and M.M. Wiecek: Mulitple-objective programming with polynomial objectives and constraints. European Journal of Operational Research 57 (1992) 381–394
Kostreva, M.M., M.M. Wiecek: Linear complementarity problems and multiple objective programming. Mathematical Programming 60 (1993) 349–359
Minoux, M.: Mathematical Programming - Theory and Algorithms. John Wiley, Chichester 1986
Osyczka, A.: Multicriterion Optimization in Engineering with Fortran Programs. Ellis Horwood, Chichester 1984
Rockafellar, R.T.: Augmented Lagrange multiplier functions and duality in nonconvex programming. SIAM Journal on Control 12 (1974) 269–285
TenHuisen, M.L.: Generalized Lagrangian Duality in Multiple Objective Programming, Ph.D. thesis, Department of Mathematical Sciences, Clemson University, Clemson, SC 1993
TenHuisen, M.L., M. M. Wiecek: Vector optimization and generalized Lagrangian duality. Annals of Operations Research 51 (1994) 15–32
TenHuisen, M.L., M. M. Wiecek: Efficiency and solution approaches to bicriteria nonconvex programs. Journal of Global Optimization (1997) in print
Tind, J., L.A. Wolsey: An elementary survey of general duality theory in mathematical programming. Mathematical Programming 21 (1981) 241–261
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
TenHuisen, M.L., Wiecek, M.M. (1997). An Augmented Lagrangian Scalarization for Multiple Objective Programming. In: Caballero, R., Ruiz, F., Steuer, R. (eds) Advances in Multiple Objective and Goal Programming. Lecture Notes in Economics and Mathematical Systems, vol 455. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46854-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-46854-4_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63599-4
Online ISBN: 978-3-642-46854-4
eBook Packages: Springer Book Archive