Links between linear bilevel and mixed 0-1 programming problems
We study links between the linear bilevel and linear mixed 0-1 programming problems. A new reformulation of the linear mixed 0-1 programming problem into a linear bilevel programming one, which does not require the introduction of a large finite constant, is presented. We show that solving a linear...
Gespeichert in:
Veröffentlicht in: | Journal of optimization theory and applications 1997-05, Vol.93 (2), p.273-300 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!