Abstract
Multiobjective optimization problems typically have conflicting objectives, and a gain in one objective very often is an expense in another. Using the concept of Pareto optimality, we investigate a multiobjective bilevel optimization problem (say, P). Our approach consists of proving that P is locally equivalent to a single level optimization problem, where the nonsmooth Mangasarian–Fromovitz constraint qualification may hold at any feasible solution. With the help of a special scalarization function introduced in optimization by Hiriart–Urruty, we convert our single level optimization problem into another problem and give necessary optimality conditions for the initial multiobjective bilevel optimization problem P.
Similar content being viewed by others
References
Babahadda, H., Gadhi, N.: Necessary optimality conditions for bilevel optimization problems using convexificators. J. Glob. Optim. 34, 535–549 (2006)
Bard, J.F.: Optimality conditions for the bilevel programming problem. Nav. Res. Logist. Q. 31, 13–26 (1984)
Bard, J.F.: Practical Bilevel Optimization: Algorithms and Applications. Kluwer Academic, Dordrecht (1998)
Dempe, S.: A necessary and sufficient optimality condition for bilevel programming problem. Optimization 25, 341–354 (1992)
Dempe, S.: Foundations of Bilevel Programming. Kluwer Academic, Dordrecht (2002)
Dempe, S.: Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization 52, 333–359 (2003)
Dempe, S., Gadhi, N.: Second order optimality conditions for bilevel set optimization problems. J. Glob. Optim. 47, 233–245 (2010)
Outrata, J.V.: On necessary optimality conditions for Stackelberg problems. J. Optim. Theory Appl. 76, 306–320 (1993)
Shimizu, K., Ishizuka, Y., Bard, J.F.: Nondifferentiable and Two-Level Mathematical Programming. Kluwer Academic, Boston (1997)
Stackelberg, H.v.: Marktform und Gleichgewicht. Springer, Berlin (1934)
Vicente, L.N., Calamai, P.H.: Bilevel and multilevel programming: A bibliography review. J. Glob. Optim. 5, 291–306 (1994)
Ye, J.J., Zhu, D.L.: Optimality conditions for bilevel programming problems. Optimization 33, 9–27 (1995)
Ye, J.J., Zhu, D.L.: A note on optimality conditions for bilevel programming problems. Optimization 39, 361–366 (1997)
Zhang, R.: Problems of hierarchical optimization in finite dimensions. SIAM J. Optim. 4, 521–536 (1995)
Zhang, R., Truong, B., Zhang, Q.: Multistage hierarchical optimization problems with multi-criterion objectives. J. Ind. Manag. Optim. 7, 103–115 (2011)
Amahroq, T., Taa, A.: On Lagrange–Kuhn–Tucker multipliers for multiobjective optimization problems. Optimization 41, 159–172 (1997)
Bao, T.Q., Gupta, P., Mordukhovich, B.S.: Necessary conditions in multiobjective optimization with equilibrium constraints. J. Optim. Theory Appl. 135, 179–203 (2007)
Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley-Interscience, New York (1983)
Ciligot-Travain, M.: On Lagrange–Kuhn–Tucker multipliers for Pareto optimization problem. Numer. Funct. Anal. Optim. 15, 689–693 (1994)
Hiriart-Urruty, J.B.: Tangent cones, generalized gradients and mathematical programming in Banach spaces. Math. Oper. Res. 4, 79–97 (1979)
Hiriart-Urruty, J.B., Lemaréchal, C.: Convex Analysis and Minimization Algorithms I. Springer, Berlin (1993)
Acknowledgements
This work has been supported by the Alexander-von Humboldt foundation.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Boris Mordukhovich.
Rights and permissions
About this article
Cite this article
Gadhi, N., Dempe, S. Necessary Optimality Conditions and a New Approach to Multiobjective Bilevel Optimization Problems. J Optim Theory Appl 155, 100–114 (2012). https://doi.org/10.1007/s10957-012-0046-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-012-0046-1