The pre-requisites listed in this catalog are those approved by the Curriculum Committee.
For pre-requisite information specific to an individual instance of a course, please see the schedule of classes. Click the Schedule Type to find available offerings of the course on the Schedule of Classes. |
ISYE 6661 - Linear Optimization |
Theory, algorithms, and applications of linear programming. Topics include the simplex method and resolution of degeneracy, duality and sensitivity analysis, basis factorization, the dual and revised simplex methods, and geometry of polyhedra. Intended for Ph.D. students.
3.000 Credit hours 3.000 Lecture hours Grade Basis: ALP All Sections for this Course Sch/Industrial & Systems Engr Department |