About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
INFORMS 2022
Conference paper
Symmetric Strong Duality In Continuous-time Linear Programming
Abstract
Continuous-time linear programs (CLP) were formulated by Bellman in 1953. Duality theory for CLP and its sub-classes has been studied by several authors. However, duality results for Bellman CLP problems obtained so far are still fairly limiting. We consider a generalization of CLP where solutions reside in the space of functions of bounded variation. We formulate a symmetric dual problem and show that under Slater-type conditions both primal and dual problems possess optimal solutions and there is no duality gap.