Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
474313 | Computers & Mathematics with Applications | 2008 | 16 Pages |
Abstract
Using the theory of abstract optimization problems in infinite-dimensional spaces we provide necessary optimality conditions of first and second order for weakly efficient solutions of the multi-objective infinite programming problem. Sufficient conditions are given under invexity assumptions. We generalize the notion of KKT-invexity for the multi-objective infinite problem and show that this notion is a necessary and sufficient condition for every vector KKT solution to be a weakly efficient solution. Moreover, we develop a theorem of the alternative, useful for proving some of our results.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Valeriano Antunes de Oliveira, Marko Antonio Rojas-Medar,