OR 641 - Linear Programming

Institution:

George Mason University

Subject:

Description:

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

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.gmu.edu

Phone Number:

(703) 993-1000

Regional Accreditation:

Southern Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.