EC ENGR 236A

Linear Programming

Description: Lecture, four hours; discussion, one hour; outside study, seven hours. Requisite: Mathematics 115A or equivalent knowledge of linear algebra. 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.

Units: 4.0
1 of 1
1 of 1

Adblock Detected

Bruinwalk is an entirely Daily Bruin-run service brought to you for free. We hate annoying ads just as much as you do, but they help keep our lights on. We promise to keep our ads as relevant for you as possible, so please consider disabling your ad-blocking software while using this site.

Thank you for supporting us!