EC ENGR 236A · EE 236ALinear Programming
Electrical and Computer Engineering · 4 units · Graduate courses (200-299)
Basic graduate course in linear optimization. Geometry of linear programming. Duality. Simplex method. Interior-point methods. Decomposition and large-scale linear programming. Quadratic programming and complementary pivot theory. Engineering applications. Introduction to integer linear programming and computational complexity theory.
Letter grading.
When it runs
- Fall 2025
- Fall 2026
Scheduled, not typical — from UCLA’s Schedule of Classes, which publishes Fall 2025 through Spring 2027 and nothing before it.
Requisites
Official UCLA wording
Requisite: Mathematics 115A or equivalent knowledge of linear algebra.
BruinTree reads · Prerequisite
needs reviewconfidence 0.50 · from text- MATH 115A
- equivalent knowledge of linear algebra
- · could not read "equivalent knowledge of linear algebra" (no course number found)
Requires
Everything that has to come before this course, not just the courses named in the requisite above.
EC ENGR 236A
1 direct requisite. Showing 5 courses over 3 levels; the branches marked with a count carry on past it. Every course here opens its own tree.
Unlocks
What this course is a requisite for, and what those courses lead to in turn.
EC ENGR 236A
- EC ENGR 236BConvex Optimization
- EC ENGR 236COptimization Methods for Large-Scale Systems
- EC ENGR M237Dynamic Programming
- CH ENGR 284AOptimization in Vector Spaces
- MECH&AE M276Dynamic Programming
4 courses list this as a requisite. The whole downstream is here — 8 courses over 2 levels. Every course here opens its own tree.