Course ObjectiveAfter completing this course, the student can
1. understand the applicability and the limitations of discrete- and
continuous-time Markov decision processes
2. can model real-world decision problems into the Markov decision
3. can implement decision models to calculate the optimal decision rules
4. can mathematically prove properties of the optimal decision rules in
5. can deal with modeling and implementation issues related to the curse
6. can model problems with partial observations
Course ContentThis course deals with the theory and algorithms for stochastic
optimization with an application to controlled stochastic systems (e.g.,
call center management, inventory control, optimal design of
communication networks). We discuss aspects of semi-Markov decision
theory and their applications in certain queueing systems and also
discuss parts of the related field reinforcement learning. In
programming assignments, students learn to implement optimization
algorithms and experiment with them. Programming is done in R.
Method of AssessmentProgramming exercises, final exam.
The weighted average needs to be 5.5 or higher.
Entry RequirementsProgramming experience
LiteratureLecture notes will be posted on Canvas.
Target AudiencemBA, mBa-D, mMath, mSFM.
Recommended background knowledgeStochastic Modeling (X_400646) or equivalent courses on Stochastic
Processes and Queueing Theory.
|Language of Tuition||English|
|Faculty||Faculty of Science|
|Course Coordinator||prof. dr. G.M. Koole|
|Examiner||prof. dr. G.M. Koole|
prof. dr. G.M. Koole
You need to register for this course yourself
Last-minute registration is available for this course.
This course is also available as: