2011-2012 University Catalog 
  
2011-2012 University Catalog

OR 641 - Linear Programming

Credits: 3 (NR)
In-depth look at the theory and methodology of linear programming: Computational enhancements of the revised simplex method; sparse-matrix techniques, bounded variables and the dual simplex method. Alternative interior point methods described and computational complexity of various algorithms analyzed.

Prerequisite(s): OR 541, or permission of instructor.

Hours of Lecture or Seminar per week: 3
Hours of Lab or Studio per week: 0
When Offered: Fall