Characterizations of the Benson proper efficiency for nonconvex vector optimization

DOI10.1023/A:1022689517921zbMath0908.90225OpenAlexW184567933MaRDI QIDQ1265061

Guang-Ya Chen, Wei Dong Rong

Publication date: 28 February 1999

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022689517921

zbMATH Keywords

vector optimizationdualityLagrangian multipliersscalarizationproper efficiencygeneralized cone-subconvexlikenesssaddle-point criterion

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming in abstract spaces (90C48)

Related Items

Scalarization and optimality conditions for the approximate solutions to vector variational inequalities in Banach spaces ⋮ Duality and saddle-points for convex-like vector optimization problems on real linear spaces ⋮ The analytic hierarchy process and multiobjective 0--1 faculty course assignment ⋮ Characterizations of improvement sets via quasi interior and applications in vector optimization ⋮ On super efficiency in set-valued optimization ⋮ A new kind of inner superefficient points ⋮ Nearly subconvexlike set-valued maps and vector optimization problems ⋮ ∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS ⋮ 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. ⋮ A kind of unified proper efficiency in vector optimization ⋮ Second-order optimality conditions for set-valued optimization problems under Benson proper efficiency ⋮ Hartley proper efficiency in multifunction optimization ⋮ On first order optimality conditions for vector optimization ⋮ Moreau-Rockafellar theorems for nonconvex set-valued maps ⋮ Theorems of the alternative for multifunctions. ⋮ Benson proper efficiency for vector optimization of generalized subconvexlike set-valued maps in ordered linear spaces ⋮ 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 ⋮ Proper efficiency in vector optimization on real linear spaces. ⋮ On super efficiency in set-valued optimisation in locally convex spaces ⋮ New generalized convexity notion for set-valued maps and application to vector optimization ⋮ Generalized constraint qualifications and optimality conditions for set-valued optimization problems ⋮ Scalarizations and Lagrange multipliers for approximate solutions in the vector optimization problems with set-valued maps ⋮ Approximate proper efficiency in vector optimization ⋮ Benson proper efficiency in the nearly cone-subconvexlike vector optimization with set-valued functions. ⋮ Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems ⋮ Approximate Benson efficient solutions for set-valued equilibrium problems ⋮ Second-order weakly composed adjacent-generalized contingent epiderivatives and applications to composite set-valued optimization problems ⋮ Optimality conditions of globally efficient solution for vector equilibrium problems with generalized convexity ⋮ E-Benson proper efficiency in vector optimization ⋮ Generalized ( ,α, ρ, θ)–d–V–univex functions and non-smooth alternative theorems

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