Algebraic characterizations of weakly E-efficient solutions for vector optimization problems

DOI10.11721/CQNUJ20170446MaRDI QIDQ4640401zbMATH OpenFDO

Authors An Lin, Qiao Zhu, Kequan Zhao

Publication date 25 May 2018

zbMATH Keywords

scalarizationimprovement setalgebraic interiorvector optimization problems with set-valued maps

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Set-valued and variational analysis (49J53)

Recommendations

• Weak \(E\)-optimal solution in vector optimization
• Weak \(S\)-efficient solution of vector optimization
• \(\varepsilon\)-efficient solutions of a class of vector optimization problems with set-valued maps
• \(e\)-proper efficient solutions of vector optimization problems with set-valued maps
• scientific article; zbMATH DE number 5283948

Cited in

(7)

• Weak \(E\)-optimal solution in vector optimization
• Scalarization of weakly \(C(\varepsilon)\)-efficient solutions via quasi interior in vector optimization
• Alternative theorem on infinite index set and its application in vector optimization
• Weak \(S\)-efficient solution of vector optimization
• Characterizations of efficient and weakly efficient points in nonconvex vector optimization
• A Characterization of Efficient and Weakly Efficient Points in Convex Vector Optimization
• Optimality conditions for weak solutions of vector optimization problems through quasi interiors and improvement sets

This page was built for publication: Algebraic characterizations of weakly \(E\)-efficient solutions for vector optimization problems

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