Interactive lab
The models of the course solved to optimality in the browser: change the data with the sliders or by dragging the points, and a simplex method written in JavaScript recomputes the solution, with the same numbers as the Python scripts and the lecture notes. Pick an app: it opens full page.
Models side by side
-
Three LP models solved to optimality
Production and inventory, electric vehicle charging and the scenario newsvendor: pick the model, change the data with the sliders and the simplex method, in the browser, recomputes the optimal solution and the shadow prices.
Deterministic models
-
Production plan and shadow prices
The optimal six-month plan with the inventory: change demand, capacity and holding cost and see which months saturate the machine hours and what one more hour is worth.
-
Minimum-cost overnight charging
Six vans to charge overnight: charging follows the cheap hours as far as the meter limit allows. Change the limit and the energy needed and see the profile, the cost and the shadow prices.
-
DEA: efficiency and peers of a branch
Pick one of the 12 branches: the envelopment LP gives the efficiency θ, the peers on the frontier with their weights λ and the input targets, with constant (CCR) or variable (BCC) returns to scale.
Decisions under uncertainty
-
Newsvendor: optimal order over 600 scenarios
The expected cost and the CVaR of the cost as functions of the order quantity, over the demand scenarios of the chapter: move the price and the risk aversion and watch the optimal order move.
Optimization and machine learning
-
Least absolute deviations and quantile regression
The 60 days of the bakery: drag the points and see the least absolute deviations line (LP) and the τ-quantile line, with the support points and how many days stay below the line.