Counterexample and Optimality Conditions in Differentiable Multiobjective Programming

D. S. Kim, G. M. Lee, B. S. Lee and S. J. Cho

Journal of Optimization Theory and Applications, 2001, vol. 109, issue 1, No 9, 187-192

Abstract: Abstract Recently, sufficient optimality theorems for (weak) Pareto-optimal solutions of a multiobjective optimization problem (MOP) were stated in Theorems 3.1 and 3.3 of Ref. 1. In this note, we give a counterexample showing that the theorems of Ref. 1 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).

Keywords: multiobjective programming; Pareto-optimal solutions; weak Pareto-optimal solutions; optimality conditions (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1023/A:1017570023018 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:109:y:2001:i:1:d:10.1023_a:1017570023018

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1023/A:1017570023018

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().