Strong Duality Theorem for Continuous-Time Linear Programming Problems
Optimization and Control
2014-11-03 v2
Abstract
This paper is aimed to prove the strong duality theorem for continuous-time linear programming problems in which the coefficients are assumed to be piecewise continuous functions. The previous paper proved the strong duality theorem for the case of piecewise continuous functions in which the discontinuities are the left-continuities. In this paper, we propose the completely different type of discretized primal and dual problems that can be used to prove the strong duality theorem for the general situation of discontinuities.
Keywords
Cite
@article{arxiv.1405.2190,
title = {Strong Duality Theorem for Continuous-Time Linear Programming Problems},
author = {Hsien-Chung Wu},
journal= {arXiv preprint arXiv:1405.2190},
year = {2014}
}
Comments
34 pages