Schedule:
Please note that the topic schedule is a guide only, we may spend more or less time on a topic based on student
backgrounds and class discussions. The test and final exam times will occur on the dates listed -- content of the tests
may be altered based on the material covered prior to test date.
Date
September
October
November
Topics
Chapter/Section
9
Introduction to Linear Programming & Graphical Examples
Problem Formulation
1.1-1.2; 3.1-3.3
3.4-3.12
16
LP Software & Spreadsheet Software
Review: Solving Systems of Linear Equations, Rank, Inverse
4.9-4.10, 4.17
2.1-2.6
23
Converting to Standard Form & Basic Feasible Solutions
Algebra of the Simplex Method & Tableau Method
4.1-4.2, 4.4, 4.14
4.5-4.6
30
Revised Simplex Algorithm
Special Cases, Cycling & Degeneracy
Big M Method & Two-Phase Method
10.1
4.3, 4.7-4.8, 4.11
4.12-4.13
7
Test 1
14
Interior Point Method (Karmarkar’s Method)
Multiattribute Decision Making – Goal Programming
4.15, 10.6
4.16
21
Product Form of the Inverse
Sensitivity Analysis
10.2
(5.1-5.4); 6.1-6.4
28
Dual Simplex Method / Duality / Sensitivity Analysis
Duality / Complementary Slackness
6.5, 6.11
6.6-6.10
Duality / Data Envelopment Analysis
Bounded Variables Simplex Algorithm
6.12
(10.5)
11
Transportation Problem / Transshipment Problem
Assignment Problem
(Project Report 1 Due)
7.1-7.4, 7.6
7.5
18
Test 2
Integer Programming Intro / Formulation & Models
Branch & Bound – Pure & Mixed Integer Programs
9.1-9.2
9.3-9.4
Branch & Bound – Knapsack and Combinatorial Problems
Cutting Planes – Pure & Mixed Integer Programs
9.5-9.6
9.8
4
25
Thanksgiving Recess – November 27 – December 1
December
2
Column Generation / Dantzig-Wolfe Decomposition
(Project Report 2 Due)
December
9
FINAL EXAM Period (Monday 7:15 - 9:15 PM)
10.3-10.4
1