| Article ID: | iaor20105774 |
| Volume: | 48 |
| Issue: | 1 |
| Start Page Number: | 159 |
| End Page Number: | 172 |
| Publication Date: | Sep 2010 |
| Journal: | Journal of Global Optimization |
| Authors: | Strekalovsky Alexander S, Orlov Andrey V, Malyshev Anton V |
| Keywords: | programming (bilevel) |
The linear-linear and quadratic-linear bilevel programming problems are considered. Their optimistic statement is reduced to a nonconvex mathematical programming problem with the bilinear structure. Approximate algorithms of local and global search in the obtained problems are proposed. The results of computational solving randomly generated test problems are given and analyzed.