EECS 6118
Optimization
Lecture Slides
(these are power point files)


[Slide   1]    Introduction 
[Slide   2]    Lagrange:  equality constrained optimization 
[Slide   3]    Convexity:  convex sets, convex functions, convex optimization 
[Slide   4]    Duality: Lagrangian duality for general mathematical optimization 
[Slide   5]    Dantzig: Simplex Algorithm for linear programming
[Slide   6]    Khachian: Ellipsoid Algorithm for linear and convex optimization 
[Slide   7]    Karmarkar:  Interior Point Methods for linear and convex optimization 
[Slide   8]    Primal-Dual Simplex: algorithm and applications
[Slide   9]    Efficient network flow and matching algorithms
[Slide 10]    Integer Linear Programming