2010-2011 University Catalog 
  
2010-2011 University Catalog

OR 641 - Linear Programming

Credits: 3
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.

Prerequisites
OR 541, or permission of instructor.

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