✦ LIBER ✦

An approximate programming method based on the simplex method for bilevel programming problem

✍ Scribed by Guangmin Wang; Kejun Zhu; Zhongping Wan

Book ID: 108077533
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 270 KB
Volume: 59
Category: Article
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2010.03.027

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Genetic algorithm based on simplex metho

Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem

✍ Guangmin Wang; Zhongping Wan; Xianjia Wang; Yibing Lv 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 257 KB

Exact penalty method for the nonlinear b

Exact penalty method for the nonlinear bilevel programming problem

✍ Qingfei Pan; Zhonghua An; Hui Qi 📂 Article 📅 2010 🏛 Wuhan University 🌐 English ⚖ 313 KB

A homotopy method for solving bilevel pr

A homotopy method for solving bilevel programming problem

✍ Dao Li Zhu; Qing Xu; Zhenghua Lin 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 234 KB

An approximate method for solving the co

An approximate method for solving the convex programming problem

✍ M. I. Zhaldak; Yu. V. Trius 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 321 KB

A solution method for semivectorial bile

A solution method for semivectorial bilevel programming problem via penalty method

✍ Yue Zheng; Zhongping Wan 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 440 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