Operations Research II
Course Code
TI3102
Number of Credits
3
Semester
5
Course Type
C
Related Courses
| No | Code | Course | Relation |
|---|---|---|---|
| 1 | TI3102 | Operations Research II | Equivalent |
Study Material
| Study Material | Depth |
|---|---|
| Dynamic programming methods | |
| Network Concept and Minimum Swimming Tree Problem | Express |
| Minimum cost capacity flow problem | |
| Shortest path and maximum flow problems | |
| Travelling Salesman Problem | |
| Discrete-time and continuous-time Markov chains | |
| Markov decision problem | |
| Queue problem | Express |
| Decision Problem | Express |
| Game issues | Express |
| Express |
Graduate Learning Outcomes (GLO) carried by the course
| CPMK Code | Course Learning Outcomes Elements (CLO) |
|---|---|
| CPMK 1 | Students are able to understand the characteristics of operational research problems 2 that are solved and the methods for solving them. |
| CPMK 2 | Students are able to apply operational research problem solving methods 2 to simple case examples. |
| CPMK 3 | Students are able to define simple real operational research problems and are able to solve and interpret the results. |
Learning Method
- Lecture, Discussion, Case Study
Learning Modality
- Synchronous, Asynchronous
Assessment Methods
- Mid-term Test, Final Test, Assignments