Text:“Elementary Linear Programming with Applications”
Bernard Kolman and Robert E. Beck
Final Exam: Wednesday, May 12,
Office Hours
This week: T,W,Th,F,
Next week: M,T,
Review
Problems for the Final Exam
Solutions to
Review Problems Part1
Solutions to
Review Problems Part2
Material covered in class and
homework assigned
Monday, May 03
Review
Thursday, April 29
The Maximal Flow Problem (section 5.4, cont.)
The Shortest Path Problem (section 5.5)
Dijkstra’s
Algorithm and Example
Homework Assignment (due on or before Wednesday,
May 12)
problem 6 (5.4) [find the maximal flow and the minimal capacity cut]
problem 4 (5.5) [find the shortest paths
between node 1 and any other node in the graph]
Monday, April 26
The Maximal Flow Problem (section 5.4)
Thursday, April 22
The assignment problem (section 5.2, cont.)
Graphs and Networks: definitions (section 5.3)
Monday, April 19
The Assignment
Problem (section 5.2)
Homework Assignment
(Due Thursday, April 29)
Thursday, April 15
Second Midterm Exam
Review
Problems for the second midterm exam
Solutions
to Review Problems (Part I)
Solutions
to Review Problems (part 2)
Monday, April 12
The Transportation Problem (section 5.1, cont.)
Thursday, April 8
The Transportation Problem (section 5.1, cont.)
Monday, April 5
Cutting Plane Methods (section 4.2, pages 262-268 only)
Thursday, April 1
Examples of Integer Programming Problems (section 4.1)
Monday, March 29
The Dual Simplex Method (section 3.4, cont.)
The Revised Simplex Method (section 3.5)
Homework Assignment, due Monday, April 12
Thursday, March 25,
Computational relations between the Primal and Dual problems (section 3.3, cont.)
The Dual Simplex Method (section 3.4)
I will assign a new homework on Monday
Monday, March 22
Computational relations between the Primal and Dual problems (section 3.3, cont.)
Thursday, March 11
The Duality Theorem (section 3.2 cont.)
Homework Assignment
(due Thursday, March 25)
Monday, March 8
The Duality Theorem (section 3.2 cont., up to Complementary Slackness)
Thursday, March 4
The Duality Theorem (first part of section 3.2, everything up to the Weak Duality Theorem)
Monday, March 1
Duality (section 3.1)
Homework Assignment (due Monday, March 8)
Friday, February 26
Midterm Exam
Solutions
to the review problems
Monday, February 23
Artificial Variables (section 2.3, the Two-Phase method only)
Thursday, February 19:
The Simplex Method for Problems in Standard Form (section 2.1)
Monday, February 16:
The Simplex Method for Problems in Standard Form (section 2.1, everything up to "Forming a New Tableau" part on p. 111)
Thursday, February 12:
Basic Solution (cont. section 1.5)
Homework Assignment
(Due Thursday, February 26)
Monday, February 9:
Basic solutions (section 1.5)
Thursday, February 5:
The Extreme Point Theorem (cont. section 1.4)
Monday,
February 2:
Geometry of Linear Programming Problems (section
1.3)
The Extreme Point Theorem (section 1.4)
Thursday,
January 29:
Geometry of Linear Programming Problems (section 1.3)
Homework assigned: problems 2,4,14, 34 in section 1.3 (due Thursday, Febryary5) Solutions
Monday,
January 26:
Matrix notation (section 1.2)
Thursday,
January 22:
The Linear
Programming Problem (section 1.1)
Homework assigned: problems 2,4,8,11 in section 1.1 (due Thursday, January 29) Solutions