Scribd
Upload
2 views2 pages

Simplex Method Solution

The document outlines the Simplex Method for solving a linear programming problem to maximize Z = 23x + 32y under specific constraints. It details the formulation of the problem in standard form, the creation of the initial Simplex tableau, and the process of determining entering and leaving variables. The final optimal solution is found to be x ≈ 185.71, y ≈ 107.14, with a maximum value of Z = 7700.

Uploaded by

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

Simplex Method Solution

The document outlines the Simplex Method for solving a linear programming problem to maximize Z = 23x + 32y under specific constraints. It details the formulation of the problem in standard form, the creation of the initial Simplex tableau, and the process of determining entering and leaving variables. The final optimal solution is found to be x ≈ 185.71, y ≈ 107.14, with a maximum value of Z = 7700.

Uploaded by

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

Simplex Method – Full Solution

Step 1: Formulate the LPP in Standard Form


Maximize Z = 23x + 32y

Subject to constraints:
10x + 6y ≤ 2500
5x + 10y ≤ 2000
x + 2y ≤ 500
x, y ≥ 0

Introduce slack variables s■, s■, s■:


10x + 6y + s■ = 2500
5x + 10y + s■ = 2000
x + 2y + s■ = 500

Objective function in standard form:


Z − 23x − 32y = 0

Step 2: Initial Simplex Tableau


Basis x y s1 s2 s3 RHS
s1 10 6 1 0 0 2500
s2 5 10 0 1 0 2000
s3 1 2 0 0 1 500
Z -23 -32 0 0 0 0

Step 3: Entering and Leaving Variables


Most negative value in Z-row is −32 → entering variable y.
Ratios:
2500/6 ≈ 416.67
2000/10 = 200 (minimum)
500/2 = 250

Leaving variable = s■, pivot element = 10.

Final Optimal Solution


After performing pivot operations until all Z-row values are non■negative, the optimal solution is:

x = 1300/7 ≈ 185.71
y = 750/7 ≈ 107.14

Maximum value:
Z = 23x + 32y = 7700

Basic variables at optimum: x, y, s■


Non■basic variables: s■ = 0, s■ = 0

You might also like