Spring 2024
INDENG 160 102 - DIS 102
Nonlinear and Discrete Optimization
Jihun Kim
Class #:16407
Units: 3
Instruction Mode:
In-Person Instruction
Time Conflict Enrollment Allowed
Offered through
Industrial Engineering and Operations Research
Current Enrollment
Total Open Seats:
0
Enrolled: 42
Waitlisted: 0
Capacity: 42
Waitlist Max: 0
No Reserved Seats
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.
Other classes by Jihun Kim
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