OPRS3111 Course Outline


Check with your instructor for the grading scheme, test and exam schedules.

 

Suggested textbook:


OPERATIONS RESEARCH, Applications and Algorithms (4th Edition) by Wayne Winston


Lecture

Lecture Topic
1 Introduction, Examples of mathematical programs
 
2 Formulation of LP, Solving 2-d LPs graphically, extreme points,
3 feasible and infeasible LPs, bounded and unbounded LPs
4 Examples and modeling
5 Standard form, basic and non-basic variables, basic feasible solutions
 
6 Simplex algorithm
7 Test 1 Review
8 Test 1
9 Using the Simplex algorithm to solve Minimization problems
10 alternative optimal solutions, unbounded LPs, computer packages
11 degeneracy and convergence
12 Big M Method,
13 Two-Phase simplex method. More LP examples.
14 Unrestricted in sign variables and Multiperiod LP examples.
15 Introduction to Sensitivity Analysis
16 Important formulas for computing an optimal basis
17 Test 2
18 Sensitivity analysis
19 Finding the dual and the economic interpretation
20 The Dual Theorem and its consequences
21 Shadow prices and complimentary slackness
22 The Dual Theorem and its consequences
23 Transportation Problems.
24 Transportation simplex.
25 Assignment problem and Hungarian Method.
26 Integer Programming, IP, IP Models
27 Test 3
28 Branch and Bound method
29 Catching up
30

Final Exam Review

Final Exam