Linear Programming, Step by Step
Define your objective function and constraints below. The solver will walk you through every Simplex iteration so you can follow the math.
✓≤ / ≥ / = constraints✓Big-M method✓Step-by-step tableau✓Mobile-friendly
Problem Size
Objective
Objective Function — Maximize Z
x1
+
x2
Constraints
C1
x1
+
x2
C2
x1
+
x2