Simplex Studio

Follow every pivot. See every move.

Linear program

Set up the problem

Decision variables

Objective

x₁ +x₂

Constraints

x₁…x ≥ 0
Constraint 1
x₁ +x₂
Constraint 2
x₁ +x₂
Constraint 3
x₁ +x₂

Set up · Normalize

Normalize the model
ScalarMatrix

Every right-hand side is already nonnegative, so no constraint needs to be reversed.

State at this step

x₁ = 0x₂ = 0s₁ = 700s₂ = 1000s₃ = 1000z = 0

Basis: {s₁, s₂, s₃} · all other variables are 0

The model in scalar form

maxz = 100x₁ + 100x₂

C1x₁ + x₂ 700

C2x₁ + 2x₂ 1000

C32x₁ + x₂ 1000

and x₁, x₂ ≥ 0

2D feasible set

Geometry
x ≥ 0
Feasible set Simplex path Basic solution
Normalize the model1 / 12