A Necessary Condition for Optimality in Multi Objective Programming under Inclusion Constraints
2011 ◽
Vol 403-408
◽
pp. 1322-1325
Keyword(s):
Optimality conditions for multi objective programming problems have been studied extensively in the literature. A necessary condition for Pareto optimality is derived by reducing the multi objective programming under inclusion constraints to systems of single objective problem and then using known results of them. The result is reasonable and efficient. Our aim in this paper is to get the optimality condition of problem (MOP) by a lemma which helps reducing multi objective optimality problem to systems of single objective ones.
1992 ◽
Vol 72
(1)
◽
pp. 91-111
◽
Keyword(s):
2009 ◽
Vol 8
(1)
◽
pp. 1-28
◽
Keyword(s):
Keyword(s):
Keyword(s):