3 Credits (3 Contact Hours)Theory and methodology of dynamic programming; Bellman’s principle of optimality; Mitten’s sufficiency conditions; recursive optimization of serial and nonserial multistage systems; optimization of discrete and continuous systems through decomposition; special aspects of problem formulation. Preq: IE 8030.
