Spring 2016 Final Exam Review List
3,4: Linear Programming: simplex method (in
tabular form), big-M method. Skip algebraic
- Chapter 10: Dynamics Programming: graphical
method and algebraic-iterative method.
- Chapter 11: Integer Programming: problem
formulation by binary variables; branch-and-bound method.
14: Game Theory: set up finding optimal strategies by linear programming
method. Skip graphical method.
- Chapter 16.1-7: Markov Chain: n-step transition
matrixes, asymptotic steady-state probabilities, expected average cost per
unit time, expected first passage times and expected recurrence times, and
- Chapter 17: Queuing Theory: Basic analysis of
queuing systems, birth-death rate diagram, balance equations, exponential
distribution, Poisson distribution, queuing system parameters in queue
lengths and times, M/M/s model