Abstract
When characterizing optimal solutions of both scalar and vectoroptimization problems usually constraint qualifications have to besatisfied. By considering sequential characterizations, given forthe first time in vector optimization in this paper, this drawbackis eliminated. In order to establish them we give first of allsequential characterizations for a convex composed optimizationproblem with geometric and cone constraints. Then, by means ofscalarization, we extend them to the vector case. Forexemplification we particularize the characterization in the caseof linear and set scalarization.
Full Text
Published Version
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