Scribd
Upload
13 views1 page

simplex method.sizzle

The document outlines the solution to a linear programming problem using the simplex method to maximize profit from producing chairs and tables. The optimal solution indicates that the company should produce 7 units of chairs and no tables, resulting in a maximum profit of $70, while 46 units of wood will remain unutilized. The document also suggests reallocating the unused resources for better benefits.

Uploaded by

sizzle.cu.bd
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
13 views1 page

simplex method.sizzle

The document outlines the solution to a linear programming problem using the simplex method to maximize profit from producing chairs and tables. The optimal solution indicates that the company should produce 7 units of chairs and no tables, resulting in a maximum profit of $70, while 46 units of wood will remain unutilized. The document also suggests reallocating the unused resources for better benefits.

Uploaded by

sizzle.cu.bd
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
You are on page 1/ 1

Page 19 of 20

Problem Solve the following LPP with simplex method:

Resource Chair (x₁) Table (x₂) Availability of resources


Labor hour 5 7 35
Wood 2 3 60
Profit $10 $13 *
Maximize 𝒛 = 𝟏𝟎𝒙₁ + 𝟏𝟑𝒙₂
Subject to 𝟓𝒙𝟏 + 𝟕𝒙𝟐 ≤ 𝟑𝟓
𝟐𝒙₁ + 𝟑𝒙₂ ≤ 𝟔𝟎
𝒙₁ ≥ 𝟎 & 𝒙₂ ≥ 𝟎.

Solution: Introducing the slack variable 𝑆 & 𝑆 to the constraint equations & the given LPP can
be written as the standard mathematical form:

Maximize 𝑧 = 10𝑥 + 13𝑥 + (0 × 𝑆 ) + (0 × 𝑆 )


Subject to 5𝑥 + 7𝑥 + 𝑆 = 35  5𝑥 + 7𝑥 + 𝑆 + (0 × 𝑆 ) = 35
2𝑥 + 3𝑥 + 𝑆 = 60  2𝑥 + 3𝑥 + (0 × 𝑆 ) + 𝑆 = 60
𝑥 ,𝑥 ,𝑆 ,𝑆 ≥ 0

Table-1
𝑥 𝑥 𝑆 𝑆 Table-1 provides us
Row Basis ↓𝑐 → 10 13 0 0 the following Max(𝑐 − 𝑧 )=13
𝑅 𝑆 0 5 7 1 0 35 solution: Pivot column=𝑥
0 2 3 0 1 60 𝑥 =0 Min|³⁵⁄₇,⁶⁰⁄₃|=³⁵⁄₇
𝑅 𝑆
𝑥 =0 Pivot row=𝑅
𝑧 0 0 0 0 0
𝑆 = 35 Key element=7
𝑐 −𝑧 10 13 0 0 𝑆 = 60
𝑅 𝑅
Operations: 𝑅 = 7 & 𝑅 = 𝑅 −3 7
Table-2
𝑥 𝑥 𝑆 𝑆 Table-2 provides us
Row Basis ↓𝑐 → 10 13 0 0 the following
𝑅 𝑥 13 ⁵⁄₇ 11
0
5 solution: Pivot column=𝑥
7
𝑥 = 0 Pivot row=𝑅
𝑅 𝑆 0 -1 7 0
⁻³Ú₇ 1
45
𝑥 =5 Key element=⁵⁄₇
𝑧 ⁶⁵⁄₇ 13
¹³Ú₇ 0
65
𝑆 =0
𝑐 −𝑧 ⁵⁄₇ 0 ⁻¹³Ú₇ 0 𝑆 = 45
𝑅
Operations: 𝑅 = 𝑅 × 7 5 & 𝑅 = 𝑅 + 5
Table-3
𝑥 𝑥 𝑆 𝑆 Thus the optimum solution is:
Row Basis ↓𝑐 → 10 13 0 0 𝑥 =7
𝑅 𝑥 10 1 ⁷⁄₅ ⅕ 0 7 𝑥 =0
𝑅 𝑆 0 0 ⅕ ⁻²Ú₅ 1 46 𝑆 =0
𝑧 10 14 2 0 70 𝑆 = 46
𝑐 −𝑧 0 -1 -2 0 𝑧 = 70
Hence, the company should produce 7 units of chair & no unit of table to get maximum profit
z=70. It is further to be noted that 46 units of second resources i.e. wood will remain
unutilized and thus the management should divert these amount of resources to another
product or plant to get more benefits.

#CR7

You might also like