Course description

Formulation of linear programming problems and solutions by the simplex method. Related topics such as sensitivity analysis, duality, and network programming. Applications include such models as resource allocation and production planning. Introduction to interior-point methods for linear programming.

Prerequisites

MATH 2210 or 2940.

No upcoming classes were found.

Previously offered classes

The next offering of this course is undetermined at this time.