✦ LIBER ✦

Efficient solutions for the linear bilevel programming problem

✍ Scribed by Ue-Pyng Wen; Shuh-Tzy Hsu

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 610 KB
Volume: 62
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(92)90124-r

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characterizing an optimal solution to th

Characterizing an optimal solution to the linear bilevel programming problem

✍ Yi-Hsin Liu; Stephen M. Hart 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 155 KB

A neural network approach for solving li

A neural network approach for solving linear bilevel programming problem

✍ Tiesong Hu; Xuning Guo; Xiang Fu; Yibing Lv 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 225 KB

A note on the Pareto optimality of solut

A note on the Pareto optimality of solutions to the linear bilevel programming problem

✍ Patrice Marcotte; Gilles Savard 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 296 KB

Optimality conditions for the bilevel pr

Optimality conditions for the bilevel programming problem

✍ Jonathan F. Bard 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 697 KB

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

A modified simplex approach for solving

A modified simplex approach for solving bilevel linear programming problems

✍ Hayri Önal 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 892 KB