Abstract

For a given multi-objective optimization problem, we introduce and study the notion of ?-proper efficiency. We give two characterizations of such proper efficiency: one is in terms of exact penalization and the other is in terms of stability of associated parametric problems. Applying the aforementioned characterizations and recent results on global error bounds for inequality systems, we obtain verifiable conditions for ?-proper efficiency. For a large class of polynomial multi-objective optimization problems, we show that any efficient solution is ?-properly efficient under some mild conditions. For a convex quadratically constrained multi-objective optimization problem with convex quadratic objective functions, we show that any efficient solution is ?-properly efficient with a known estimate on ? whenever its constraint set is bounded. Finally, we illustrate our achieved results with examples, and give an example to show that such an enhanced efficiency property may not hold for multi-objective optimization problems involving C ?-functions as objective functions.

Full Text
Published version (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