Linear Programming

Catalog description

Credits 3. 3 Lecture Hours. Development of the mathematics and algorithms associated with linear programming; convex sets and cones, polyhedral sets, duality theory, sensitivity analysis, simplex, revised simplex and dual simplex methods; also covered are bounded variables, column generation, decomposition, integer programming; computer assignment. Prerequisite: MATH 304 .