Characterizations of the Benson proper efficiency for nonconvex vector optimization
From MaRDI portal
Publication:1265061
DOI10.1023/A:1022689517921zbMath0908.90225MaRDI QIDQ1265061
Publication date: 28 February 1999
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
vector optimization; duality; Lagrangian multipliers; scalarization; proper efficiency; generalized cone-subconvexlikeness; saddle-point criterion
Related Items
On super efficiency in set-valued optimisation in locally convex spaces, Generalized constraint qualifications and optimality conditions for set-valued optimization problems, Generalized ( ,α, ρ, θ)–d–V–univex functions and non-smooth alternative theorems, Optimality conditions of vector set-valued optimization problem involving relative interior, Erratum for ``Higher-order weakly generalized adjacent epiderivatives and applications to duality of set-valued optimization, Nearly subconvexlike set-valued maps and vector optimization problems, Second-order optimality conditions for set-valued optimization problems under Benson proper efficiency, Proper efficiency in vector optimization on real linear spaces., Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems, Duality and saddle-points for convex-like vector optimization problems on real linear spaces, On super efficiency in set-valued optimization, Moreau-Rockafellar theorems for nonconvex set-valued maps, Optimality conditions of globally efficient solution for vector equilibrium problems with generalized convexity, On the generalized Fritz John optimality conditions of vector optimization with set-valued maps under Benson proper efficiency, Duality and saddle-point type optimality for generalized nonlinear fractional programming., Hartley proper efficiency in multifunction optimization, On first order optimality conditions for vector optimization, New generalized convexity notion for set-valued maps and application to vector optimization, Benson proper efficiency in the nearly cone-subconvexlike vector optimization with set-valued functions., The analytic hierarchy process and multiobjective 0--1 faculty course assignment, Theorems of the alternative for multifunctions., Benson proper efficiency for vector optimization of generalized subconvexlike set-valued maps in ordered linear spaces, ∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS
Cites Work
- A generalization of a minimax theorem of Fan via a theorem of the alternative
- An improved definition of proper efficiency for vector maximization with respect to cones
- Proper efficiency with respect to cones
- On proper and improper efficient solutions of optimal problems with multicriteria
- Alternative theorems and optimality conditions with weakened convexity
- On the notion of proper efficiency in vector optimization
- Lagrange multipliers and saddle points in multiobjective programming
- Proper efficiency and the theory of vector maximization
- Positive Proper Efficient Points and Related Cone Results in Vector Optimization Theory
- A Characterization of Properly Minimal Elements of a Set
- Proper Efficient Points for Maximizations with Respect to Cones
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- Super Efficiency in Vector Optimization
- Super efficiency in convex vector optimization
