Scribd
Upload
24 views2 pages

Graphical and Simplex Method Explanation

The document explains the Graphical and Simplex methods for solving linear programming problems. The Graphical method is demonstrated with a maximization example involving two variables and constraints, while the Simplex method is outlined for problems with two or more variables using algebra and tableau format. Both methods aim to find the optimal solution for the objective function under given constraints.

Uploaded by

berhanutola7
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
24 views2 pages

Graphical and Simplex Method Explanation

The document explains the Graphical and Simplex methods for solving linear programming problems. The Graphical method is demonstrated with a maximization example involving two variables and constraints, while the Simplex method is outlined for problems with two or more variables using algebra and tableau format. Both methods aim to find the optimal solution for the objective function under given constraints.

Uploaded by

berhanutola7
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Graphical and Simplex Method - Linear

Programming (Workable Explanation)


1. Graphical Method

Goal: To find the maximum or minimum value of an objective function involving only two
variables.

Example (Maximization):
Maximize: Z = 3X₁ + 5X₂
Subject to:
2X₁ + X₂ ≤ 18
2X₁ + 3X₂ ≤ 42
3X₁ + X₂ ≤ 24
X₁, X₂ ≥ 0

Step-by-Step:
1. Convert inequalities to equalities for plotting:
- 2X₁ + X₂ = 18 → X₁ = 0 ⇒ X₂ = 18; X₂ = 0 ⇒ X₁ = 9
- 2X₁ + 3X₂ = 42 → X₁ = 0 ⇒ X₂ = 14; X₂ = 0 ⇒ X₁ = 21
- 3X₁ + X₂ = 24 → X₁ = 0 ⇒ X₂ = 24; X₂ = 0 ⇒ X₁ = 8

2. Plot these lines on a graph and shade the feasible region (area satisfying all constraints).

3. Find corner points of the feasible region (e.g., (0,0), (6,6), (3,12)).

4. Substitute these points into Z = 3X₁ + 5X₂ to find the maximum.


- At (0,0): Z = 0
- At (6,6): Z = 48
- At (3,12): Z = 69 ✅ → Optimal

2. Simplex Method

Goal: Solve linear programming problems with two or more variables using algebra.

Example:
Maximize Z = 3X₁ + 2X₂
Subject to:
X₁ + X₂ ≤ 4
X₁ ≤ 2
X₁, X₂ ≥ 0

Step-by-Step:
1. Convert to Standard Form by adding Slack Variables:
- X₁ + X₂ + S₁ = 4
- X₁ + S₂ = 2
Objective: Z = 3X₁ + 2X₂ + 0S₁ + 0S₂

2. Set up Initial Simplex Tableau:


| Basis | X₁ | X₂ | S₁ | S₂ | RHS |
|-------|----|----|----|----|-----|
| S₁ | 1 | 1 | 1 | 0 | 4 |
| S₂ | 1 | 0 | 0 | 1 | 2 |
| Z | -3 | -2 | 0 | 0 | 0 |

3. Choose entering variable (most negative in Z row) → X₁.

4. Calculate replacement ratios (RHS ÷ pivot column) → minimum is S₂ → X₁ enters, S₂


leaves.

5. Perform row operations to form new tableau. Repeat until all Z-row values are non-
negative.

6. Final tableau gives optimal solution.

You might also like