TI3102

TI3102 OPERATIONAL RESEARCH 2
Credits: 3 Course Coordinator:
Contact hours:

 

Three-hour class session each week Instructor(s): AC, LG
Textbook(s) and other supplemental materials 1.      Hillier, F.S., & G.J. Lieberman, 1991, Introduction to Mathematical Programming, McGraw-Hill, New York.

2.      Taha, H.A, 1997, Operations Research: An Introduction, Prentice-Hall International, Englewood Cliffs.

3.      Bazara, M.S., & J.J. Jarvis, 1990, Linear Programming and Network Flows, John Wiley & Sons, Chichester-England.

4.      Ravindran, A., & D.T. Philip, & J.J. Solberg, 1987, Operations Research, John Wiley & Sons,Chichester-England.

Course information Analisis jaringan; Programa dinamis; Rantai Markov; Teori antrian dan penerapannya; Teori permainan.
Network analysis; Dynamic programming; Markov chain; Queuing theory and its application; Game theory.
Pre-requisite

  • MA2031Calculus III
  • TI2001 Operational Research I
Co-requisite

  • N/A
Required Course
Learning outcomes Mahasiswa mampu menggunakan model-model jaringan dan stokastik dalam memecahkan permasalahan yang terkait dengan disiplin teknik industri.
Students are able to use the network and stochastic models in solving problems related to industrial engineering discipline.
Student Outcomes a b c d e f g h i j k
R R R R R

 Lecture/Lab Topics Covered

Week Topics
1 Dynamic Programming
2 Network Analysis & Spanning Tree Problems
3 Minimum Network Flow
4 Shortest Route Problems
5 Maximum Network Flow
6 Network Project Scheduling
7 Traveling Salesman Problem
8 Midterm
9 Markov Chains : Time-Discrete
10 Markov Chains : Time-Continue
11 Markov Decision Problem
12 Queue Problems
13 Decision Problems
14 Game Theory
16 Assigment Submission & Presentation
15 Midterm Test Final Test