期刊
OPTIMIZATION LETTERS
卷 1, 期 3, 页码 259-267出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s11590-006-0024-3
关键词
Linear bilevel programming; Disjunctive cuts; Global optimization
资金
- FCAR [NC72792]
- NSERC [239436-01, ES D3-317862-2005]
- AFOSR [FA9550-04-1-0235]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据