Simplex Algorithm

← Back to the article

Simplex finds the best choice when there are limits, like time, money, or materials.

What it does

Simplex finds the best choice when there are limits, like time, money, or materials.

Optimization: Finding the best result • Constraint: A strict rule

How it works

  • Write the goal, such as “make the most profit.”
  • Write the limits, such as “only 8 hours available.”
  • Check corner choices until it finds the best one.

Uses and applications

  • A factory can choose how many of each product to make.
  • A delivery team can plan with limited trucks and time.
  • A school cafeteria can plan meals with a budget.

In short

Simplex optimizes an objective while following rules.

Related methods

  • A* Search: Searches for the best path rather than the best mix under limits.
  • Multi-Armed Bandit: Chooses among options while learning which works best.

Back to Forecasting and optimization · All topics

The interactive demonstration and the Python walkthrough for this topic need JavaScript.