ECE 271A: PRIN OF OPTIMIZAT
University of California, Santa Barbara
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.
Average GPA: 3.88
Grade distribution records: 103 students across 8 terms.
Grade distribution
| Grade | Students | Percent |
|---|---|---|
| A | 86 | 83.5% |
| A- | 10 | 9.7% |
| B+ | 2 | 1.9% |
| B | 3 | 2.9% |
| B- | 1 | 1.0% |
| F | 1 | 1.0% |
Based on 103 student grade records across 8 terms and 1 professor.
Instructors
- Mostofi Y C 103 students, Average GPA 3.88