The goal of this course is to teach decision making under uncertainty. The course introduces the nature and basic concepts of stochastic processes first and then teaches the following stochastic modeling techniques: Markov models, queuing models, dynamic programming, and Markov decision processes. The course also aims to familiarize students with the computer tools for solving decision making problems involving such models.
Upon succesful completion of this course, a student will be able to
1. Define stochastic processes, (B1, a2)
2. Formulate an existing stochastic environment by using stochastic processes, Markov chains, or queuing models, (B3, e)
3. Address stochastic dynamic programming models, (B3, e)
4. Propose preferred solution alternatives based on sensitivity and scenario analysis after evaluating the performance of a process, component or system, (B6, e)
5. Apply programming knowledge to solve stochastic decision-making problems, (B3, k)
Winston W. L. (2004), Operations Research (4th edition), Duxbury
Workload | Hrs |
---|---|
Lectures | 42 |
Course Readings | 28 |
Observation | 8 |
Exams/Quizzes | 50 |
Homeworks | 40 |