Zeitschrift für Operations Research

, Volume 35, Issue 3, pp 175–184 | Cite as

Super efficiency in convex vector optimization

  • J. M. Borwein
  • D. M. Zhuang

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.

Key words

Super efficiency convex vector optimization Lagrange Multiplier Theorem scalarization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Benson 1]
    Benson HP (1979) An improved definition of proper efficiency for vector maximization with respect to cones. J Math Anal Appl 71:232–241Google Scholar
  2. [Borwein 1]
    Borwein JM (1977) Proper efficient points for maximizations with respect to cones. SIAM J Control Optim 15:57–63Google Scholar
  3. [Borwein 2]
    Borwein JM (1980) The geometry of Pareto optimality. Math Operationsforsch Statist 11:235–248Google Scholar
  4. [Borwein 3]
    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–73Google Scholar
  5. (B-Z 1]
    Borwein JM, Zhuang D (to appear) Super efficiency in vector optimizationGoogle Scholar
  6. [D-St 1]
    Dauer JP, Stadler W (1986) A survey of vector optimization in infinite dimensional spaces, part II. JOTA 51Google Scholar
  7. [D-Sa 1]
    Dauer JP, Saleh OA (to appear) A characterization of proper minimal points as solutions of sublinear optimization problemsGoogle Scholar
  8. [D-G 1]
    Dauer JP, Gallagher RJ (to appear) Positive proper efficient points and related cone results in vector optimization theoryGoogle Scholar
  9. [Holmes 1]
    Holmes RB (1975) Geometric functional analysis and its applications. Springer, New YorkGoogle Scholar
  10. [Hurwicz 1]
    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 -102Google Scholar
  11. [Jameson 1]
    Jameson G (1970) Ordered linear spaces. Springer, Lecture Notes in Mathmatics No 141, BerlinGoogle Scholar
  12. [Jahn 1]
    Jahn J (1986) Mathematical vector optimization in partially ordered inear spaces. Peter Lang, Frankfurt am MainGoogle Scholar
  13. [Jahn 2]
    Jahn J (1984) Scalarization in vector optimization. Math Prog 29:203–218Google Scholar
  14. [K-T 1]
    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–492Google Scholar
  15. [Luenberger 1]
    Luenberger DG (1969) Optimization by vector space methods. Wiley, New YorkGoogle Scholar
  16. [Peressini 1]
    Peressini AL (1967) Ordered topological vector spaces. Harper & Row, New YorkGoogle Scholar
  17. [Zhuang 1]
    Zhuang D (to appear) Density results of proper efficienciesGoogle Scholar

Copyright information

© Physica-Verlag 1991

Authors and Affiliations

  • J. M. Borwein
    • 1
  • D. M. Zhuang
    • 2
  1. 1.Department of Mathematics, Statistics and Computing ScienceDalhousie UniversityHalifaxCanada
  2. 2.Department of Mathematics and Computer StudiesMount St. Vincent UniversityHalifaxCanada

Personalised recommendations