Skip to main content
SpringerLink
Log in

Augmented Lagrangian and Tchebycheff Approaches in Multiple Objective Programming

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

Relationships between the Tchebycheff scalarization and the augmented Lagrange multiplier technique are examined in the framework of general multiple objective programs (MOPs). It is shown that under certain conditions the Tchebycheff method can be represented as a quadratic weighted-sums scalarization of the MOP, that is, given weight values in the former, the coefficients of the latter can be found so that the same efficient point is selected. Analysis for concave and linear MOPs is included. Resulting applications in multiple criteria decision making are also discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ballestro, E. and Romero, C. (1991), A theorem connecting utility function optimization and compromise programming, Operations Research Letters 10: 421-427.

    Google Scholar 

  2. Bazaraa, M.S., Jarvis, J.J. and Sherali, H.D. (1990), Linear Programming and Network Flows, Wiley, New York.

    Google Scholar 

  3. Bazaraa, M.S., Sherali, H.D. and Shetty C.M. (1993), Nonlinear Programming-Theory and Algorithms, Wiley, New York.

  4. Bowman, V.J. (1976), On the relationship of the Tchebycheff norm and the efficient frontier of multiple-criteria objectives, Lecture Notes in Economics and Mathematical Systems 130: 76-85.

    Google Scholar 

  5. Choo, E.-U. and Atkins, D.R. (1980), An interactive algorithm for multicriteria programming, Computers and Operations Research 7: 81-87.

    Google Scholar 

  6. Ecker, J.G. and Shoemaker, N.E. (1981), Selecting subsets from the set of nondominated vectors in multiple objective linear programming, SIAM Journal on Control and Optimization 19: 505-515.

    Google Scholar 

  7. Everett, H. (1963), Generalized Lagrange multiplier method for solving problems of optimum allocation of resources, Operations Research 11: 399-417.

    Google Scholar 

  8. Geoffrion, A.M. (1968), Proper efficiency and the theory of vector maximization, Journal of Mathematical Analysis and Applications 22: 618-630.

    Google Scholar 

  9. Gould, F.J. (1969), Extensions of Lagrange multipliers in nonlinear programming, SIAM Journal of Applied Mathematics 17: 1280-1297.

    Google Scholar 

  10. Kaliszewski, I. (1987), A modified weighted Tchebycheff metric for multiple objective programming, Computers and Operations Research 14: 315-323.

    Google Scholar 

  11. Minoux, M. (1986), Mathematical Programming: Theory and Algorithms, Wiley, Chichester.

    Google Scholar 

  12. Moron, M.A., Romero, C., and Ruiz del Portal, F. (1996), Generating well-behaved utility functions for compromise programming, Journal of Optimization Theory and Applications 91: 643-649.

    Google Scholar 

  13. Nakayama, H., Sayama, H. and Sawaragi, Y. (1975), A generalized Lagrangian function and multiplier method, Journal of Optimization Theory and Applications 17: 211-227.

    Google Scholar 

  14. Rockafellar, R.T. (1974), Augmented Lagrange multiplier functions and duality in nonconvex programming, SIAM Journal on Control 12: 268-285.

    Google Scholar 

  15. Roode, J.D. (1968), Generalized Lagrangian Functions in Mathematical Programming, Ph.D. Thesis, University of Leiden, The Netherlands.

  16. Singh, C., Bhatia, D. and Rueda, N. (1996), Duality in nonlinear multiobjective programming using augmented Lagrangian functions, Journal of Optimization Theory and Applications 88: 659-670.

    Google Scholar 

  17. Steuer R.E. (1986), Multiple Criteria Optimization: Theory, Computation and Application, Wiley, New York.

    Google Scholar 

  18. Steuer, R.E. and Choo, E.-U. (1983), An interactive weighted Tchebycheff procedure for multiple objective programming, Mathematical Programming 26: 326-344.

    Google Scholar 

  19. TenHuisen, M.L. and Wiecek, M.M. (1994), Vector optimization and generalized Lagrangian duality, Annals of Operations Research 51: 15-32.

    Google Scholar 

  20. TenHuisen, M.L. and Wiecek, M.M. (1997), Efficiency and solution approaches to bicriteria nonconvex programs, Journal of Global Optimization 11: 225-251.

    Google Scholar 

  21. TenHuisen, M.L. and Wiecek, M.M., (1997) An augmented Lagrangian scalarization for multiple objective programming, in: R. Caballero, F. Ruiz, R.E. Steuer (eds.), Advances in Multiple Objective and Goal Programming, pp. 151-159, Springer, Berlin.

    Google Scholar 

  22. Tind, J. and Wolsey, L.A. (1981), An elementary survey of general duality theory in mathematical programming, Mathematical Programming 21: 241-261.

    Google Scholar 

  23. Wierzbicki, A.P. (1980), The use of reference objectives in multiobjective optimization, Lecture Notes in Economics and Mathematical Systems 177: 468-486.

    Google Scholar 

  24. Yu, P.L. (1973), A class of solutions for group decision problems, Management Science 19: 262-301.

    Google Scholar 

  25. Zeleny, M.(1973), Compromise programming, in: J.L. Cochrane and M. Zeleny, (eds.), Multiple Criteria Decision Making, pp. 262-301, University of South Carolina Press, Columbia, S.C.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Operations Research, Institute for Mathematical Sciences, University of Copenhagen, Universitetsparken 5, DK-2100, Copenhagen O, Denmark

    Jørgen Tind

  2. Department of Mathematical Sciences, Clemson University, Martin Hall, Clemson, SC, 29634, USA

    Margaret M. Wiecek

Authors
  1. Jørgen Tind
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Margaret M. Wiecek
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tind, J., Wiecek, M.M. Augmented Lagrangian and Tchebycheff Approaches in Multiple Objective Programming. Journal of Global Optimization 14, 251–266 (1999). https://doi.org/10.1023/A:1008314306344

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008314306344

Search

Navigation