Review of linear programming. Polynomial time methods for linear programming. Quadratic programs and linear complementarity problems and related solution techniques. Solution sets and their continuity properties. Error bounds for linear inequalities and programs. Parallel algorithms for linear and quadratic programs. (Infrequently offered.) Prereq: CS 525 or equivalent, CS 302 or equivalent, or consent of instructor.