CSCI 8306
Operations Research I

Basic concepts and linear programming including convex sets, hyperplanes, polytopes, mathematical modeling, formulation and geometry of linear programming, primal simplex method, dual simplex method, revised simplex method, sensitivity analysis and problem solving using computer packages.

Credit

3 semester hours

Prerequisites

MATH 2050. Not open to nondegree students.

Cross-listed as

CSCI-4300, MATH-4300, MATH-8306, MATH-8306