STAT 471 - Linear and Non-Linear Programming

Institution:

University of Illinois at Chicago

Subject:

Description:

Linear programming, simplex algorithm, degeneracy, duality theorem sensitivity analysis, convexity, network simplex methods, assignment problems. Constrained and unconstrained minima. Quasi-Newton methods. Ellipsoidal methods of Kachian. 3 undergraduate hours. 4 graduate hours. Prerequisite(s): Grade of C or better in MATH 310.

Credits:

3.00 - 4.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.uic.edu/index.html/

Phone Number:

(312) 996-7000

Regional Accreditation:

North Central 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.