Scribd
Upload
181 views3 pages

Simplex & Dulity 1. Using Simplex Method Solve The Following LPP

The document presents 14 linear programming problems to be solved using various methods like the simplex method, two-phase method, and Big-M method. It also presents 6 linear programming problems and asks to obtain their dual problems. The problems involve maximizing or minimizing linear objective functions subject to various linear inequality and equality constraints involving nonnegative variables.

Uploaded by

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

Simplex & Dulity 1. Using Simplex Method Solve The Following LPP

The document presents 14 linear programming problems to be solved using various methods like the simplex method, two-phase method, and Big-M method. It also presents 6 linear programming problems and asks to obtain their dual problems. The problems involve maximizing or minimizing linear objective functions subject to various linear inequality and equality constraints involving nonnegative variables.

Uploaded by

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

Simplex & Dulity

1.

Using simplex method solve the following LPP.


Max Z = X1 + 2X2
[Link]
- X1 + 2X 2 8
X1 + 2X2 12
X1 2X2 3
X1, X2 0

2. Solve the given LPP using simplex method


Max Z = 5X1 + 3X2
[Link] X1 + X2 2
5X1 + 2X2 10
3X1 + 8X2 12
X1 , X2 0
3. Solve the LPP using simplex method.
Min Z = X1 X2 + X3 + X4 + X5 X6
[Link]
X1 + X4 + 6X6 = 9
3X1 +X2 4X3 + 2X6 = 2
all Xis 0

4. Solve the given LPP using simplex method.


Max Z = 107X1 + X2 + 2X3
[Link]
14X1 +X2 6X3 + 3X4 = 7
16X1 + 1/2X2 6X3 5
3X1 X2 X3 0
Xis 0
5. Using simplex method to solve the following LPP
Max Z = 3X1 + 2X2
[Link] X1 + X2 6, 2X1 + X2 6, X1,X2 0
6. Max Z = X1 + 2X2 + 3X3
S,to X1 2X2 + 3X3 10, X1 + X2 5, X1,X2 , X3 0.
7. Max Z = 5X1 + 2X2 + 3X3 X4 + X5
[Link] X1 + 2X2 +2X3 +X4 = 8
3X1 + 4X2 X3 + X5 = 7
X1 ,X2 ,X3 ,X4 ,X5 > 0

8. Max Z = -4X1,-3X2 4X3 6X4


s.toX1 + 2X2 +2X3 + X4 80
2X1 + 2X3 + X4 60
3X1 +3X2 + X3 + X4 < 80
X1,X2,X3,X4, 0
9. Use Big-M method to solve the LPP.
Min Z = 4X1 +3X2
[Link] 2X1 + X2 10
-3X1 + 2X2 6
X1 + X2 6
X1,X2, 0
10.. Max Z = 5X1-4X2+3X3
s.to2X1 + X2 - 6X3 = 20
6X1 + 5X2 +10 X3 76
8X1 -3X2 +6 X3 50
X1, X2, X3, X4 0
11. Solve the following LP Problems by two- phase method.
Max Z = 3X1 X2
[Link] 2X1 + X2 2
X1 + 3X2 2
X2 4 & X1 ,X2 0
12. Min Z = X1- 2X2 3X3
[Link] - 2X1 + X2 + 3X3 = 2
2X1 + 3X2 + 4X3 =1
Xi 0 I = 1, 2 , 3.
13. Max Z = 5X1 + 8X2
[Link] 3X1 +2X2 3
X1 + 4X2 4
X1 + X2 5
X1 , X2 0
14. Max Z = 500X1 + 1400X2 + 900X3
[Link]
X1 + X2 + X3 = 100
12X1+ 35X2 + 15X3 25
8X1 + 3X2 + 4X3 6
X1,X2 ,X3 0
Obtain the dual of the following linear programming problems.
1. Max Z = 3X1+4X2
[Link] 2X1+6X2 16

5X1+2X+2X2 20
X1, X2 0
2. Min Z= 7X1+3X2 +8X3
[Link] 8X1+2X2 +X1 3
3X1+6X2+4X3 4
4X1+X2+5X31
X1+5X2+2X37
X1,X2 ,X3 0
3. . Max Z= 3X1+X2 +X3-X4
[Link] X1+5X2 +3X3 +4X4 5
X1+X2= -1
X3-X4-5
X1,X2,X3,X40
4. . Min Z= X3+X4 +X5
[Link] X1-X3 +X4+X5 = -2
X2-X3-X4+X5= 1
Xi.>0, i=1,25
5. . Max Z= 6X1+4X2 +6X3+X4
[Link] 4X1+4X2 +4X3 +8X4=21
3X1+17X2+80X3+2X448
X1, X2 0 X3 ,X4 are unrestricted in sign.
6.

7.

8.

Max Z = 3X1+2X2
[Link] 2X1+X2 5
X1+X2 3
X1 , X2 0.
. Max Z =2X1+X2
[Link] X1+2X210
X1+X26
X1-X22.
X1-2X21
X1,X2,0.
8. Min Z =2X1+2X2
[Link] 2X1+4X21
X1+2X21
2X1 + X21.
X1 ,X2, 0.

You might also like