Scalarization and saddle points of approximate proper solutions in nearly subconvexlike vector optimization problems

JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS

卷:389

Article

Gutierrez, C.²  Huerga, L.¹  Novo, V.¹ 

[1] UNED, ETSI Ind, Dept Matemat Aplicada, Madrid 28040, Spain

[2] Univ Valladolid, ETS Ingenieros Telecomunicac, Dept Matemat Aplicada, E-47011 Valladolid, Spain

关键词: Proper epsilon-efficiency;    Approximate proper saddle point theorem;    Nearly subconvexlike mapping;    Linear scalarization;    Lagrangian function;    Slater constraint qualification;   

DOI  :  10.1016/j.jmaa.2011.12.050

来源: Elsevier

【 摘 要 】

In this paper, we characterize approximate Benson-proper solutions of a constrained vector optimization problem with generalized cone convexity assumptions through approximate solutions of associated scalar optimization problems and also via approximate proper saddle point theorems. These results are based on an approximate version of the well known nearly subconvexlikeness notion and also on a new set-valued Lagrangian and a new concept of approximate proper saddle point. (C) 2011 Elsevier Inc. All rights reserved.

【 授权许可】

Free