Linear Programming and Operations Research
Overview
Subject area
CMP
Catalog Number
747
Course Title
Linear Programming and Operations Research
Department(s)
Description
Theory and application of linear techniques. Convex sets and polyhedrons. The simplex method and the revised simplex method. Procedures to handle degeneracy. Duality theory and the dual simplex method. Elements of inventory and queueing theory. Industrial applications in scheduling and production control. Khachian's algorithm.
Typically Offered
Fall, Spring
Academic Career
Graduate
Liberal Arts
Yes
Credits
Minimum Units
4
Maximum Units
4
Academic Progress Units
4
Repeat For Credit
No
Components
Name
Lecture
Hours
4