Abstract
Penalty methods are very efficient in finding an optimal solution to constrained optimization problems. In this paper, we present an objective penalty function with two penalty parameters for inequality constrained bilevel programming under the convexity assumption to the lower level problem. Under some conditions, an optimal solution to a bilevel programming defined by the objective penalty function is proved to be an optimal solution to the original bilevel programming. Moreover, based on the objective penalty function, an algorithm is developed to obtain an optimal solution to the original bilevel programming, with its convergence proved under some conditions.
Similar content being viewed by others
References
Stackelberg, H.V.: The Theory of the Market Economy. Oxford University Press, Oxford (1952)
Douligeris, C., Mazumdar, R.: A game theoretic perspective to flow control in telecommunication networks. J. Franklin Inst. 329, 383–402 (1992)
Zhang, J., Zhu, D.: A bilevel programming method for pipe network optimization. SIAM J. Optim. 6, 838–857 (1996)
Gil, H.A., Galiana, F.D., da Silva, E.L.: Nodal price control: a mechanism for transmission network cost allocation. IEEE Trans. Power Syst. 21, 3–10 (2006)
Yang, H., Zhang, X., Meng, Q.: Stackelberg games and multiple equilibrium behaviors on networks. Transp. Res., Part B, Methodol. 41, 841–861 (2007)
Kogan, K., Tapiero, C.S.: Optimal co-investment in supply chain infrastructure. Eur. J. Oper. Res. 192, 265–276 (2009)
Yao, Z., Leung, S.C.H, Lai, K.K.: Manufacturer’s revenue-sharing contract and retail competition. Eur. J. Oper. Res. 186, 637–651 (2008)
Dempe, S.: Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization 52, 333–359 (2003)
Colson, B., Marcotte, P., Savard, G.: Bilevel programming: a survey. 4OR 2, 87–107 (2005)
Luo, Z.Q., Pang, J.S., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge (1996)
Dempe, S.: Foundations of Bilevel Programming. Kluwer Academic, Dordrecht (2002)
Fletcher, R.: Practical Method of Optimization. Wiley, New York (1981)
Marcotte, P., Zhu, D.L.: Exact and inexact penalty methods for the generalized bilevel programming problem. Math. Program., Ser. A 74, 141–157 (1996)
Ye, J.J., Zhu, D.L., Zhu, Q.J.: Exact penalization and necessary optimality conditions for generalized bilevel programming problems. SIAM J. Optim. 7, 481–507 (1997)
Scholtes, S., Stöhr, M.: Exact penalization of mathematical programs with equilibrium constraints. SIAM J. Control Optim. 37, 617–652 (1999)
Liu, G.S., Han, J.Y., Zhang, J.Z.: Exact penalty functions for convex bilevel programming problems. J. Optim. Theory Appl. 110, 621–643 (2001)
Yang, X.Q., Huang, X.X.: Lower order penalty methods for mathematical programs with complementarity constraints. Optim. Methods Softw. 19, 693–720 (2004)
Huang, X.X., Yang, X.Q., Teo, K.L.: Partial augmented Lagrangian method and mathematical programs with complementarity constraints. J. Glob. Optim. 35, 235–254 (2006)
Huang, X.X., Yang, X.Q., Zhu, D.L.: A sequential smooth penalization approach to mathematical programs with complementarity constraints. Numer. Funct. Anal. Optim. 27, 71–98 (2006)
Lv, Y., Hu, T., Wang, G., Wan, Z.: A penalty function method based on Kuhn–Tucker condition for solving linear bilevel programming. Appl. Math. Comput. 188, 808–813 (2007)
Calvete, H.I., Gal, C.: Bilevel multiplicative problems: a penalty approach to optimality and a cutting plane based algorithm. J. Comput. Appl. Math. 218, 259–269 (2008)
Ankhili, Z., Mansouri, A.: An exact penalty on bilevel programs with linear vector optimization lower level. Eur. J. Oper. Res. 197, 36–41 (2009)
Meng, Z., Hu, Q., Dang, C.: A penalty function algorithm with objective parameters for nonlinear mathematical programming. J. Ind. Manag. Optim. 5, 585–601 (2009)
Dempe, S., Gadhi, N.: Necessary optimality conditions and a new approach to multiobjective bilevel optimization problems. J. Optim. Theory Appl. (to appear)
Sauli Ruuska, A., Kaisa Miettinen, A., Margaret, M.: Connections between single-level and bilevel multiobjective optimization. J. Optim. Theory Appl. Online first, 21 October 2011. doi:10.1007/s10957-011-9943-y
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Guang-ya Chen.
Rights and permissions
About this article
Cite this article
Meng, Z., Dang, C., Shen, R. et al. An Objective Penalty Function of Bilevel Programming. J Optim Theory Appl 153, 377–387 (2012). https://doi.org/10.1007/s10957-011-9945-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-011-9945-9