The Equivalence of Strong and Weak Formulations for Certain Problems in Optimal Control

Authors:
  • RVRichard B. Vinter
    Richard B. Vinter
  • RLRichard M. Lewis
    Richard M. Lewis

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