• Courses
  • ECE
  • ECE 271A

    • Principles of Optimization . ECE 271A

    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.

    + Add to schedule
    Prerequisites: ECE 210A (may be taken concurrently).

    4

    Units

    Letter

    Grading

    1, 2, 3

    Passtime

    None

    Level Limit

    Engineering

    College
    Instructors
    MOSTOFI Y C
    No info found

    Lecture

    ILP 4107
    M W
    12:00 PM - 13:50 PM
    25 / 30 Closed
    Enrollment Trends
    Past Enrollment Trends (1)
    Spring 2024 . Mostofi Y C
    PHELP2514
    M W
    12:00 PM - 13:50 PM
    Grading Trends (7)
    See All
    ECE 271A Mostofi Y C Spring 2024 Total: 11
    ECE 271A Mostofi Y C Spring 2023 Total: 9
    You Might Also Like
    ECE 254B
    30 / 30 Full
    Advanced Computer Architecture: Parallel Processing
    Behrooz Parhami 2.4
    M W
    10:00 AM - 11:50 AM
    50.9% A
    ECE 256C
    17 / 25 Enrolled
    Advanced VLSI Architecture and Design
    Forrest Brewer 3.2
    T R
    17:00 PM - 18:15 PM
    75.5% A
    ECE 272B
    30 / 30 Full
    Artificial Intelligence in Design and Test Automation
    Li-C Wang 4.3
    M W
    17:00 PM - 18:15 PM
    93.2% A
    ECE 274
    30 / 30 Closed
    Neurally Inspired Computing Systems
    Li P
    M W
    12:00 PM - 13:50 PM
    ECE 277
    30 / 30 Closed
    Pattern Recognition
    Kenneth Rose 4.4
    T R
    10:00 AM - 11:50 AM
    76.4% A
    ECE 295
    5 / 30 Enrolled
    Group Studies: Controls, Dynamical Systems, and Computation
    Andrew Teel 4.3
    F
    14:30 PM - 16:50 PM