ENGR 510 - Linear Programming and Network Flows

3 Credits / Fall 2008

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

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

This course can be applied towards the:

Textbooks and Materials

Unless otherwise indicated, textbooks and materials are required and can be purchased at the CSU Bookstore.

  1. Linear Programming, Foundations and Extensions, 3rd Ed.
    Robert Vanderbei
    ISBN: 0387743871

Instructors

Michael Kirby
(970) 491-6850
Kirby@math.colostate.edu

Learn more at: http://www.math.colostate.edu/~kirby

No Sections Available
This course is usually offered every Fall.

Section 801 (Online via RamCT)
Date: Aug. 25 - Dec. 12, 2008 (16 wks.)
Instructors: Michael Kirby
Grading:Traditional
Tuition: $1,560
SECTION CLOSED

For More Information

Michele Sterling
(970) 491-2520
msterling@learn.colostate.edu

Ask a question about this course