✦ LIBER ✦

New Branch-and-Cut Algorithm for Bilevel Linear Programming

✍ Scribed by C. Audet; G. Savard; W. Zghal

Publisher: Springer
Year: 2007
Tongue: English
Weight: 436 KB
Volume: 134
Category: Article
ISSN: 0022-3239
DOI: 10.1007/s10957-007-9263-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and cut algorithm for nonconvex

A branch and cut algorithm for nonconvex quadratically constrained quadratic programming

✍ Charles Audet; Pierre Hansen; Brigitte Jaumard; Gilles Savard 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 221 KB

We present a branch and cut algorithm that yields in finite time, a globally ☼-optimal solution (with respect to feasibility and optimality) of the nonconvex quadratically constrained quadratic programming problem. The idea is to estimate all quadratic terms by successive linearizations within a bra

An adaptive genetic algorithm for solvin

An adaptive genetic algorithm for solving bilevel linear programming problem

✍ Guang-min Wang; Xian-jia Wang; Zhong-ping Wan; Shi-hui Jia 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 215 KB

A hybrid Tabu-ascent algorithm for the l

A hybrid Tabu-ascent algorithm for the linear Bilevel Programming Problem

✍ M. Gendreau; P. Marcotte; G. Savard 📂 Article 📅 1996 🏛 Springer US 🌐 English ⚖ 725 KB

An implicit branch-and-bound algorithm f

An implicit branch-and-bound algorithm for mixed-integer-linear programming

✍ Youling Lin; Larry M. Austin; James R. Burns 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 596 KB

A branch-reduce-cut algorithm for the gl

A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs

✍ Myun-Seok Cheon; Shabbir Ahmed; Faiz Al-Khayyal 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 292 KB

We consider probabilistically constrained linear programs with general distributions for the uncertain parameters. These problems involve non-convex feasible sets. We develop a branch-and-bound algorithm that searches for a global optimal solution to this problem by successively partitioning the non

An algorithm for the discrete bilevel pr

An algorithm for the discrete bilevel programming problem

✍ Jonathan F. Bard; James T. Moore 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 915 KB

The bilevel programming problem (BLPP) is an example of a two-stage, noncooperative game in which the first player can influence but not control the actions of the second. This article addresses the linear formulation and presents a new algorithm for solving the zero-one case. We begin by converting