ECE271A

Download as PDF

ECE 271A - Principles of Optimization

Electrical and Computer Engineering College of Engineering

Full Course Title

Principles of Optimization

Course Description

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 approximationalgorithms.

Units Fixed

Unit Value

Maximum number of times course can be repeated for additional credit

Maximum Units

Prerequisites

ECE 210A (may be taken concurrently).