Hartley Proper Efficiency In Multiobjective Optimization Problems With Locally Lipschitz Set-Valued Objectives and Constraints

摘要

In this paper we give necessary conditions for Hartley proper efficiency in a vector optimization problem whose objectives and constraints are described by nonconvex locally Lipchitz set-valued maps. The obtained necessary conditions are written in terms of a Lag-range multiplier rule. Our approach is based on a reduction theorem which leads the problem of studying proper efficiency to a scalar optimization problem whose objective is given by a function of max-type. Sufficient conditions for Hartley proper efficiency are also considered.