Solving Bilevel Mixed Integer Program by Reformulations and Decomposition June , 2014

In this paper, we study bilevel mixed integer programming (MIP) problem and present a novel computing scheme based on reformulations and decomposition strategy. By converting bilevel MIP into a constrained mathematical program, we present its single-level reformulations that are friendly to perform analysis and build insights. Then, we develop a decomposition algorithm based on column-and-constraint generation method, which converges to the optimal value within finite operations. A preliminary computational study on randomly generated instances is presented, which demonstrates that the developed computing scheme has a superior capacity over existing methods. As it is generally applicable, easy-to-use and computationally strong, we believe that this solution method makes an important progress in solving challenging bilevel MIP problem.

[1]  Pan Xu,et al.  An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions , 2014, Comput. Oper. Res..

[2]  Shan Jin,et al.  A Tri-Level Model of Centralized Transmission and Decentralized Generation Expansion Planning for an Electricity Market—Part I , 2014, IEEE Transactions on Power Systems.

[3]  Wei Yuan,et al.  Optimal power grid protection through a defender-attacker-defender model , 2014, Reliab. Eng. Syst. Saf..

[4]  Long Zhao,et al.  Solving two-stage robust optimization problems using a column-and-constraint generation method , 2013, Oper. Res. Lett..

[5]  Bo Zeng,et al.  Vulnerability Analysis of Power Grids With Line Switching , 2013, IEEE Transactions on Power Systems.

[6]  Xiaoning Qian,et al.  Adaptive bi-level programming for optimal gene knockouts for targeted overproduction under phenotypic constraints , 2013, BMC Bioinformatics.

[7]  Jing Hu,et al.  On linear programs with linear complementarity constraints , 2011, Journal of Global Optimization.

[8]  Pan Xu,et al.  Three essays on bilevel optimization algorithms and applications , 2012 .

[9]  T. Ralphs,et al.  Interdiction and discrete bilevel linear programming , 2011 .

[10]  Natalia Alguacil,et al.  Analysis of Electric Grid Interdiction With Line Switching , 2010, IEEE Transactions on Power Systems.

[11]  Jose M. Arroyo,et al.  Bilevel programming applied to power system vulnerability analysis under multiple contingencies , 2010 .

[12]  Daniel Bienstock,et al.  The N-k Problem in Power Grids: New Models, Formulations, and Numerical Experiments , 2009, SIAM J. Optim..

[13]  A. Conejo,et al.  Pool Strategy of a Producer With Endogenous Formation of Locational Marginal Prices , 2009, IEEE Transactions on Power Systems.

[14]  M. Queyranne,et al.  Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs , 2009, 0907.1298.

[15]  J. Salmeron,et al.  Worst-Case Interdiction Analysis of Large-Scale Electric Power Grids , 2009, IEEE Transactions on Power Systems.

[16]  Richard L. Church,et al.  A bilevel mixed-integer program for critical infrastructure protection planning , 2008, Comput. Oper. Res..

[17]  Jing Hu,et al.  On the Global Solution of Linear Programs with Linear Complementarity Constraints , 2008, SIAM J. Optim..

[18]  Martine Labbé,et al.  Joint Design and Pricing on a Network , 2008, Oper. Res..

[19]  R. Alvarez,et al.  Trilevel Optimization in Power Network Defense , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[20]  J. C. Smith,et al.  Algorithms for discrete and continuous multicommodity flow network interdiction problems , 2007 .

[21]  Stephan Dempe,et al.  Linear bilevel programming with upper level constraints depending on the lower level solution , 2006, Appl. Math. Comput..

[22]  M. Teresa T. Monteiro,et al.  Solving Mathematical Programs with Complementarity Constraints with Nonlinear Solvers , 2006 .

[23]  F.D. Galiana,et al.  A mixed-integer LP procedure for the analysis of electric grid security under disruptive threat , 2005, IEEE Transactions on Power Systems.

[24]  Patrice Marcotte,et al.  Bilevel programming: A survey , 2005, 4OR.

[25]  J. Arroyo,et al.  On the solution of the bilevel programming formulation of the terrorist threat problem , 2005, IEEE Transactions on Power Systems.

[26]  Lorenz T. Biegler,et al.  An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs) , 2005, SIAM J. Optim..

[27]  Gerald G. Brown,et al.  Analyzing the Vulnerability of Critical Infrastructure to Attack and Planning Defenses , 2005 .

[28]  D. Ralph,et al.  Convergence of a Penalty Method for Mathematical Programming with Complementarity Constraints , 2004 .

[29]  A. Burgard,et al.  Optknock: A bilevel programming framework for identifying gene knockout strategies for microbial strain optimization , 2003, Biotechnology and bioengineering.

[30]  P. Marcotte,et al.  A bilevel modelling approach to pricing and fare optimisation in the airline industry , 2003 .

[31]  Martine Labbé,et al.  A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network , 2000, Transp. Sci..

[32]  J. Pang,et al.  Strategic gaming analysis for electric power systems: an MPEC approach , 2000 .

[33]  Stefan Scholtes,et al.  Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity , 2000, Math. Oper. Res..

[34]  Jonathan F. Bard,et al.  A bilevel programming approach to determining tax credits for biofuel production , 2000, Eur. J. Oper. Res..

[35]  Jonathan F. Bard,et al.  Practical Bilevel Optimization: Algorithms and Applications , 1998 .

[36]  Jacqueline Morgan,et al.  Weak via strong Stackelberg problem: New results , 1996, J. Glob. Optim..

[37]  Antonio Frangioni.  On a new class of bilevel programming problems and its use for reformulating mixed integer problems , 1995 .

[38]  Pierre Hansen,et al.  Links Between Linear Bilevel and Mixed 0–1 Programming Problems , 1995 .

[39]  S. Dirkse,et al.  The path solver: a nommonotone stabilization scheme for mixed complementarity problems , 1995 .

[40]  Peter Värbrand,et al.  A global optimization approach for the linear two-level program , 1993, J. Glob. Optim..

[41]  Pierre Hansen,et al.  New Branch-and-Bound Rules for Linear Bilevel Programming , 1989, SIAM J. Sci. Comput..

[42]  Jonathan F. Bard,et al.  The Mixed Integer Linear Bilevel Programming Problem , 1990, Oper. Res..

[43]  Jonathan F. Bard,et al.  A Branch and Bound Algorithm for the Bilevel Programming Problem , 1990, SIAM J. Sci. Comput..

[44]  Ue-Pyng Wen,et al.  Algorithms for solving the mixed integer two-level linear programming problem , 1990, Comput. Oper. Res..

[45]  Patrice Marcotte,et al.  Network design problem with congestion effects: A case of bilevel programming , 1983, Math. Program..

[46]  Jonathan F. Bard,et al.  An Efficient Point Algorithm for a Linear Two-Stage Optimization Problem , 1983, Oper. Res..

[47]  George Papavassilopoulos.  Algorithms for static stackelberg games with linear costs and polyhedra constraints , 1982, 1982 21st IEEE Conference on Decision and Control.

[48]  Wayne F. Bialas,et al.  On two-level optimization , 1982 .

[49]  Wilfred Candler,et al.  A linear two-level programming problem, , 1982, Comput. Oper. Res..

[50]  Jonathan F. Bard,et al.  An explicit solution to the multi-level programming problem , 1982, Comput. Oper. Res..

[51]  José Fortuny-Amat,et al.  A Representation and Economic Interpretation of a Two-Level Programming Problem , 1981 .

[52]  Jerome Bracken,et al.  Mathematical Programs with Optimization Problems in the Constraints , 1973, Oper. Res..

[53]  R. Cassidy,et al.  Efficient Distribution of Resources Through Three Levels of Government , 1971 .