∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS

DOI10.1142/S0217595907001577zbMath1200.90147MaRDI QIDQ3502868

Chuan-Xi Zhu, Yi-hong Xu, Tai Yong Li

Publication date: 20 May 2008

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

ic-cone-convexlikeness\(\varepsilon\)-strictly efficient solution\(\varepsilon\)-strict duality\(\varepsilon\)-strict saddle point

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Variational inequalities (49J40) Programming in abstract spaces (90C48)

Related Items (9)

A new kind of inner superefficient points ⋮ Image space analysis and scalarization for \(\varepsilon \)-optimization of multifunctions ⋮ Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps ⋮ \(\varepsilon\)-strict subdifferentials of set-valued maps and optimality conditions ⋮ \(E\)-super efficiency of set-valued optimization problems involving improvement sets ⋮ \(\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 ⋮ Optimality conditions for strictly efficient solutions in set-valued optimization ⋮ \(\epsilon \)-Henig proper efficiency of set-valued optimization problems in real ordered linear spaces

Cites Work

• Unnamed Item
• Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
• Characterizations of the Benson proper efficiency for nonconvex vector optimization
• Benson proper efficiency in the vector optimization of set-valued maps
• Ekeland's \(\varepsilon\)-variational principle for set-valued mappings
• Optimality conditions for proper efficient solutions of vector set-valued optimization.
• New generalized convexity notion for set-valued maps and application to vector optimization
• \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
• Strong efficiency in a locally convex space
• An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces^∗
• On super efficiency in set-valued optimisation in locally convex spaces
• e-weak minimal solutions of vector optimization problems with set-valued maps

This page was built for publication: ∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS