Skip to content

Syllabus

Every chapter starts from a concrete management problem — how much risk to accept, which price to set, where to locate a service, how smooth a plan should be — turns it into a nonlinear model, solves it with Gurobi called from Python and questions it: how much is one more unit of a resource worth? how much does a smoother plan cost?

Every model can be run right away in the browser: each chapter has its notebook that opens in Colab, with nothing to install. Prerequisites: LP Modelling and Convex Optimization.

The full list of chapters, in the order in which they are covered.

Tools

  1. Introduction to the course — this page and the home page
  2. Theory: nonlinear optimization — convexity, QP, KKT
  3. Solver: nonlinear models — functional and bilinear constraints, multipliers

Deterministic models

  1. Production with quadratic smoothing — convex QP
  2. Supply chain with congestion and CO₂ — convex NLP
  3. Markowitz portfolio — convex QP
  4. Pricing and revenue management — NLP
  5. Advertising budget — convex NLP
  6. Continuous location — convex NLP
  7. EV charging with a smooth profile — convex QP
  8. Queues and service capacity — convex NLP

Optimization and machine learning

  1. Support Vector Machine — convex QP
  2. Least-squares regression — convex QP

The course

  1. Organization of the course — sessions and mistakes to avoid