Abstract
Abstract : The theory of programming under uncertainty is extended to the case when the decision variables are elements of a Banach space. This approach leads to a very natural application of the computational techniques of mathematical programming to stochastic optimal control problems. It is shown that there exists an equivalent deterministic mathematical program whose set of feasible solutions is a convex set and whose objective function can be expressed as a convex function of the initial decision variables. In the second part, a duality theory is developed for this class of problems and some of the relations to the maximum principle for stochastic linear control problems are given.
Sign-in/Register to access full text options 
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 call
