Lectures and other readings

Lectures (Readings from the class text unless otherwise indicated)

• Linear Programming
  • Chapters 1, 2, 3.1-3.5, 4.1-4.6, 4.8, 4.9, Appendix A
  • Notes
  • Duality: some notes
  • More on duality
  • Additional notes on duality
  
  
• Lecture 13 [Network Flows: Introduction]
  • Chapter 8
  • Notes (part 1)
  • Notes (part 2)
  
  
• Lecture 14 [Network Flows: formulations, shortest paths and related modelw]
  • Chapter 8: 8.2, 8.3, 8.4
  • Notes
  
  
• Lecture 15 [Network Flows: Maximium flow problem]
  • Chapter 8: 8.3, Appendix C
  • Notes (part 1)
  • Notes (part 2)
  
  
• Lecture 16 [Network Flows: Minimum cost flows]
  • Chapter 8: 8.7, 8.8
  • Notes (part 1)
  • Notes (part 2)
  
  
• Lecture 17 [Network Flows: Minimum cost flows wrap-up]
  • Chapter 8
  
  
• Lecture 18 [Integer Programming: formulations]
  • Chapter 9: 9.1-9.4
  • Notes
  
  
• Lecture 18 [Integer Programming formulations (continued)]
  • Chapter 9: 9.1-9.4
  
  
• Lecture 19 [Integer Programming methods: branch-and-bound, cutting planes]
  • Chapter 9: 9.5, 9.6, 9.8
  
  
• Lecture 20-22 [Dynamic Programming: 2 puzzles; matrix multiplication, knapsack; shortest paths, traveling salesman problem]
  • Chapter 11: 11.1-11.5
  • Notes