Math 461-3M
Linear Programming
Catalog Description: (Prerequisite: Math 360) Geometry of linear programming; matrix notations; extreme
point theorem; basic solutions; the simplex method; slack, excess, and artificial variables; duality; sensitivity
analysis; integer programming with aapplications. (3 credit hours)
Fall 2001 Syllabus
Email me at brian.heck@nicholls.edu anytime.