Hostname: page-component-745bb68f8f-hvd4g Total loading time: 0 Render date: 2025-02-11T09:38:26.173Z 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)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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