2009-2010 University Catalog 
  
2009-2010 University Catalog

MATH 682 - Linear Programming

Credits: 3
Cross-Listed with OR 641

Takes in-depth look at simplex method. Includes computational enhancements such as revised simplex method, sparse-matrix techniques, bounded variables and generalized upper bounds, and large-scale decomposition methods. Also includes computational complexity of simplex algorithm, and Khachian and Karmarkar algorithms.

Prerequisites
OR 541, or permission of instructor.

Hours of Lecture or Seminar per week
3
Hours of Lab or Studio per week
0