Continuous-time linear programming problems revisited: A perturbation approach

The class of continuous-time linear programming problems under the assumption that the constraints are satisfied almost everywhere in the time interval [0, T] is taken into account in this article. Under this assumption, its corresponding discretized problems cannot be formulated by equally dividing...

Celý popis

Podrobná bibliografia

Vydané v:	Optimization Ročník 62; číslo 1; s. 33 - 70
Hlavný autor:	Wu, Hsien-Chung
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Philadelphia Taylor & Francis Group 01.01.2013 Taylor & Francis LLC
Predmet:	continuous-time linear programming problems discretized problems Duality theorem Intervals Linear programming Mathematical problems Optimization Perturbation methods perturbed optimization problems Simplex method strong duality theorem Studies Theorems Time weak duality theorem
ISSN:	0233-1934, 1029-4945
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!