17.419.4 
 Introduction (Chapter 1: 1.11.4)
 Introduction to Linear Progamming and examples
 Graphical representation and solution

24.426.4
  Basics of LP (Chapter 2: 2.12.4)
 Geomtery of Linear Programming
 Extreme solutions, vertices, basic feasible solutions
 Degeneracy

1.510.5
  The simplex method (Chapter 3: 3.13.5)
 The method and its implementation
 Anticycling rules
 Finding an initial BFS

15.517.5
  Duality Theory (Chapter 4: 4.14.3)
 The dual problem and duality Theorem
 The dualsimplex method

22.5
  The network flow problem (chapter 7: 7.17.2)

24.5
 
29.57.6
  Network flow problems (Chapter 7: 7.17.5, 7.8)
 The network simplex algorithm
 The minimum cost cycle algorithm
 The maximum flow problem

12.614.6
  Integer programming (Chapters 10, 11: 11.111.2)
 Integer programming formulations
 Cutting plane methods
 Branch and bound

21.628.6
  The Ellipsoid method (Chapter 8)
 The Ellipsoid algorithm
 Problems with exponentially many constraints

3.710.7
  Interior point methods (Chapter 9: 9.19.2)
 The affine scaling algorithm
 Karmarkar's algorithm

12.7
  Advanced topics (TBA but can be a subset of the following)
 Total unimodularity and its applications in Combinatroial Optimization (Chapter 7)
 Approximation algorithms (Chapter 11: 11.5)

17.7
  Some Exercises (including Bimatrix games)

19.7
 
25.9
  Makeup Exam
WWW page maintained by
Khaled Elbassioni,
last updated on
Monday, 18 June 2007
