MATH 305 - Linear Programming

Prerequisites/Corequisites: Take MATH-304 MATH-213 or CS-226. (Required, Previous).
Credit Hours: Min: 3; Max:

Description: Introduction to the theoretical, computational, and applied aspects of the subject. Topics covered include the Mathematical model of linear programming, convex sets and linear inequalities, the simplex method, duality, the revised simplex method, and several of the many applications. Computer solutions for several problems will be required.