Skip to main content
Log in

Lagrange multiplier theorem of multiobjective programming problems with set functions

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

In this paper, Lagrange multiplier theorems are developed for the cases of single-objective and multiobjective programming problems with set functions. Properly efficient solutions are also characterized by subdifferentials and zero-like functions.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Chou, J. H., Hsia, W. S., andLee, T. Y.,On Multiobjective Programming Problems with Set Functions, Journal of Mathematical Analysis and Applications, Vol. 105, pp. 383–394, 1985.

    Google Scholar 

  2. Chou, J. H., Hsia, W. S., andLee, T. Y.,Epigraphs of Convex Set Functions, Journal of Mathematical Analysis and Applications, Vol. 118, pp. 247–254, 1986.

    Google Scholar 

  3. Hsia, W. S., andLee, T. Y.,Lagrangian Functions and Duality Theory in Multiobjective Programming with Set Functions, Journal of Optimization Theory and Applications, Vol. 57, pp. 239–241, 1988.

    Google Scholar 

  4. Hsia, W. S., andLee, T. Y.,Proper D-Solutions of Multiobjective Programming with Set Functions, Journal of Optimization Theory and Applications, Vol. 53, pp. 247–258, 1987.

    Google Scholar 

  5. Tanino, T., andSawaragi, Y.,Duality Theory in Multiobjective Programming, Journal of Optimization Theory and Applications, Vol. 27, pp. 509–529, 1979.

    Google Scholar 

  6. Yu, P. L.,Cone Convexity, Cone Extreme Points, and Nondominated Solutions in Decision Problems with Multiobjectives, Journal of Optimization Theory and Applications, Vol. 14, pp. 319–337, 1974.

    Google Scholar 

  7. Sawaragi, Y., Nakayama, H., andTanino, T.,Theory of Multiobjective Optimization, Academic Press, New York, New York, 1985.

    Google Scholar 

  8. Borwein, J. M.,Proper Efficient Points for Maximizations with Respect to Cones, SIAM Journal on Control and Optimization, Vol. 15, pp. 57–63, 1977.

    Google Scholar 

  9. Benson, H. P.,Efficiency and Proper Efficiency in the Vector Optimization with Respect to Cones, Journal of Mathematical Analysis and Applications, Vol. 93, pp. 273–289, 1983.

    Google Scholar 

  10. Henig, M. I.,Proper Efficiency with Respect to Cones, Journal of Optimization Theory and Applications, Vol. 36, pp. 387–407, 1982.

    Google Scholar 

  11. Morris, R. J. T.,Optimal Constrained Selection of a Measurable Subset, Journal of Mathematical Analysis and Applications, Vol. 70, pp. 546–562, 1979.

    Google Scholar 

  12. Rockafellar, R. T.,Convex Analysis, Princeton University Press, Princeton, New Jersey, 1970.

    Google Scholar 

  13. Yoshida, K., andHewitt, E.,Finitely Additive Measures, Transactions of the American Mathematical Society, Vol. 72, pp. 46–66, 1952.

    Google Scholar 

  14. Chou, J. H., Hsia, W. S., andLee, T. Y.,Convex Programming with Set Functions, Rocky Mountain Journal of Mathematics, Vol. 17, pp. 535–543, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by B. R. Agins

The authors greatly appreciate helpful and valuable comments and suggestions received from the referee.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hsia, W.S., Lee, T.Y. & Lee, J.Y. Lagrange multiplier theorem of multiobjective programming problems with set functions. J Optim Theory Appl 70, 137–155 (1991). https://doi.org/10.1007/BF00940508

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00940508

Key Words

Navigation