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.
Grading Basis: Graded
Theory of linear programming: convexity, bases, simplex method, dual and integer programming, assignment, transportation, and flow problems. Theory of nonlinear programming: unconstrained local optimization, Lagrange multipliers, Kuhn-Tucker conditions, computational algorithms. Concrete applications.
No classes found.