ON APPROXIMATE EFFICIENCY FOR NONSMOOTH ROBUST VECTOR OPTIMIZATION PROBLEMS  

作　　者：Tadeusz ANTCZAK Yogendra PANDEY Vinay SINGH Shashi Kant MISHRA 

机构地区：[1]Faculty of Mathematics and Computer Science,University of Lódź,Banacha 22,90-238 Lódź,Poland [2]Department of Mathematics,Satish Chandra College,Ballia 277001,India [3]Department of Mathematics,National Institute of Technology,Aizawl-796012,Mizoram,India [4]Department of Mathematics,Banaras Hindu University,Varanasi-221005,India

出　　处：《Acta Mathematica Scientia》2020年第3期887-902,共16页数学物理学报（B辑英文版）

基　　金：The research of Yogendra Pandey and Vinay Singh are supported by the Science and Engineering Research Board,a statutory body of the Department of Science and Technology(DST),Government of India,through file no.PDF/2016/001113 and SCIENCE&ENGINEERING RESEARCH BOARD(SERB-DST)through project reference no.EMR/2016/002756,respectively.

摘　　要：In this article,we use the robust optimization approach(also called the worst-case approach)for findingε-efficient solutions of the robust multiobjective optimization problem defined as a robust(worst-case)counterpart for the considered nonsmooth multiobjective programming problem with the uncertainty in both the objective and constraint functions.Namely,we establish both necessary and sufficient optimality conditions for a feasible solution to be anε-efficient solution(an approximate efficient solution)of the considered robust multiobjective optimization problem.We also use a scalarizing method in proving these optimality conditions.

关 键 词：Robust optimization approach robust multiobjective optimization ε-efficient solution ε-optimality conditions SCALARIZATION 

分 类 号：O224[理学—运筹学与控制论]