Subject: Subject Sylbus: Dynamic Programming - 097332

Dynamic Programming - 097332
Will not be given the year
Credit
Points
2.5
 
  Lecture Exercise Laboratory Project or
Seminar
House
Work
Weekly
Hours
2 1      

Determination of the grade according to progress during the semester and a final examination.


Prerequisites: Deterministic Models in Oper.Research 094313
 
Identical Courses: Dynamic Programming 098332


Bellman'S Principle. Necessary Conditions for Optimality. Computational Aspects. Methods of Successive Approximation and Policy Iterations. Markovian Decision Processes. the Maximum Principle of Pontryagin. Reduction in Dimensionality by Use of Lagrange Multipliers. Variable Stage Stochastic Problems. Dynamic Programming Techniques in Solving: Transportation, Inventory, Reliability, Equipment Replacement and Maintenance Problems.


Created in 08/03/2021 Time 14:59:12