zbMATH — the first resource for mathematics

A solution method for semivectorial bilevel programming problem via penalty method. (English) Zbl 1297.90131
Summary: In this paper, we address a class of semivectorial bilevel programming problem in which the upper level is a scalar optimization problem and the lower level is a linear multi-objective optimization problem. Then, we present a new penalty function method, which includes two different penalty parameters, for solving such a problem. Furthermore, we give a simple algorithm. Numerical examples show that the proposed algorithm is feasible.

90C26 Nonconvex programming, global optimization
90C31 Sensitivity, stability, parametric optimization
PDF BibTeX Cite
Full Text: DOI
[1] Ankhili, Z., Mansouri, A.: An exact penalty on bilevel programs with linear vector optimization lower level. Eur. J. Oper. Res. 197, 36–41 (2009) · Zbl 1157.90520
[2] Bard, J.F.: Practical Bilevel Optimization: Algorithms and Applications. Kluwer Academic, Dordrecht (1998) · Zbl 0943.90078
[3] Ben-Ayed, O., Blair, O.: Computational difficulty of bilevel linear programming. Oper. Res. 38, 556–560 (1990) · Zbl 0708.90052
[4] Benson, H.P.: Optimization over the efficient set. J. Math. Anal. Appl. 98, 562–580 (1984) · Zbl 0534.90077
[5] Bonnel, H.: Optimality condition for the semivectorial bilevel optimization problem. Pac. J. Optim. 2, 447–468 (2006) · Zbl 1124.90028
[6] Bonnel, H., Morgan, J.: Semivectorial bilevel optimization problem: Penalty approach. J. Optim. Theory Appl. 131, 365–382 (2006) · Zbl 1205.90258
[7] Colson, B., Marcotte, P., Savard, G.: Bilevel programming: A survey. 4OR: Q. J. Oper. Res. 3, 87–107 (2005) · Zbl 1134.90482
[8] Colson, B., Marcotte, P., Savard, G.: An overview of bilevel optimization. Ann. Oper. Res. 153, 235–256 (2007) · Zbl 1159.90483
[9] Dauer, J.P., Fosnaugh, T.A.: Optimization over the efficient set. J. Glob. Optim. 7, 261–277 (1995) · Zbl 0841.90107
[10] Dempe, S.: Foundations of Bilevel Programming. Nonconvex Optimization and Its Applications Series, vol. 61. Kluwer Academic, Dordrecht (2002) · Zbl 1038.90097
[11] Dempe, S.: Annotated bibliography on bilevel programming and mathematical problems with equilibrium constraints. Optimization 52, 333–359 (2003) · Zbl 1140.90493
[12] Gulati, T.R., Agarwal, D.: Optimality and duality in nondifferentiable multiobjective mathematical programming involving higher order F({\(\alpha\)},{\(\rho\)},d)-type I functions. J. Appl. Math. Comput. 27, 345–364 (2008) · Zbl 1193.90183
[13] Jahn, J.: Vector Optimization: Theory, Applications and Extensions. Springer, Berlin (2004) · Zbl 1055.90065
[14] Luo, Z.Q., Pang, J.S., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge (1996) · Zbl 0870.90092
[15] Meng, Z.Q., Hu, Q.Y., Dang, C.Y., Yang, X.Q.: An objective penalty function method for nonlinear programming. Appl. Math. Lett. 17, 683–689 (2004) · Zbl 1133.90398
[16] Miettinen, K.: Nonlinear Multiobjective Optimization. Kluwer Academic, Boston (1999) · Zbl 0949.90082
[17] Sakawa, M., Nishizaki, I.: Cooperative and Noncooperative Multi-Level Programming. Operations Research/Computer Science Interfaces Series. Springer, Berlin (2009)
[18] Shimizu, K., Ishizuka, Y., Bard, J.F.: Nondifferentiable and Two-Level Mathematical Programming. Kluwer Academic, Dordrecht (1997) · Zbl 0878.90088
[19] Vicente, L.N., Calamai, P.H.: Bilevel and multilevel programming: A bibliography review. J. Glob. Optim. 5, 1–23 (1994) · Zbl 0822.90127
[20] Wang, G., Wan, Z., Wang, X.: Bibliography on bilevel programming. Adv. Math. 36, 513–529 (2007) (in Chinese)
[21] Wen, U.P., Hsu, S.T.: Linear bilevel programming problems-a review. J. Oper. Res. Soc. 42, 125–133 (1991) · Zbl 0722.90046
[22] White, D.J.: Optimality and Efficiency. Willey, Chichester (1982)
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.