Catalogue 2012 - 2013

MATH 369 Linear Programming

Credits

3 cr.

Prerequisite

MATH 251 or MATH 282 or permission.

Course Description

A linear program (LP) calls for the optimization of a linear function subject to linear inequality constraints. This course studies the theory and applications of LPs. Topics include modeling using LPs, polyhedra, the simplex method, duality, parametric and sensitivity analysis, LP software, and applications to game theory, network flows, and statistics. Students will also read and report on recent journal articles describing applications of linear programming to the solution of real-world problems.

Offered

on demand.