Author: Audet Charles Haddad Jean Savard Gilles
Publisher: Springer Publishing Company
ISSN: 1862-4472
Source: Optimization Letters, Vol.1, Iss.3, 2007-06, pp. : 259-267
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
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.
Related content
A class of integer linear fractional bilevel programming problems
By Sharma Vikas Dahiya Kalpana Verma Vanita
Optimization, Vol. 63, Iss. 10, 2014-10 ,pp. :
Disjunctive programming and relaxations of polyhedra
By Conforti Michele Del Pia Alberto
Mathematical Programming, Vol. 144, Iss. 1-2, 2014-04 ,pp. :