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...

Full description

Bibliographic Details

Published in:	Optimization Vol. 62; no. 1; pp. 33 - 70
Main Author:	Wu, Hsien-Chung
Format:	Journal Article
Language:	English
Published:	Philadelphia Taylor & Francis Group 01.01.2013 Taylor & Francis LLC
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!