Condizioni di convessità nella programmazione dinamica
The convexity of return functions in dynamic programming implies the possibility of employing standard procedures of convex programming for the searches of minima of functions which are performed at every stage of the computational procedure. In the present work by means of a geometric approach are derived necessary and sufficient conditions for the convexity of return functions in dynamic optimization problems with bounded states and controls and in presence of isoperimetric constraints.