Optimality of E-pseudoconvex multi-objective programming problems without constraint qualifications
2012
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:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
15
References
0
Citations
NaN
KQI