INDENG162

Download as PDF

INDENG 162 - Linear Programming and Network Flows

Industrial Engineering and Operations Research Undergraduate COE - College of Engineering

Subject

INDENG

Course Number

162

Department

Industrial Engineering and Operations Research

Course Level

Undergraduate

Course Title

Linear Programming and Network Flows

Course Description

This course addresses modeling and algorithms for optimization of linear constrained optimization problems. The simplex method; theorems of duality; complementary slackness. Applications in production planning and resource allocation. Graph and network problems as linear programs with integer solutions. Algorithms for selected network flow problems. Transportation and logistics problems. Dynamic programming and its role in applications to shortest paths, project management and equipment replacement.

Minimum Units

3

Maximum Units

3

Grading Basis

Default Letter Grade; P/NP Option

Method of Assessment

Written Exam

Instructors

Hochbaum

Prerequisites

MATH 53 and MATH 54.

Repeat Rules

Course is not repeatable for credit.

Credit Restriction Courses. Students will receive no credit for this course if following the course(s) have already been completed.

-

Formats

Lecture, Discussion

Term

Fall and Spring

Weeks

15 weeks

Weeks

15

Lecture Hours

2

Lecture Hours Min

2

Lecture Hours Max

2

Discussion Hours

1

Discussion Hours Min

1

Discussion Hours Max

1

Outside Work Hours

6

Outside Work Hours Min

6

Outside Work Hours Max

6