ENGR 510 - Linear Programming and Network Flows

Prerequisite

MATH 261 (Calculus for Physical Scientists III) or MATH 315 (Mathematics for Economists).

Description

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

This course can be applied towards the:

• Civil Engineering (M.E.)
• Engineering Management (M.E.)
• Engineering Management (M.S.)
• Industrial Engineering and Operations Research (M.E.)
• Industrial Engineering and Operations Research (M.S.)
• Systems Engineering (M.E.)

Textbooks and Materials

Textbooks and materials can be purchased at the CSU Bookstore unless otherwise indicated.

Required

• Linear and Nonlinear Programming (1996)
  S. G. Nash and A. Sofer
  ISBN: 0-07-046065-5

Instructors

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

Professor John Labadie is currently Coordinator for the Water Resources Planning and Management Division of the Department of Civil Engineering. Dr. Labadie specializes in application of decision support systems, mathematical programming, knowledge-based systems, and geographic information systems to complex problems in water resources and environmental management.

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