2024 Fall
INDENG 160 001 - LEC 001
Nonlinear and Discrete Optimization
Javad Lavaei
Class #:28671
Units: 3
Instruction Mode:
In-Person Instruction
Time Conflict Enrollment Allowed
Offered through
Industrial Engineering and Operations Research
Current Enrollment
Total Open Seats:
1
Enrolled: 66
Waitlisted: 0
Capacity: 67
Waitlist Max: 5
Open Reserved Seats:
5 reserved for Industrial Engineering & Operations Research Majors with 3 or more Terms in Attendance
Hours & Workload
6 hours of outside work hours per week, 2 hours of instructor presentation of course materials per week, and 1 hours of the exchange of opinions or questions on course material per week.
Final Exam
MON, DECEMBER 16TH
11:30 am - 02:30 pm
Etcheverry 3106
Etcheverry 3108
Other classes by Javad Lavaei
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
Open Reserved Seats:
5 reserved for Industrial Engineering & Operations Research Majors with 3 or more Terms in Attendance
Textbooks & Materials
See class syllabus or https://calstudentstore.berkeley.edu/textbooks for the most current information.
Guide to Open, Free, & Affordable Course Materials