Principles of Optimization: Convex Optimization

Linear programming: simplex and revised simplex method, duality theory, primal-dual algorithms, Karmarkar's algorithm. Network flow problems: max-flow/min-cut theorem, Ford-Fulkerson algorithm, shortest path algorithms. Complexity and NP-completeness theory: the classes of P and NP, reductions between NP-complete problems, pseudopolynomial and approximation algorithms.

Quarters Scheduled: 

2006b Spring,2008d Fall,2011b Spring,2014b Spring,2015b Spring

Units: 

4

Prerequisites: 

none

Course Number: 

ECE271A