EECS 261A Linear Optimization Methods (2015-2016)

EECS 261A Linear Optimization Methods

(Not required for any major.)
Catalog Data:

EECS 261A Linear Optimization Methods (Credit Units: 4) Formulation, solution, and analysis of linear programming and linear network flow problems. Simplex methods, dual ascent methods, interior point algorithms and auction algorithms. Duality theory and sensitivity analysis. Shortest path, max-flow, assignment, and minimum cost flow problems. Graduate students only. (Design units: 0)

Required Textbook:
None
Recommended Textbook:
None
References:
None
Coordinator:
Relationship to Student Outcomes
No student outcomes specified.
Course Learning Outcomes. Students will:
Prerequisites by Topic

Introduction to Linear Algebra (MATH 3A)

Lecture Topics:

None.

Class Schedule:

Meets for 3 hours of lecture each week for 10 weeks.

Computer Usage:
Laboratory Projects:
Professional Component
Design Content Description
Approach:
Lectures:
Laboratory Portion:
Grading Criteria:
Estimated ABET Category Content:

Mathematics and Basic Science: 0.0 credit units

Computing: 0.0 credit units

Engineering Topics: 0.0 credit units

Engineering Science: 0.0 credit units

Engineering Design: 0.0 credit units

Prepared:
August 25, 2014
Senate Approved:
November 10, 2014
Approved Effective:
2015 Fall Qtr