INDENG 162: Linear Programming and Network Flows
Semester Offered: 
Fall & Spring
Units: 
3.00

Formulation to linear programs. Optimal allocation and control problems in industry, environmental studies. Convex sets; properties of optimal solutions. The simplex method; theorems of duality; complementary slackness. Problems of post-optimization. Special structures; network problems. Digital computation.