Skip to main content
Log in

Super efficiency in convex vector optimization

  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

Abstract

We establish a Lagrange Multiplier Theorem for super efficiency in convex vector optimization and express super efficient solutions as saddle points of appropriate Lagrangian functions. An example is given to show that the boundedness of the base of the ordering cone is essential for the existence of super efficient points.

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. Benson HP (1979) An improved definition of proper efficiency for vector maximization with respect to cones. J Math Anal Appl 71:232–241

    Google Scholar 

  2. Borwein JM (1977) Proper efficient points for maximizations with respect to cones. SIAM J Control Optim 15:57–63

    Google Scholar 

  3. Borwein JM (1980) The geometry of Pareto optimality. Math Operationsforsch Statist 11:235–248

    Google Scholar 

  4. Borwein JM (1987) Convex cones, minimality notions and consequences. In: Jahn J, Krabs W (eds) Recent Advances and Historical Development of Vector Optimization. Springer, New York, pp 64–73

    Google Scholar 

  5. Borwein JM, Zhuang D (to appear) Super efficiency in vector optimization

  6. Dauer JP, Stadler W (1986) A survey of vector optimization in infinite dimensional spaces, part II. JOTA 51

  7. Dauer JP, Saleh OA (to appear) A characterization of proper minimal points as solutions of sublinear optimization problems

  8. Dauer JP, Gallagher RJ (to appear) Positive proper efficient points and related cone results in vector optimization theory

  9. Holmes RB (1975) Geometric functional analysis and its applications. Springer, New York

    Google Scholar 

  10. Hurwicz L (1958) Programming in Linear Spaces. In: Arrow, Hurwicz, Uzawa (eds) Studies in Linear and Nonlinear Programming. Standford Univ Press, Standford, California, pp 38 -102

    Google Scholar 

  11. Jameson G (1970) Ordered linear spaces. Springer, Lecture Notes in Mathmatics No 141, Berlin

    Google Scholar 

  12. Jahn J (1986) Mathematical vector optimization in partially ordered inear spaces. Peter Lang, Frankfurt am Main

    Google Scholar 

  13. Jahn J (1984) Scalarization in vector optimization. Math Prog 29:203–218

    Google Scholar 

  14. Kuhn HW, Tucker AW (1951) Nonlinear programming. In: Neyman J (ed) Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability. University of California Press, Berkeley, pp 481–492

    Google Scholar 

  15. Luenberger DG (1969) Optimization by vector space methods. Wiley, New York

    Google Scholar 

  16. Peressini AL (1967) Ordered topological vector spaces. Harper & Row, New York

    Google Scholar 

  17. Zhuang D (to appear) Density results of proper efficiencies

Download references

Author information

Authors and Affiliations

Authors

Additional information

Research is supported partially by NSERC.

Research is supported partially by NSERC and Mount St. Vincent University grant.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Borwein, J.M., Zhuang, D.M. Super efficiency in convex vector optimization. ZOR - Methods and Models of Operations Research 35, 175–184 (1991). https://doi.org/10.1007/BF01415905

Download citation

  • Issue Date:

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

Key words

Navigation