EdusalsaDiscover Your Stanford

MS&E 351

Dynamic Programming and Stochastic Control

  • Not Offered

3 units

Letter or Credit/No Credit

Markov population decision chains in discrete and continuous time. Risk posture. Present value and Cesaro overtaking optimality. Optimal stopping. Successive approximation, policy improvement, and linear programming methods. Team decisions and stochastic programs; quadratic costs and certainty equivalents. Maximum principle. Controlled diffusions. Examples from inventory, overbooking, options, investment, queues, reliability, quality, capacity, transportation. MATLAB. Prerequisites: MATH 113, 115; Markov chains; linear programming.

Course Prequisites

Sign Up

To save MS&E 351 to your course bucketlist

Already Have An Account? Log In