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

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

0.00 Avg rating—0 Votes
Article ID: iaor20127286
Volume: 6
Issue: 8
Start Page Number: 1603
End Page Number: 1611
Publication Date: Dec 2012
Journal: Optimization Letters
Authors: , ,
Keywords: programming: multiple criteria
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.

Reviews

Required fields are marked *. Your email address will not be published.