Optimality of E-pseudoconvex multi-objective programming problems without constraint qualifications |
| |
| Authors: | GuoLin Yu Yangyang Lu Yan Jiang |
| |
| Affiliation: | 1. Research Institute of Information and System Computation Science, Beifang University of Nationalities, Yinchuan, 750021, People??s Republic of China
|
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
