Abstract
Under the assumption that the ordering cone has a nonempty interior and is separable (or the feasible set has a nonempty interior and is separable), we give scalarization theorems on Benson proper efficiency. Applying the results to vector optimization problems with nearly cone-subconvexlike set-valued maps, we obtain scalarization theorems and Lagrange multiplier theorems for Benson proper efficient solutions.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
