Scribd
Upload
30 views1 page

Simplex Method

Uploaded by

D. Naarayan Nandan
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
30 views1 page

Simplex Method

Uploaded by

D. Naarayan Nandan
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

R. A.

Podar College of Commerce and Economics


(Empowered Autonomous)
FYBCom Mathematical and Statistical Techniques I
Mathematical Applications in Management Worksheet 3
Q 1. Solve the following LPP using the Simplex Method:

(A) (E)

Maximize Z = 6x1 + 10x2 Maximize Z = 18x1 + 19x2 + 20x3


Subject to 3x1 + 5x2 ≤ 10 Subject to x1 + 2x2 + 3x3 ≤ 6
5x1 + 3x2 ≤ 15 3x1 − x2 − x3 ≤ 20
x1 , x2 ≥ 0 x1 , x2 , x3 ≥ 0
(B)
(F)
Maximize Z = x1 + x2
1 1 Minimize Z = 4x1 − 6x2
Subject to x1 + x2 ≤ 1
60 90 Subject to x1 + 2x2 ≤ 8
5x1 + 8x2 ≤ 600
3x1 + 4x2 ≤ 15
x1 , x2 ≥ 0
x1 , x2 ≥ 0
(C)
(G)
Maximize Z = 140x1 + 210x2
Subject to 3x1 + 3x2 ≤ 36 Minimize Z = 2x1 + 8x2 − 10x3
5x1 + 2x2 ≤ 50 Subject to − x1 + x2 + 5x3 ≤ 10
2x1 + 6x2 ≤ 60 3x1 − x2 + 8x3 ≤ 20
x1 , x2 ≥ 0 x1 , x2 , x3 ≥ 0
(D)
(H)
Maximize Z = 40x1 + 30x2
Subject to x1 + x2 ≤ 80 Maximize Z = 30x1 + 40x2 + 20x3
2x1 + x2 ≤ 100 Subject to 10x1 + 12x2 + 7x3 ≤ 10000
x1 ≤ 40 7x1 + 10x2 + 8x3 ≤ 8000
x2 ≤ 70 x1 + x2 + x3 ≤ 1000
x1 , x2 ≥ 0 x1 , x2 , x3 ≥ 0

xxxxxxxxxxx

You might also like