Disjunctive cuts for continuous linear bilevel programming

This work shows how disjunctive cuts can be generated for a bilevel linear programming problem (BLP) with continuous variables. First, a brief summary on disjunctive programming and bilevel programming is presented. Then duality theory is used to reformulate BLP as a disjunctive program and, from there, disjunctive programming results are applied to derive valid cuts. These cuts tighten the domain of the linear relaxation of BLP. An example is given to illustrate this idea, and a discussion follows on how these cuts may be incorporated in an algorithm for solving BLP.

[1]  P. Bonami.  Etude et mise en œuvre d'approches polyédriques pour la résolution de programmes en nombres entiers ou mixtes généraux , 2003 .

[2]  Pierre Hansen,et al.  A symmetrical linear maxmin approach to disjoint bilinear programming , 1999, Math. Program..

[3]  L. N. Vicente,et al.  Multicriteria Approach to Bilevel Optimization , 2006 .

[4]  Xiaotie Deng,et al.  Complexity Issues in Bilevel Linear Programming , 1998 .

[5]  L. N. Vicente,et al.  Descent approaches for quadratic bilevel programming , 1994 .

[6]  E. Balas.  Disjunctive programming and a hierarchy of relaxations for discrete optimization problems , 1985 .

[7]  Egon Balas,et al.  Lift-and-project for Mixed 0-1 programming: recent progress , 2002, Discret. Appl. Math..

[8]  David Bernstein,et al.  SOLVING THE TOLL DESIGN PROBLEM WITH MULTIPLE USER GROUPS , 2004 .

[9]  Charles Audet,et al.  New Branch-and-Cut Algorithm for Bilevel Linear Programming , 2004 .

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

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

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

[13]  Mohammad Mehdi Sepehri,et al.  Linear bilevel programming solution by genetic algorithm , 2002, Comput. Oper. Res..

[14]  J. Morgan,et al.  A theoretical approximation scheme for Stackelberg problems , 1989 .

[15]  Egon Balas,et al.  A lift-and-project cutting plane algorithm for mixed 0–1 programs , 1993, Math. Program..

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

[17]  Gilles Savard,et al.  Contribution à la programmation mathématique à deux niveaux , 1989 .

[18]  Panos M. Pardalos,et al.  Editorial: Hierarchical and bilevel programming , 1996, J. Glob. Optim..