Counterexample and optimality conditions in differentiable multiobjective programming

Counterexample and optimality conditions in differentiable multiobjective programming

0.00 Avg rating0 Votes
Article ID: iaor2002459
Country: United States
Volume: 109
Issue: 1
Start Page Number: 187
End Page Number: 192
Publication Date: Apr 2001
Journal: Journal of Optimization Theory and Applications
Authors: , , ,
Abstract:

Recently, sufficient optimality theorems for (weak) Pareto-optimal solutions of a multiobjective optimization problem (MOP) were stated by Majumdaar. In this note, we give a counterexample showing that these theorems are not true. Then, by modifying the assumptions of these theorems, we establish two new sufficient optimality theorems for (weak) Pareto-optimal solutions of MOP; moreover, we give generalized sufficient optimality theorems for MOP.

Reviews

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