ENGR 510 - Linear Programming and Network Flows

3 Credits

Delivery/Location: Online

Prerequisite

MATH 261 (Calculus for Physical Scientists III) or MATH 315 (Mathematics for Economists). (Credit not allowed for both ENGR 510 and MATH 510)

Description

This course was previously numbered EG 510.

Optimization methods; linear programming, simplex algorithm, duality, sensitivity analysis, minimal cost network flows, transportation problem.

This course can be applied towards the:

Instructors

John Labadie
(970) 491-6898
labadie@engr.colostate.edu

Learn more at: http://www.engr.colostate.edu/~labadie/index.html

Not Currently Offered

This course is usually offered every Fall.

For More Information

Frances Betts
(970) 491-0675
fbetts@learn.colostate.edu

Ask a question about this course