Abstract
In this article, we discuss a class of continuous-time linear programming (CLP) problems. We provide a discrete approximation procedure to find numerical solutions of CLP, establish the estimation for the error bound and prove that the searched sequence of approximate solution functions weakly star converges to an optimal solution of CLP. Finally, we provide some numerical examples to implement our proposed method and to show the quality of the proposed error bound.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
