Solving Bilevel Linear Programs Using Multiple Objective Linear Programming

We present an algorithm for solving bilevel linear programs that uses simplex pivots on an expanded tableau. The algorithm uses the relationship between multiple objective linear programs and bilevel linear programs along with results for minimizing a linear objective over the efficient set for a mu...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of optimization theory and applications 2009-02, Vol.140 (2), p.197-212
Hauptverfasser:	Glackin, J., Ecker, J. G., Kupferschmid, M.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applications of Mathematics Applied sciences Calculus of Variations and Optimal Control Optimization Engineering Exact sciences and technology Linear programming Mathematical analysis Mathematical models Mathematical programming Mathematics Mathematics and Statistics Multiple objective Operational research and scientific management Operational research. Management science Operations Research/Decision Theory Optimization Pivots Problem solving Programming Studies Theory of Computation Variables
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!