Abstract
In this paper, by using Ljusternik’s theorem and the open mapping theorem of convex process, the author gives necessary conditions for the efficient solution to the vector optimization problems without requiring that the ordering cone in the objective space has a nonempty interior.
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
