Skip to content

Under construction: the website and the course material are still being written

Website under construction. Some parts, such as the background on the KKT conditions, will be completed together with the Convex Optimization course.

NLP Modelling

A course of the Operations Research and Mathematics series · all the courses

Teaching material designed and developed by Fabio Furini, associate professor at DIAG, Sapienza University of Rome.

Nonlinear programming models — the online version of the course lecture notes, with Python/Gurobi code and reproducible case studies.

Prerequisites: LP Modelling and Convex Optimization.

Start Exercises Lab Quiz Downloads

Try it now

Three nonlinear models of the course solved to optimality in the browser: the Markowitz portfolio, the optimal price with capacity and the location of a service. Choose the model at the top right, change the required return or the other data with the sliders and watch the optimal solution being recomputed, with its position on the efficient frontier.

More apps in the lab

The parts of the course

  • Tools


    Convexity, quadratic programming and KKT conditions; the solver commands for nonlinear models and the multipliers of QPs.

    The chapters

  • Deterministic models


    Production with smoothing, supply chain, portfolio, prices, budget, location, electric vehicle charging, queues: all the data are known.

    The eight problems

  • Optimization and machine learning


    The SVM and least squares as convex QPs: margin, dual, support vectors, normal equations — with no ML libraries.

    The two problems

Don't miss

  • Exercises


    Modelling exercises for every chapter, at exam level, on the case studies of the course.

    The exercises

  • Self-assessment quiz


    A new mock exam at every start: 13 questions, 33 points, with the solution and the link to the notes. Downloads also has the full question bank.

    Test yourself

  • Interactive lab


    Apps running in the browser: move the parameters and watch the ideas of the course at work, one step at a time.

    The lab

  • Lecture notes in PDF


    Lecture notes, exercise books and slides in PDF, with the same numbering as the website.

    Downloads

  • Notebooks in Colab


    The code of the course running in the browser, with nothing to install.

    The notebooks

  • Full index


    All the chapters with their sections on one page, and how each chapter is organized.

    The index


The series

All the courses of the series are built the same way: lecture notes online and in PDF, exercises with solutions, an interactive lab and self-assessment quizzes.

  • Mathematical Analysis 1

    real numbers, functions, limits, derivatives and series, with interactive graphs

  • Linear Algebra

    vectors, matrices, determinants, linear systems and eigenvalues, with the computation lab

  • Algorithms

    number representation, pseudo-code, sorting and searching, analysis and recursive algorithms

  • Linear Programming

    polyhedra, the simplex algorithm, duality and the dual simplex, with the interactive lab

  • Integer Linear Programming

    LP relaxation, valid inequalities, cutting planes, branch-and-bound and branch-and-cut

  • Convex Optimization

    convex sets and functions, convex optimization problems, with interactive graphs

  • Network Optimization

    graphs, spanning trees, shortest paths, network flows, the network simplex and project management

  • Combinatorial Optimization Problems

    knapsack, bin packing, coloring, TSP, scheduling and lot sizing: the problems, their formulations and ad hoc algorithms

  • Dynamic Programming

    principles and DP algorithms for knapsack, lot sizing, coin change and rod cutting

  • Heuristic Algorithms

    constructive heuristics, local search, metaheuristics and MIP heuristics for combinatorial optimization problems

  • Approximation Algorithms

    performance guarantees, approximation schemes and limits of approximation for combinatorial problems

  • LP Modelling

    linear programming models of managerial problems, solved with Python and Gurobi

  • NLP Modelling · this course

    nonlinear programming models, from portfolios to machine learning, with Python and Gurobi

  • MIP Modelling

    integer linear programming models, from the formulation to the solution with solvers


Teaching material by Fabio Furini — DIAG, Sapienza University of Rome.