MATH 164
Optimization
Description: Lecture, three hours; discussion, one hour. Enforced requisites: courses 115A, 131A. Not open for credit to students with credit for former Electrical Engineering 136. Fundamentals of optimization. Linear programming: basic solutions, simplex method, duality theory. Unconstrained optimization, Newton method for minimization. Nonlinear programming, optimality conditions for constrained problems. Additional topics from linear and nonlinear programming. P/NP or letter grading.
Units: 4.0
Units: 4.0
AD
AD
Most Helpful Review
He is very unorganized in teaching. Doesn't know how to explain things AT ALL. Make easy things a lot harder. Does not even tell you which chapter he is teaching, just ask you to check the homework page number so you know which chapter you are learning. Very hard exams. Unrelated with homeworks. The worst teacher.
He is very unorganized in teaching. Doesn't know how to explain things AT ALL. Make easy things a lot harder. Does not even tell you which chapter he is teaching, just ask you to check the homework page number so you know which chapter you are learning. Very hard exams. Unrelated with homeworks. The worst teacher.