286. Simplex Cheatsheet

1. Convert to standard form

Objective Function

Constraints

Negative/Free Variables

2. Partition

Constraints:

3. Basic Feasible Solution

4. Reduced Costs

• If : can enter the basis
• If : optimal

5. Choose Entering Variable

Select with the largest .

If there’s a tie, pick the smallest index (Bland’s rule).

6. Pivot / Ratio Test

Let be the column of the entering variable expressed in basic coordinates Only maintain feasibility

• The smallest identifies the leaving variable .
• If all : the LP is unbounded