Pareto Optimizing and Kuhn-Tucker Stationary Sequences

Author: Maghri M. El  

Publisher: Taylor & Francis Ltd

ISSN: 0163-0563

Source: Numerical Functional Analysis and Optimization, Vol.28, Iss.3-4, 2007-03, pp. : 287-305

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

We study the relation between weakly Pareto minimizing and Kuhn-Tucker stationary nonfeasible sequences for vector optimization under constraints, where the weakly Pareto (efficient) set may be empty. The work is placed in a context of Banach spaces and the constraints are described by a functional taking values in a cone. We characterize the asymptotic feasibility in terms of the constraint map and the asymptotic efficiency via a Kuhn-Tucker system completely approximate, distinguishing the classical bounded case from the nontrivial unbounded one. The latter requires Auslender-Crouzeix type conditions and Ekeland's variational principle for constrained vector problems.