ε-Properly Efficient Solutions of Vector Optimization Problems with Set-Valued Maps
Rong Wei-dong · Or Transactions · 2000
e-Properly efficient solutions of vector optimization problems with set-valued maps are discussed. Under the assumption of the generalized cone-sub convexlikeness for setvalued maps, the scalarization theorems, the e-Lagrange multipliers theorems, the e-saddle-point theorems and e-proper duality theorems for e-properly efficient solutions of vector optimization problems with set-valued maps are obtained.