100% Plagiarism-Free
+1-727-416-5453

Sign In

Access your dashboard and order activity.

Forgot password?

Create Account

Register to place orders and track every step.

INDENG 160

Nonlinear and Discrete Optimization

University of California, Berkeley 3 credits Industrial Engineering and Operations Research

Course 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.

Code
INDENG 160
Credits
3
Subject
Industrial Engineering and Operations Research

Programs That Include This Course

Get expert help with INDENG 160 Nonlinear and Discrete Optimization

Our subject experts help with essays, research papers, case studies, discussion posts, and capstone projects for these programs β€” written from scratch to your course requirements.

Get Help Now

Program and course information is reproduced from each university's published academic catalog for informational purposes and may change. Always confirm current requirements with your university. We are an independent academic support service and are not affiliated with or endorsed by the universities listed.

Academic Resources

Latest from the Blog

Expert guides on essay writing, citation styles, study skills, and academic success.

View All Articles