Instructor:
Prof. Jonathan Spingarn
office hours and telephone

Location and Time

email

Homework

Letters

Students

Textbook

Disclaimer

Test #3 on April 14
You may bring a calculator and a "cheat sheet" consisting of
one page (both sides) containing any information you want

Final Exam on May 3 (Wednesday)
at 11:30-2:20 in IC 215
You may bring a calculator and three pages of notes
(both sides) containing any information you want

covered on first test: February 4
January 7
January 10 (pdf)
January 12 (pdf)
January 14 (pdf)
January 19 (pdf)
January 21 (pdf)
January 24 (pdf)
January 26 (pdf)
January 31 (pdf)
Example showing all basic solutions (pdf)
Some helpful algebra (pdf)
Final tableau solves the dual (pdf)
General duality scheme (pdf)
Proof of Fundamental Theorem (pdf)
covered on second test: March 17
Revised simplex algorithm (pdf)
Cutting stock problem (pdf)
Finding a good starting basis (pdf)
Computing the inverse of the basis (pdf)
Cutting stock with inverse of basis (pdf)
Approximation of Data (pdf)
Problems with upper bounds (pdf)    illustration
Game Theory (pdf)
covered on third test: April 14
Transshipment Problem (pdf)
   Illustrations: A    B    C
Network simplex algorithm (pdf)
König-Egerváry Theorem (pdf)
Dilworth's Theorem (pdf)
Upper-bounded transshipment problem (pdf)
   a feasible upper-bounded transshipment problem
     and its solution
Max flow min cut (pdf)
covered on final exam: May 3
all of the above
Feasible distribution algorithm (pdf)
     example
Max tension min path (pdf)
Min path algorithm (pdf)

Course info