Polynomial Approximations for Continuous Linear Programs

Continuous linear programs have attracted considerable interest due to their potential for modeling manufacturing, scheduling, and routing problems. While efficient simplex-type algorithms have been developed for separated continuous linear programs, crude time discretization remains the method of c...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on optimization Jg. 22; H. 2; S. 628 - 648
Hauptverfasser:	Bampou, Dimitra, Kuhn, Daniel
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia Society for Industrial and Applied Mathematics 01.01.2012
Schlagworte:	Algorithms Approximation Linear programming Optimization Polynomials
ISSN:	1052-6234, 1095-7189
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!