βˆ‡ProvenDecisions
Ctrl K

Solved optimization examples, checked by a solver

Classic optimization problems, each solved by a real solver and checked, with the model, a note on every line, the walkthrough and the code. Open one, change the numbers and solve your own. πŸŽ™οΈπŸ“·: with a spoken clip and a photo.

To solve your own straight away: the free calculators (linear, integer, knapsack, transportation, assignment, LP dual and quadratic programming).

Linear programming examples

  1. Product mix problem πŸŽ™οΈπŸ“·
  2. Diet problem πŸŽ™οΈπŸ“·
  3. Transportation problem πŸŽ™οΈπŸ“·
  4. Maximum flow problem
  5. Shortest path as a linear program
  6. Minimum-cost network flow
  7. Blending problem
  8. Multi-period production and inventory planning
  9. Two-stage supply chain
  10. Shadow prices of a production plan
  11. Dual of the diet problem
  12. Dual of a transportation problem
  13. LP dual with equality constraints
  14. Least absolute deviations regression
  15. Minimax (Chebyshev) line fit
  16. Mean-absolute-deviation portfolio
  17. CVaR (worst-case loss) portfolio
  18. Cash-flow matching with bonds
  19. Largest circle inside a polygon

Integer programming examples

  1. Assignment problem πŸŽ™οΈπŸ“·
  2. 0-1 knapsack problem πŸŽ™οΈπŸ“·
  3. Travelling salesman problem πŸŽ™οΈπŸ“·
  4. Facility location problem πŸŽ™οΈπŸ“·
  5. Set covering problem
  6. Capacitated facility location
  7. Bin packing problem
  8. Graph colouring as an integer program
  9. Cutting stock problem
  10. Lot sizing with setup costs
  11. Machine scheduling (makespan)
  12. Big-M either-or constraint
  13. Fixed-charge (setup cost) problem
  14. LP relaxation versus integer optimum

Quadratic programming examples

  1. Markowitz minimum-variance portfolio πŸŽ™οΈπŸ“·
  2. Least squares line fit πŸŽ™οΈπŸ“·
  3. Ridge regression
  4. Lasso regression
  5. Support vector machine (soft margin)

Convex optimization examples

  1. Economic order quantity πŸŽ™οΈπŸ“·
  2. Logistic regression
  3. Kelly criterion bet size
  4. Smallest circle covering points
  5. Warehouse location (Fermat-Weber point)
  6. Consumer's best bundle (utility maximization)
  7. Water-filling power allocation

Eigenvalue problem examples

  1. Principal component as an optimization problem

Fractional programming examples

  1. Maximum Sharpe ratio portfolio

Semidefinite programming examples

  1. Nearest correlation matrix

Geometric programming examples

  1. Tin can with the least metal

Calculus of variations examples

  1. Brachistochrone (fastest slide)

Try ProvenDecisions free: type, photograph or say an optimization problem; every answer is checked by a solver.

What do you want to optimize?

Type the math, describe it in words, snap a photo or say it. ProvenDecisions builds the model, solves it, checks it and walks you through it.

One constraint per line, or separated by commas. Add integer: x, y or binary: z for whole-number decisions. LaTeX works too.

Try: