Some properties of the bilevel programming problem |
| |
Authors: | J. F. Bard |
| |
Affiliation: | (1) Operations Research Group, Department of Mechanical Engineering, University of Texas, Austin, Texas |
| |
Abstract: | The purpose of this paper is to elaborate on the difficulties accompanying the development of efficient algorithms for solving the bilevel programming problem (BLPP). We begin with a pair of examples showing that, even under the best of circumstances, solutions may not exist. This is followed by a proof that the BLPP is NP-hard.This work was partially supported by a grant from the Advanced Research Program of the Texas Higher Education Coordinating Board. |
| |
Keywords: | Bilevel programming Stackelberg games computational complexity |
本文献已被 SpringerLink 等数据库收录! |
|