zbMATH — the first resource for mathematics

Bilevel optimization with a multiobjective problem in the lower level. (English) Zbl 1415.90112
Summary: Bilevel problems model instances with a hierarchical structure. Aiming at an efficient solution of a constrained multiobjective problem according with some pre-defined criterion, we reformulate this semivectorial bilevel optimization problem as a classic bilevel one. This reformulation intents to encompass all the objectives, so that the properly efficient solution set is recovered by means of a convenient weighted-sum scalarization approach. Inexact restoration strategies potentially take advantage of the structure of the problem under consideration, being employed as an alternative to the Karush-Kuhn-Tucker reformulation of the bilevel problem. Genuine multiobjective problems possess inequality constraints in their modeling, and these constraints generate theoretical and practical difficulties to our lower level problem. We handle these difficulties by means of a perturbation strategy, providing the convergence analysis, together with enlightening examples and illustrative numerical tests.

90C29 Multi-objective and goal programming
65K05 Numerical mathematical programming methods
49M37 Numerical methods based on nonlinear programming
Full Text: DOI
[1] Andreani, R.; Castro, SLC; Chela, JL; Friedlander, A.; Santos, SA, An inexact-restoration method for nonlinear bilevel programming problems, Comput. Optim. Appl., 43, 307-328, (2009) · Zbl 1170.90484
[2] Benson, HP, An improved definition of proper efficiency for vector maximization with respect to cones, J. Math. Anal. Appl., 71, 232-241, (1979) · Zbl 0418.90081
[3] Benson, HP, Optimization over the efficient set, J. Math. Anal. Appl., 98, 562-580, (1984) · Zbl 0534.90077
[4] Bonnel, H.; Morgan, J., Semivectorial bilevel optimization problem: penalty approach, J. Optim. Theory Appl., 131, 365-382, (2006) · Zbl 1205.90258
[5] Bonnel, H., Morgan, J.: Optimality conditions for semivectorial bilevel convex optimal control problems, Proceedings in Mathematics & Statistics, vol. 50, pp. 5-78. Springer, Heidelberg (2013) · Zbl 1283.49042
[6] Borwein, J., Proper efficient points for maximizations with respect to cones, SIAM J. Control. Optim., 15, 57-63, (1977) · Zbl 0369.90096
[7] Bskens, C.; Wassel, D., The ESA NLP Solver WORHP, chap. 8. Springer, Springer Optimization and Its Applications, 73, 85-110, (2012) · Zbl 1365.90007
[8] Bueno, LF; Haeser, G.; Martínez, JM, An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization, Optim. Lett., 10, 1315-1325, (2016) · Zbl 1353.90143
[9] Deb, K., Multi-objective genetic algorithms: problem difficulties and construction of test problems, Evol. Comput., 7, 205-230, (1999)
[10] Ehrgott, M.: Multicriteria Optimization. Springer, Berlin (2005) · Zbl 1132.90001
[11] El-Bakry, AS; Tapia, RA; Tsuchiya, T.; Zhang, Y., On the formulation and theory of the newton interior-point method for nonlinear programming, J. Optim. Theory Appl., 89, 507-541, (1996) · Zbl 0851.90115
[12] Fülöp, J.: On the equivalence between a linear bilevel programming problem and linear optimization over the efficient set. Technical report WP93-1, Laboratory of Operations Research and Decision Systems, Computer and Automation Institute, Hungarian Academy of Sciences (1993)
[13] Fletcher, R., Leyffer, S.: Numerical experience with solving MPECs as NLPs. Tech. rep., University of Dundee Report NA pp. 210 (2002)
[14] Fletcher, R.; Leyffer, S., Solving mathematical programs with complementarity constraints as nonlinear programs, Optimization Methods and Software, 19, 15-40, (2004) · Zbl 1074.90044
[15] Fletcher, R.; Leyffer, S.; Ralph, D.; Scholtes, S., Local convergence of SQP methods for mathematical programs with equilibrium constraints, SIAM J. Optim., 17, 259-286, (2006) · Zbl 1112.90098
[16] Geoffrion, AM, Proper efficiency and the theory of vector maximization, J. Math. Anal. Appl., 22, 618-630, (1968) · Zbl 0181.22806
[17] Guo, XL; Li, SJ, Optimality conditions for vector optimization problems with difference of convex maps, J. Optim. Theory Appl., 162, 821-844, (2014) · Zbl 1307.90160
[18] HSL. A collection of Fortran codes for large scale scientific computation. Available at http://www.hsl.rl.ac.uk/
[19] Huband, S., Barone, L., While, L., Hingston, P.: A scalable multi-objective test problem toolkit, pp. 280-295. Springer, Berlin (2005) · Zbl 1109.68603
[20] Kuhn, H.W., Tucker, A.W.: Nonlinear programming. In: Neyman, J. (ed.) Proceedings of the second Berkeley symposium on mathematical statistics and probability, pp. 481-492. University of California Press, Berkeley (1951)
[21] Martínez, JM, Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming, J. Optim. Theory Appl., 3, 39-58, (2001) · Zbl 1052.90089
[22] Martínez, JM; Pilotta, EA, Inexact-restoration algorithm for constrained optimization, J. Optim. Theory Appl., 104, 135-163, (2000) · Zbl 0969.90094
[23] Martínez, JM; Svaiter, BF, A practical optimality condition without constraint qualifications for nonlinear programming, J. Optim. Theory Appl., 118, 117-133, (2003) · Zbl 1033.90090
[24] Miettinen, K.M.: Nonlinear Multiobjective Optimization. Kluwer Academic Publishers, Boston (1999) · Zbl 0949.90082
[25] Pilotta, EA; Torres, GA, An inexact restoration package for bilevel programming problems, Appl. Math., 15, 1252-1259, (2012)
[26] Scholtes, S., Convergence properties of a regularization scheme for mathematical programs with complementarity constraints, SIAM J. Optim., 11, 918-936, (2001) · Zbl 1010.90086
[27] Srinivas, N.; Deb, K., Muiltiobjective optimization using nondominated sorting in genetic algorithms, Evol. Comput., 2, 221-248, (1994)
[28] Tanaka, M., Watanabe, H., Furukawa, Y., Tanino, T.: GA-based decision support system for multicriteria optimization. In: IEEE International Conference on Systems, Man and Cybernetics. Intelligent Systems for the 21St Century, vol. 2, pp. 1556-1561 (1995)
[29] Zitzler, E.; Deb, K.; Thiele, L., Comparison of multiobjective evolutionary algorithms: empirical results, Evol. Comput., 8, 173-195, (2000)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.