Proper efficiency in vector optimization on real linear spaces.
From MaRDI portal
Publication:703161
DOI10.1023/B:JOTA.0000037602.13941.edzbMath1076.90051OpenAlexW4229824626MaRDI QIDQ703161
Vicente Novo Sanjurjo, Miguel Adán
Publication date: 11 January 2005
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:jota.0000037602.13941.ed
Related Items
Levitin-Polyak well-posedness for vector optimization problems in linear spaces, Robust Ekeland variational principles. Application to the formation and stability of partnerships, Duality and saddle-points for convex-like vector optimization problems on real linear spaces, Vector optimization w.r.t. relatively solid convex cones in real linear spaces, About Hahn-Banach extension theorems and applications to set-valued optimization, A general vectorial Ekeland's variational principle with a P-distance, Algebraic interior and separation on linear vector spaces: some comments, Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces, Ekeland variational principles for set-valued functions with set perturbations, Pareto efficiency without topology, Nonlinear Cone Separation Theorems in Real Topological Linear Spaces, Equilibrium set-valued variational principles and the lower boundedness condition with application to psychology, \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces, Scalarization of \(\epsilon\)-super efficient solutions of set-valued optimization problems in real ordered linear spaces, Generalized Gerstewitz's functions and vector variational principle for \(\epsilon\)-efficient solutions in the sense of Németh, Equilibrium versions of variational principles in quasi-metric spaces and the robust trap problem, Equilibrium versions of set-valued variational principles and their applications to organizational behavior, Benson proper efficiency for vector optimization of generalized subconvexlike set-valued maps in ordered linear spaces, Approximate solutions of vector optimization problems via improvement sets in real linear spaces, Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces, A pre-order principle and set-valued Ekeland variational principle, The relationship between two kinds of generalized convex set-valued maps in real ordered linear spaces, Weak minimal elements and weak minimal solutions of a nonconvex set-valued optimization problem, On relatively solid convex cones in real linear spaces, Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces, \(\epsilon \)-Henig proper efficiency of set-valued optimization problems in real ordered linear spaces, Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems, On the Intrinsic Core of Convex Cones in Real Linear Spaces, Duality for vector optimization problems via a general scalarization, Nonconvex Separation Functional in Linear Spaces with Applications to Vector Equilibria, Vectorial variational principle with variable set-valued perturbation
Cites Work
- Efficiency and proper efficiency in vector maximization with respect to cones
- Foundations of optimization
- Characterizations of the Benson proper efficiency for nonconvex vector optimization
- Proper solutions of vector optimization problems
- Lagrange multipliers and saddle points in multiobjective programming
- Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- The geometry of Pareto efficiency over cones
- Proper Efficient Points for Maximizations with Respect to Cones
- Scalarization and lagrange duality in multiobjective optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
