EE 60551 - Mathematical Programming

Institution:

University of Notre Dame

Subject:

Electrical Engineering

Description:

Theory of constrained optimization complemented by comprehensive computing exercises. Linear programming and convexity. Simplex algorithm. Optimality conditions for nonlinear optimization. Convergence of algorithms. Interior point methods in linear programming. (Alternate spring)

Credits:

3.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.nd.edu

Phone Number:

(574) 631-5000

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.