Hostname: page-component-76fb5796d-vfjqv Total loading time: 0 Render date: 2024-04-26T23:47:29.866Z Has data issue: false hasContentIssue false

Generalized Lagrange multiplier rule for non-convex vector optimization problems

Published online by Cambridge University Press:  03 March 2016

Maria Bernadette Donato*
Affiliation:
Department of Mathematics and Computer Science, University of Messina, Viale Ferdinando Stagno d’Alcontres, 31-98166, Messina, Italy (mbdonato@unime.it)

Abstract

In this paper a non-convex vector optimization problem among infinite-dimensional spaces is presented. In particular, a generalized Lagrange multiplier rule is formulated as a necessary and sufficient optimality condition for weakly minimal solutions of a constrained vector optimization problem, without requiring that the ordering cone that defines the inequality constraints has non-empty interior. This paper extends the result of Donato (J. Funct. Analysis261 (2011), 2083–2093) to the general setting of vector optimization by introducing a constraint qualification assumption that involves the Fréchet differentiability of the maps and the tangent cone to the image set. Moreover, the constraint qualification is a necessary and sufficient condition for the Lagrange multiplier rule to hold.

Type
Research Article
Copyright
Copyright © Royal Society of Edinburgh 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)