Solve Linear Programming Problem using Simplex Method
Published on June 30, 2026
Step-by-step solution to a maximization problem using the Simplex method, including converting to standard form and tableau iterations.
Question
Answer
Problem Statement
Step 1: Convert to Standard Form
Maximize
Subject to:
Step 2: Initial Simplex Tableau
| Basic |
|
|
|
|
|
|
RHS | Ratio |
|---|---|---|---|---|---|---|---|---|
|
|
2 | 3 | 1 | 1 | 0 | 0 | 460 |
|
|
|
4 | 1 | 0 | 0 | 1 | 0 | 420 |
|
|
|
2 | 1 | 1 | 0 | 0 | 1 | 430 |
|
|
|
-2 | -3 | -5 | 0 | 0 | 0 | 0 |
- Entering variable:
(most negative coefficient in -row: ). - Leaving variable:
(smallest positive ratio: ). - Pivot element: 1 (at row
, col ).
Step 3: First Iteration
| Basic |
|
|
|
|
|
|
RHS | Ratio |
|---|---|---|---|---|---|---|---|---|
|
|
0 | 2 | 0 | 1 | 0 | -1 | 30 |
|
|
|
4 | 1 | 0 | 0 | 1 | 0 | 420 |
|
|
|
2 | 1 | 1 | 0 | 0 | 1 | 430 |
|
|
|
8 | 2 | 0 | 0 | 0 | 5 | 2150 |