Linear and Discrete Optimization

3 credits

A course in the theory and techniques of linear programming; convexity and extreme points of polyhedral sets, the simplex method, duality and selected applications will be covered. ***Prerequisite: MATH 122, MATH 221, and one of CS 110, CS 165 or STAT 165; or permission of Department Head.***