Spring 2022
INDENG 160 1 - LEC 1
Nonlinear and Discrete Optimization
Javad Lavaei
Class #:31290
Units:3
Instruction Mode:
In-Person Instruction
Offered through
Industrial Engineering and Operations Research
Current Enrollment
Total Open Seats:
63
Enrolled: 57
Waitlisted: 0
Capacity: 120
Waitlist Max: 40
No Reserved Seats
Hours & Workload
6 hours of outside work hours, 2 hours of instructor presentation of course materials, and 1 hours of the exchange of opinions or questions on course material.
Final Exam
TUE, MAY 10TH
03:00 pm - 06:00 pm
Mulford 159
Course Catalog Description
This course introduces unconstrained and constrained optimization with continuous and discrete domains. Convex sets and convex functions; local optimality; KKT conditions; Lagrangian duality; steepest descent and Newton's method. Modeling with integer variables; branch-and-bound method; cutting planes. Models on production/inventory planning, logistics, portfolio optimization, factor modeling, classification with support vector machines.
Rules & Requirements
Repeat Rules
Course is not repeatable for credit.
Reserved Seats
Current Enrollment
No Reserved Seats
Textbooks & Materials
See class syllabus or https://calstudentstore.berkeley.edu/textbooks for the most current information.
Guide to Open, Free, & Affordable Course Materials