MATH 682 - Linear Programming

Institution:

George Mason University

Subject:

Description:

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

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.