This is the authors' abstract. We don't add key points for this paper.
It is shown that a wide class of control problems may be cast equivalently as convex mathematical programming problems over a space of Radon measures. The particularly simple structure of the equivalent problems will enable us to obtain new conditions for optimality, of dynamic programming type, by application of convex analysis. These implications are pursued in a companion paper.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Vinter et al. (1978) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: