Optimality conditions for a nonconvex set-valued optimization problem

Authors:
María Alonso;Luis Rodríguez-Marín
Affiliations:
Dpto. Matemática Aplicada I. E.T.S.I. Industriales, Universidad Nacional de Educación a Distancia, Aptdo. 60149, 28080 Madrid, Spain;Dpto. Matemática Aplicada I. E.T.S.I. Industriales, Universidad Nacional de Educación a Distancia, Aptdo. 60149, 28080 Madrid, Spain
Venue:
Computers & Mathematics with Applications
Year:
2008

Citing 5
Cited 1

A nonconvex vector minimization problem

Non-Linear Analysis
Contingent derivatives of set-valued maps and applications to vector optimization

Mathematical Programming: Series A and B
Qualitative aspects of the local approximation of a piecewise differentiable function

Nonlinear Analysis: Theory, Methods & Applications
On subdifferentials of set-valued maps

Journal of Optimization Theory and Applications
The Lagrange Multiplier Rule in Set-Valued Optimization

SIAM Journal on Optimization

On solutions of set-valued optimization problems

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.09

Visualization

Abstract

In this paper we study necessary and sufficient optimality conditions for a set-valued optimization problem. Convexity of the multifunction and the domain is not required. A definition of K-approximating multifunction is introduced. This multifunction is the differentiability notion applied to the problem. A characterization of weak minimizers is obtained for invex and generalized K-convexlike multifunctions using the Lagrange multiplier rule.