Simplex & Big-M
Move through the tableaus of a linear program and take the worked solution away as . The explanations come from the same trace you see on screen.
Reading the tableau
Each row is a constraint in standard form; the b.v. column gives the basic variable for that row. The objective row is written as , so a negative entry identifies a variable that can improve the objective. The pivot cell is outlined.
- Slack variables () turn ≤ into =.
- Surplus variables () turn ≥ into =.
- Artificial variables () give the initial basis when there is no slack; they carry the penalty .
Conventions
The tool uses the common -row convention. Choose the entering variable from the most negative objective coefficient, then apply the ratio test; ties go to the lowest row. Minimisation is solved as the maximisation of , and the reported value is converted back.
Big-M uses a pair with treated as arbitrarily large. Pivot decisions follow the exact coefficients, so the tableau matches a hand calculation.
Export
The tab previews the document and lets you copy or download the .tex source. It usesamsmath and array, so a standard TeX installation compiles it and the preview matches the exported tableaus.