IE 311 Mathematical Programming



Instructor: M. C. Pinar
Room: EB 268
Ofiice Hours: Tuesday 3-5 pm.
Course Materials:
Topics to be covered.
 
 
  1.            Solution of Integer Programs by Branch & Bound
  2.            The Dual Simplex Algorithm
  3.            Lagrangean Relaxation and Subgradient Algorithm
  4.            Benders Decomposition
  5.            Gomory Cutting Plane Algorithm
  6.            Revised Simplex Method
  7.            Column Generation and Dantzig-Wolfe Decomposition
  8.            Unconstrained Nonlinear Programming
  9.            Karush-Kuhn-Tucker Optimality Conditions
  10.            Quadratic Programming
  11.            Dynamic Programming


Grading
 
 
  Homeworks    20 %
Quizzes 30% =3 quizzes 10 %each
Midterm 20%
Final 30%
Participation