Weak E-optimal solution in vector optimization

DOI10.11650/TJM.17.2013.1971zbMATH Open1304.90191OpenAlexW1998824459MaRDI QIDQ373715FDOQ373715

Authors: J. W. Peng, Kequan Zhao, Xinmin Yang

Publication date: 24 October 2013

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: http://journal.taiwanmathsoc.org.tw/index.php/TJM/article/view/2721

Recommendations

Weak $S$-efficient solution of vector optimization
scientific article; zbMATH DE number 5283948
Algebraic characterizations of weakly $E$-efficient solutions for vector optimization problems
$e$-proper efficient solutions of vector optimization problems with set-valued maps
Nearly subconvexlike set-valued maps and vector optimization problems

Lagrange multiplier scalarization vector optimization improvement set weak $E$-duality weak $E$-optimal solution weak $E$-saddle point

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Cited In (22)

Globally proper efficiency of set-valued optimization and vector variational inequality involving the generalized contingent epiderivative
A kind of unified proper efficiency in vector optimization
A kind of unified super efficiency via assumption (A) and applications in vector optimization
On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems
Characterizations of improvement sets via quasi interior and applications in vector optimization
$E$-super efficiency of set-valued optimization problems involving improvement sets
Algebraic characterizations of weakly $E$-efficient solutions for vector optimization problems
An existence theorem about the weakly efficient solution of the vector optimization problem in Hausdorff spaces
A characterization of $E$-Benson proper efficiency via nonlinear scalarization in vector optimization
Weakly nondominated solutions of set-valued optimization problems with variable ordering structures in linear spaces
Some properties of nonconvex oriented distance function and applications to vector optimization problems
Weak $S$-efficient solution of vector optimization
A combined scalarization method for multi-objective optimization problems
Scalarization and Optimality Conditions of E-Globally Proper Efficient Solution for Set-Valued Equilibrium Problems
Set optimization using improvement sets
The connectedness of the solutions set for set-valued vector equilibrium problems under improvement sets
Ideal, weakly efficient solutions for vector optimization problems
Conic scalarizations for approximate efficient solutions in nonconvex vector optimization problems
Scalarizations and optimality of constrained set-valued optimization using improvement sets and image space analysis
Approximate solutions of vector optimization problems via improvement sets in real linear spaces
A kind of unified strict efficiency via improvement sets in vector optimization
$e$-proper saddle points and $e$-proper duality in vector optimization with set-valued maps

This page was built for publication: Weak $E$-optimal solution in vector optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q373715)