Article ID: | iaor19981313 |
Country: | Netherlands |
Volume: | 82 |
Issue: | 3 |
Start Page Number: | 615 |
End Page Number: | 646 |
Publication Date: | May 1995 |
Journal: | European Journal of Operational Research |
Authors: | Frangioni Antonio |
Keywords: | programming: integer |
We extend some known results about the Bilevel Linear Problem (BLP), a hierarchical two-stage optimization problem, showing how it can be used to reformulate any Mixed Integer (Linear) Problem; then, we introduce some new concepts, which might be useful to fasten almost all the known algorithms devised for BLP. As this kind of reformulation appears to be somewhat artificial, we define a natural generalization of BLP, the Bilevel Linear/Quadratic Problem (BL/QP), and show that most of the exact and/or approximate algorithms originally devised for the BLP, such as GSA or