Optimality of E-pseudoconvex multi-objective programming problems without constraint qualifications

作者：Yu GuoLin; Lu Yangyang; Jiang Yan

来源：Optimization Letters, 2012, 6(8): 1603-1611.

DOI：10.1007/s11590-011-0350-y

• Multi-objective programming
• E-Convexity
• E-Pseudoconvex function
• Efficient solution

In this note, we consider the optimality criteria of multi-objective programming problems without constraint qualifications involving generalized convexity. Under the E-pseudoconvexity assumptions, the unified necessary and sufficient optimality conditions are established for weakly efficient and efficient solutions, respectively, in multi-objective programming problems.

• 出版日期2012-12
• 单位北方民族大学