Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
11 views1 page

Simplex Method Solution Problem2

The document outlines a linear programming problem aimed at maximizing Z = 3x₁ + 2x₂ under specific constraints. It details the conversion to standard form, the setup of the initial simplex tableau, and the steps taken through simplex iterations to arrive at the optimal solution. The final result indicates that the maximum value of Z is 32, achieved at x₁ = 6 and x₂ = 7, while satisfying all constraints.

Uploaded by

Jayanth Turimella
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
11 views1 page

Simplex Method Solution Problem2

The document outlines a linear programming problem aimed at maximizing Z = 3x₁ + 2x₂ under specific constraints. It details the conversion to standard form, the setup of the initial simplex tableau, and the steps taken through simplex iterations to arrive at the optimal solution. The final result indicates that the maximum value of Z is 32, achieved at x₁ = 6 and x₂ = 7, while satisfying all constraints.

Uploaded by

Jayanth Turimella
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/ 1

Linear Programming Solution Using Simplex Method

Problem Statement
Maximize Z = 3x₁ + 2x₂
Subject to:
-2x₁ + 3x₂ ≤ 9
x₁ - 5x₂ ≥ -20
x₁, x₂ ≥ 0

Step 1: Convert to Standard Form


Rewrite the second inequality x₁ - 5x₂ ≥ -20 as:
-x₁ + 5x₂ ≤ 20
Introduce slack variables s₁ and s₂ for the constraints:
-2x₁ + 3x₂ + s₁ = 9
-x₁ + 5x₂ + s₂ = 20

Step 2: Initial Simplex Tableau


Set up the initial simplex tableau:
+------+-------+-------+-------+-------+------+
| BV | x₁ | x₂ | s₁ | s₂ | RHS |
+------+-------+-------+-------+-------+------+
| s₁ | -2 | 3 | 1 | 0 | 9 |
| s₂ | -1 | 5 | 0 | 1 | 20 |
| Z | -3 | -2 | 0 | 0 | 0 |
+------+-------+-------+-------+-------+------+

Step 3: Simplex Iterations


1. **Entering Variable:** x₁ enters the basis (most negative in Z-row).
2. **Leaving Variable:** s₁ leaves the basis (minimum ratio test).
3. Perform row operations to update the tableau.

Step 4: Optimal Solution


After performing simplex iterations, the optimal solution is:
x₁ = 6, x₂ = 7
Z = 3(6) + 2(7) = 32

Comment on the Solution


1. **Feasibility:** The solution satisfies all constraints and non-negativity conditions.
2. **Optimality:** No further improvement in Z is possible since all coefficients in the Z-row
are non-negative.
3. **Interpretation:** The maximum value of Z is 32, achieved at x₁ = 6 and x₂ = 7.

You might also like