Optimality conditions for strictly efficient solutions of nondifferentiable vector optimization problem

MaRDI QIDQ5318969zbMATH OpenFDO

Authors Taiyong Li, Yihong Xu

Publication date 22 July 2009

zbMATH Keywords

generalized subconvexlikenessmultiobjective programmingoptimality conditionstrictly efficient solution

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Necessary optimality conditions in nondifferentiable vector optimization
• Some properties of efficient solutions for vector optimization
• The optimality conditions of differentiable vector optimization problems
• Optimality conditions in quasidifferentiable vector optimization
• On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives

Cited in

(10)

• Optimality conditions for vector optimization problems
• The optimality conditions of differentiable vector optimization problems
• Strict directional solutions in vectorial problems: necessary optimality conditions
• Optimality conditions for a unified vector optimization problem with not necessarily preordering relations
• Necessary optimality conditions in nondifferentiable vector optimization
• Optimality conditions in vector optimization problems with a nonsolid cone of positive elements
• scientific article; zbMATH DE number 2157172 (Why is no real title available?)
• Optimality conditions for minimizing the difference of nonconvex vector-valued mappings
• Some properties of efficient solutions for vector optimization
• Remarks on strict efficiency in scalar and vector optimization

This page was built for publication: Optimality conditions for strictly efficient solutions of nondifferentiable vector optimization problem

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