The following directory lists the graduate courses which the University expects to offer, although the University in no way guarantees that all such courses will be offered in any given academic year, and reserves the right to alter the list if conditions warrant. Click on the links below for a list of courses in that subject area. You may then click “View Classes” to see scheduled classes for individual courses.
6108. Linear Programming and Network Flows
3.00 credits
Prerequisites: ECE 5101.
Grading Basis: Graded
Computational methods for linear programming with special emphasis on sequential and parallel algorithms for Network Flow Problems. Standard and canonical forms of linear programming, revised Simplex methods, basis updates, decomposition methods, duality, shortest paths, minimal spanning trees, maximum flows, assignment problems, minimum cost network flows, and transportation problems.
No classes found.