Abstract
The bilevel programming is applied to solve hierarchical intelligence control problems in such fields as industry, agriculture, transportation, military, and so on. This paper presents a quadratic objective penalty function with two penalty parameters for inequality constrained bilevel programming. Under some conditions, the optimal solution to the bilevel programming defined by the quadratic objective penalty function is proved to be an optimal solution to the original bilevel programming. Moreover, based on the quadratic objective penalty function, an algorithm is developed to find an optimal solution to the original bilevel programming, and its convergence proved under some conditions. Furthermore, under the assumption of convexity at lower level problems, a quadratic objective penalty function without lower level problems is defined and is proved equal to the original bilevel programming.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Stackelberg H V, The Theory of the Market Economy, Oxford University Press, Oxford, England, 1952.
Christos D and Ravi M, A game theoretic perspective to flow control in telecommunication networks, Journal of the Franklin Institute, 1992, 329(2): 383–402.
Zhang J and Zhu D, A bilevel programming method for pipe network optimization, SIAM J. Optim., 1996, 6(3): 838–857.
Gil H A, Galiana F D, and Silva E L da, Nodal price control: A mechanism for transmission network cost allocation, Power Systems, IEEE Transactions on, 2006, 21: 3–10.
Yang H, Zhang X, and Meng Q, Stackelberg games and multiple equilibrium behaviors on networks, Transportation Research Part B: Methodological, 2007, 41(8): 841–861.
Kogan K and Tapiero C S, Optimal co-investment in supply chain infrastructure, European Journal of Operational Research, 2009, 192(1): 265–276.
Yao Z, Leung S C H, and Lai K K, Manufacturer’s revenue-shafring contract and retail competition, European Journal of Operational Research, 2008, 186(2): 637–651.
Dempe S, Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints, Optimization, 2003, 52(3): 333–359.
Colson B, Marcotte P, and Savard G, Bilevel programming: A survey, 4OR, 2005, 3(2): 87–107.
Luo Z Q, Pang J S, and Ralph D, Mathematical Programs with Equilibrium Constraints, Cambridge University Press, Cambridge, 1996.
Dempe S, Foundations of Bilevel Programming, Kluwer Academic Publishers, 2002.
Fletcher R, Practical Method of Optimization, A Wiley-Interscience Publication, New York, 1981.
Marcotte P and Zhu D L, Exact and inexact penalty methods for the generalized bilevel programming problem, Math. Programming, 1996, 74(2): 141–157.
Ye J J, Zhu D L, and Zhu Q J, Exact penalization and necessary optimality conditions for generalized bilevel programming problems, SIAM J. Optim., 1997, 7(2): 481–507.
Stefan S and Michael S, Exact penalization of mathematical programs with equilibrium constraints, SIAM J. Control Optimization, 1999, 37(2): 617–652.
Liu G S, Han J Y, and Zhang J Z, Exact penalty functions for convex bilevel programming problems, Journal of Optimization Theory and Applications, 2001, 110(3): 621–643.
Yang X Q and Huang X X, Lower order penalty methods for mathematical programs with complementarity constraints, Optimization Methods and Software, 2004, 19: 693–720.
Huang X X, Yang X Q, and Teo K L, Partial augmented Lagrangian method and mathematical programs with complementarity constraints, Journal of Global Optimization, 2006, 35: 235–254.
Huang X X, Yang X Q, and Zhu D L, A sequential smooth penalization approach to mathematical programs with complementarity constraints, Numerical Functional Analysis and Optimization, 2006, 27: 71–98.
Lü Y, Hu T, Wang G, and Wan Z, A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming, Appl. Math. Comput., 2007, 188(1): 808–813.
Calvete H I and Galé C, Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm, Journal of Computational and Applied Mathematics, 2008, 218(2): 259–269.
Ankhili and Mansouri A, An exact penalty on bilevel programs with linear vector optimization lower level, European Journal of Operational Research, 2009, 197(1): 36–41.
Meng Z Q, Hu Q Y, and Dang C Y, A penalty function algorithm with objective parameters for nonlinear mathematical programming, Journal of Industrial and Management Optimization, 2009, 5(3): 585–601.
Meng Z Q, Dang C Y, Shen R, and Jiang M, An objective penalty function of bilevel programming, J. Optim. Theory Appl., 2012, 153: 377–387.
Rockafellar R T, Convex Analysis, Princeton University Press, 1970.
Etoa E and Bosco J, Solving quadratic convex bilevel programming problems using a smoothing method, Applied Mathematics and Computation, 2011, 217(15): 6680–6690.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was supported by the National Natural Science Foundation of China under Grant Nos. 11271329 and 10971193.
This paper was recommended for publication by Editor DAI Yuhong.
Rights and permissions
About this article
Cite this article
Jiang, M., Meng, Z., Shen, R. et al. A quadratic objective penalty function for bilevel programming. J Syst Sci Complex 27, 327–337 (2014). https://doi.org/10.1007/s11424-014-2128-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-014-2128-7