TUTORIAL III SOLUTIONS

1. Solve the given LP model using Simplex Method

Maximize Z = 20x1+80x2
subject to
4x1+6x290,
8x1+6x2100,
5x1+4x280
x1, x20
Step 1: Convert given LP model to Standard form
Maximize Z = 20x1+80x2+0s1+0s2+0s3
Maximize Z- 20x1-80x2-0s1-0s2-0s3 = 0
Subjected to
4x1+6x2+s1+0s2+0s3=90
8x1+6x2+0s1+s2+0s3=100
5x1+4x2+0s1+0s2+s3=80
x1, x2, s1, s2, s30
Step 2: Obtain a basic solution from standard form
It is not possible to enumerate all corner points in the solution space (i.e.,
basic solutions). Then Simplex method investigates only a few of those
solutions. Normally Simplex method starts at origin. Where xjs assumes a
value zero.
To find a Basic solution set any (n-m) variables to zero
i.e., set (5-3) =2 variables to zero, x1 = x2 = 0
x1, x2 are Non Basic Variables, Basic variables are s1, s2 and s3
Now we have 3 unknowns (s1, s2 and s3) and three equation. Then solve
these unknowns by using three equations. Then basic solution is (s1, s2, s3)
= (90, 100, 80)
Step 3: Determine whether the current basic feasible solution is optimal.
Any basic solution to system of equations in which all variables are
nonnegative is a basic feasible solution. In the above basic solution all
variables are non negative then it is a basic feasible solution. Simplex
method starts with a basic feasible solution.
Tableau 1
z x1 x2 s1 s2 s3 Solution Ratio
s1 0 4 6 1 0 0 90 15
s2 0 8 6 0 1 0 100 50/3
s3 0 5 4 0 0 1 80 20
 TUTORIAL III SOLUTIONS
Z 1 -20 -80 0 0 0 0
Tableau 2
Basis z x1 x2 s1 s2 s3 Solution Ratio
x2 0 2/3 1 1/6 0 0 15
s2 0 4 0 -1 1 0 10
s3 0 7/3 0 -2/3 0 1 20
Z 1 100/3 0 40/3 0 0 1200
Tableau 2 Calculations
New Pivot row (x2 row) = (current pivot row)/(pivot element)
= (0 4 6 1 0 0 90)/(6)
=(0 2/3 1 1/6 0 0 15)
New s2 row = Current s2 row (its pivot column coefficient) . (New pivot
row)
=(0 8 6 0 1 0 100) (6).( 0 2/3 1 1/6 0 0 15)
=(0 4 0 -1 1 0 10)
New s3 row = Current s3 row (its pivot column coefficient) . (New pivot
row)
=(0 5 4 0 0 1 80) (4).( 0 2/3 1 1/6 0 0 15)
=(0 7/3 0 -2/3 0 1 20)
New z row = Current z row (its pivot column coefficient) . (New pivot
row)
=(1 -20 -80 0 0 0 0) (-20).( 0 2/3 1 1/6 0 0 15)
=(100/3 0 40/3 0 0 1 1200)
2. Solve the given LP model using Simplex Method
Maximize Z = 3x1+2x2+5x3
subject to
x1+x2+x39,
2x1+3x2+5x330
2x1-x2-x38
x1, x2,x30
Step 1: Convert given LP model to Standard form
Maximize Z = 3x1+2x2+5x3+0s1+0s2+0s3
Maximize Z-3x1-2x2-5x3-0s1-0s2-0s3 =0
Subjected to
 TUTORIAL III SOLUTIONS
1x1+1x2+1x3+s1+0s2+0s3=9
2x1+3x2+5x3+0s1+s2+0s3=30
2x1-1x2-1x3+0s1+0s2+s3=8
x1, x2, x3 s1, s2, s30
Step 2: Obtain a basic solution from standard form
It is not possible to enumerate all corner points in the solution space (i.e.,
basic solutions). Then Simplex method investigates only a few of those
solutions. Normally Simplex method starts at origin. Where xjs assumes a
value zero.
To find a Basic solution set any (n-m) variables to zero
i.e., set (6-3) =3 variables to zero, x1 = x2 = x3 = 0
x1, x2 and x3 are Non Basic Variables, Basic variables are s1, s2 and s3
Now we have 3 unknowns (s1, s2 and s3) and three equation. Then solve
these unknowns by using three equations. Then basic solution is (s1, s2, s3)
= (9, 30, 8)
Step 3: Determine whether the current basic feasible solution is optimal.
Any basic solution to system of equations in which all variables are
nonnegative is a basic feasible solution. In the above basic solution all
variables are non-negative then it is a basic feasible solution. Simplex
method starts with a basic feasible solution.
Tableau 1
Basis z x1 x2 x3 s1 s2 s3 Solution Ratio
s1 0 1 1 1 1 0 0 9 9
s2 0 2 3 5 0 1 0 30 6
s3 0 2 -1 -1 0 0 1 8
Z 1 -3 -2 -5 0 0 0 0
Tableau 2
Basis z x1
x2 x3 s1 s2 s3 Solution Ratio
s1 0 3/5
2/5 0 1 -1/5 0 3 5
x3 0 2/5
3/5 1 0 1/5 0 6 15
-
s3 0 12/5 0 0 1/5 1 14 35/6
2/5
Z 1 -1 1 0 0 1 0 30
Tableau 3
Basis z x1 x2 x3 s1 s2 s3 Solution Ratio
x1 0 1 2/3 0 5/3 -1/3 0 5
 TUTORIAL III SOLUTIONS
-
x3 0 0 1/3 1 1/3 0 4
2/3
s3 0 0 -2 0 -4 1 1 2
Z 1 0 5/3 0 5/3 2/3 0 35
Tableau 2 Calculations
New Pivot row (x3 row) = (current pivot row)/(pivot element)
=(0 2 3 5 0 1 0 30)/5
=(0 2/5 3/5 1 0 1/5 0 6)
New s1 row = Current s1 row (its pivot column coefficient) . (New pivot
row)
=(0 1 1 1 1 0 0 9) (1).(0 2/5 3/5 1 0 1/5 0
6)
=(0 3/5 2/5 0 1 -1/5 0 3)
New s3 row = Current s3 row (its pivot column coefficient) . (New pivot
row)
=(0 2 -1 -1 0 0 1 8) (-1).( 0 2/5 3/5 1 0 1/5 0
6)
=(0 12/5 -2/5 0 0 1/5 1 14)
New z row = Current z row (its pivot column coefficient) . (New pivot
row)
=(1 -3 -2 -5 0 0 0 0) (-5).( 0 2/5 3/5 1 0 1/5 0
6)
=(1 -1 1 0 0 1 0 30)
Tableau 3 Calculations
New Pivot row (x1 row) = (current pivot row)/(pivot element)
=(0 3/5 2/5 0 1 -1/5 0 3)/(3/5)
=(0 1 2/3 0 5/3 -1/3 0 5)
New x3 row = Current x3 row (its pivot column coefficient) . (New pivot
row)
=(0 2/5 3/5 1 0 1/5 0 6) (2/5).(0 1 2/3 0 5/3 -1/3
0 5)
=(0 0 1/3 1 -2/3 1/3 0 4)
New s3 row = Current s3 row (its pivot column coefficient) . (New pivot
row)
 TUTORIAL III SOLUTIONS
=(0 12/5 -2/5 0 0 1/5 1 14) (12/5).( 0 1 2/3 0 5/3 -1/3
0 5)
=(0 0 -2 0 -4 1 1 2)
New z row = Current z row (its pivot column coefficient) . (New pivot
row)
=(1 -1 1 0 0 1 0 30) (-1).( 0 1 2/3 0 5/3 -1/3 0
5)
=(1 0 5/3 0 5/3 2/3 0 35)
3. Solve the given LP model using Simplex Method
Maximize Z = 5x1+3x2+7x3
subject to
x1+x2+2x322,
3x1+2x2+1x326,
x1+1x2+x318
x1, x2,x30
Step 1: Convert given LP model to Standard form
Maximize Z = 5x1+3x2+7x3+0s1+0s2+0s3
Maximize Z-5x1-3x2-7x3-0s1-0s2-0s3 =0
Subjected to
1x1+1x2+2x3+s1+0s2+0s3=22
3x1+2x2+1x3+0s1+s2+0s3=26
1x1+1x2+1x3+0s1+0s2+s3=18
x1, x2, x3 s1, s2, s30
Step 2: Obtain a basic solution from standard form
It is not possible to enumerate all corner points in the solution space (i.e.,
basic solutions). Then Simplex method investigates only a few of those
solutions. Normally Simplex method starts at origin. Where xjs assumes a
value zero.
To find a Basic solution set any (n-m) variables to zero
i.e., set (6-3) =3 variables to zero, x1 = x2 = x3 = 0
x1, x2 and x3 are Non Basic Variables, Basic variables are s1, s2 and s3
Now we have 3 unknowns (s1, s2 and s3) and three equations. Then solve
these unknowns by using three equations. Then basic solution is (s1, s2, s3)
= (22, 26, 18)
 TUTORIAL III SOLUTIONS
Step 3: Determine whether the current basic feasible solution is optimal.
Any basic solution to system of equations in which all variables are
nonnegative is a basic feasible solution. In the above basic solution all
variables are non-negative then it is a basic feasible solution. Simplex
method starts with a basic feasible solution
Tableau 1
Basis z x1 x2 x3 s1 s2 s3 Solution Ratio
s1 0 1 1 2 1 0 0 22 11
s2 0 3 2 1 0 1 0 26 26
s3 0 1 1 1 0 0 1 18 18
Z 1 -5 -3 -7 0 0 0 0
Tableau 2
Basis z x1 x2 x3 s1 s2 s3 Solution Ratio
x3 0 1/2 1/2 1 1/2 0 0 11 22
s2 0 5/2 3/2 0 -1/2 1 0 15 6
s3 0 1/2 1/2 0 -1/2 0 1 7 14
Z 1 -3/2 1/2 0 7/2 0 0 77
Tableau 3
Basis z x1 x2 x3 s1 s2 s3 Solution Ratio
-
x3 0 0 1/5 1 3/5 0 8
1/5
x1 0 1 3/5 0 -1/5 2/5 0 6
-
s3 0 0 1/5 0 -2/5 1 4
1/5
Z 1 0 7/5 0 16/5 3/5 0 86
Tableau 2 Calculations
New Pivot row (x3 row) = (current pivot row)/(pivot element)
=(0 1 1 2 1 0 0 22)/2
=(0 1/2 1/2 1 1/2 0 0 11)
New s2 row = Current s2 row (its pivot column coefficient) . (New pivot
row)
=(0 3 2 1 0 1 0 26) (1).( 0 1/2 1/2 1 1/2 0 0
11)
=(0 5/2 3/2 0 -1/2 1 0 15)
New s3 row = Current s3 row (its pivot column coefficient) . (New pivot
row)
 TUTORIAL III SOLUTIONS
=(0 1 1 1 0 0 1 18) (0 1/2 1/2 1 1/2 0 0 11)
=(0 1/2 1/2 0 -1/2 0 1 7)
New z row = Current z row (its pivot column coefficient) . (New pivot
row)
=(1 -5 -3 -7 0 0 0 0) (-7).( 0 1/2 1/2 1 1/2 0 0 11)
=(1 -3/2 1/2 0 7/2 0 0 77)
Tableau 3 Calculations
New Pivot row (x1 row) = (current pivot row)/(pivot element)
=(0 5/2 3/2 0 -1/2 1 0 15)/(5/2)
=(0 1 3/5 0 -1/5 2/5 0 6)
New x3 row = Current x3 row (its pivot column coefficient) . (New pivot
row)
=(0 1/2 1/2 1 1/2 0 0 11) (1/2).( 0 1 3/5 0 -1/5 2/5
0 6)
=(0 0 1/5 1 3/5 -1/5 0 8)
New s3 row = Current s3 row (its pivot column coefficient) . (New pivot
row)
=(0 1/2 1/2 0 -1/2 0 1 0 7) (1/2).( 0 1 3/5 0 -1/5 2/5
0 6)
=(0 0 1/5 0 -2/5 -1/5 1 4)
New z row = Current z row (its pivot column coefficient) . (New pivot
row)
=(1 -3/2 1/2 0 7/2 0 0 77) (-3/2).( 0 1 3/5 0 -1/5 2/5
0 6)
=(1 0 7/5 0 16/5 3/5 0 86)
4. Solve the given LP model using Simplex Method
Maximize Z = x1+x2+3x3+2x4
subject to
x1+2x2-3x3+5x44,
5x1-2x2+6x48,
2x1+3x2-2x3+3x43,
-x1+x3+2x40
x1, x2, x3, x40
Step 1: Convert given LP model to Standard form
 TUTORIAL III SOLUTIONS
Maximize Z = 1x1+1x2+3x3+2x4+0s1+0s2+0s3+0s4
Maximize Z-x1-x2-3x3-2x4-0s1-0s2-0s3-0s4 =0
Subjected to
1x1+2x2-3x3+5x4+s1+0s2+0s3+0s4=4
5x1-2x2+0x3+6x4+0s1+s2+0s3+0s4=8
2x1+3x2-2x3+3x4+0s1+0s2+s3+0s4=3
-x1+x3+2x4+0s1+0s2+0s3+s4=0
x1, x2, x3, x4, s1, s2, s3, s40
Step 2: Obtain a basic solution from standard form
It is not possible to enumerate all corner points in the solution space (i.e.,
basic solutions). Then Simplex method investigates only a few of those
solutions. Normally Simplex method starts at origin. Where xjs assumes a
value zero.
To find a Basic solution set any (n-m) variables to zero
i.e., set (8-4) =4 variables to zero, x1 = x2 = x3 = x4 = 0
x1, x2, x3 and x4 are Non Basic Variables, Basic variables are s1, s2, s3 and s4
Now we have 4 unknowns (s1, s2, s3 and s4) and 4 equation. Then solve
these unknowns by using 4 equations. Then basic solution is (s1, s2, s3, s4) =
(4, 8, 3, 0)
Step 3: Determine whether the current basic feasible solution is optimal.
Any basic solution to system of equations in which all variables are
nonnegative is a basic feasible solution. In the above basic solution all
variables are non-negative then it is a basic feasible solution. Simplex
method starts with a basic feasible solution.

5. Solve the given LP model using Simplex Method

Maximize Z = 5x1-6x2+3x3-
5x4+12x5
subject to
x1+3x2+5x3+6x4+3x590
All variables are Non Negative
 TUTORIAL III SOLUTIONS
6. Solve the given LP model using Simplex Method
Maximize Z =x1
subject to
5x14,
6x18,
3x13.
All variables are Non
Negative
7. Solve the given LP model using Simplex Method
Maximize Z = 3x1+5x2+6x3
subject to
2x1+1x2+1x34,
1x1+2x2+1x34,
1x1+1x2+2x34,
1x1+1x2+1x33.
All variables are Non Negative
8. Solve the given LP model using Simplex Method
Maximize Z = -1x1+1x2+2x3
subject to
1x1+2x2-1x320,
-2x1+4x2+2x360,
2x1+3x2+1x350.
All variables are Non Negative
9. Solve the given LP model using Simplex Method
Maximize Z = 3x1+2x2
subject to
x1+x24,
x1-x22,
x1+x26,
2x1+x26
 TUTORIAL III SOLUTIONS
All variables are Non
Negative
10. Solve the given LP model using Simplex Method
Maximize Z = 2x1+3x2
subject to
x1+x24,
-x1+x21,
x1+2x25
All variables are Non
Negative
11. Solve the given LP model using Simplex Method
Maximize Z =2x1+4x2+x3+x4
subject to
x1+3x2+x44,
2x1+x23,
x2+4x3+x43
All variables are Non
Negative
12. Solve the given LP model using Simplex Method
Maximize Z
=4x1+5x2+9x3+11x4
subject to
1x1+1x2+1x3+1x415,
7x1+5x2+3x3+2x4120,
3x1+5x2+10x3+15x4100
All variables are Non Negative
13. Solve the given LP model using Simplex Method
Maximize Z =
4x1+3x2+4x3+6x4
subject to
x1+2x2+2x3+4x480,
 TUTORIAL III SOLUTIONS
2x1+0x2+2x3+x460,
3x1+3x2+1x3+1x480
All variables are Non Negative
14. Solve the given LP model using Simplex Method
Maximize Z = 3x1+x2+3x3
subject to
2x1+1x2+1x32,
1x1+2x2+3x35,
2x1+2x2+1x36
All variables are Non
Negative
15. Solve the given LP model using Simplex Method
Maximize Z = 3x1+2x2+5x3
subject to
x1+2x2+1x3430,
3x1+0x2+2x3460,
1x1+4x2+0x3420
All variables are Non
Negative
16. Solve the given LP model using Simplex Method
Maximize Z = 2x1+4x2+3x3
subject to
x1+2x2+0x34,
0x1+1x2+3x36,
2x1+1x2+2x310
All variables are Non
Negative
17. Solve the given LP model using Simplex Method
MaximizeZ =
(2/5)x1+(7/25)x2+(8/25)x3+(18/25)x4+(16/25)x5+(3/5)x6
subject to
 TUTORIAL III SOLUTIONS
(1/100)x1+(1/100)x2+(1/100)x3+(3/100)x4+(3/100)x5+(3/100)x6850
,
(1/50)x1+(1/20)x4700,
(1/50)x2+(1/20)x5100,
(3/100)x3+(2/25)x6900
All variables are Non Negative
18. Solve the given LP model using Simplex Method
Maximize Z =2x1+x2+x3
subject to
3x1+x2+x360
x1-x2+2x310
x1+x2-x320
All variables are Non
Negative
19. Solve the given LP model using Simplex Method
Maximize Z=60x1+ 30x2+20x3
subject to
8x1+ 6x2+ x348
4x1+ 2x2+(3/2)x320
2x1+(3/2)x2+(1/2)x38
x25
All variables are Non
Negative