A hahn-banach theorem in ordered linear spaces and its applications
DOI10.1080/02331939208843803zbMath0834.46006OpenAlexW2010089725MaRDI QIDQ4327927
Publication date: 1 April 1996
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939208843803
vector optimization problemconvex relationsweak subgradientsubgradient formulaconvex relations in ordered linear spacesexistence of weak Lagrange multiplier theoremweak version of the Hahn-Banach theorem
Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52) Theorems of Hahn-Banach type; extension and lifting of functionals and operators (46A22) Ordered topological linear spaces, vector lattices (46A40)
Related Items (20)
Cites Work
- Theory of multiobjective optimization
- Strong duality for infinite-dimensional vector-valued programming problems
- Conjugate maps and duality in multiobjective optimization
- Duality theory for maximizations with respect to cones
- A vector variational inequality and optimization over an efficient set
- A Lagrange multiplier theorem and a sandwich theorem for convex relations.
- Multivalued convexity and optimization: A unified approach to inequality and equality constraints
- Recent results on separation of convex sets1
- Subdifferentiability of Convex Functions with Values in an Ordered Vector Space.
This page was built for publication: A hahn-banach theorem in ordered linear spaces and its applications