Artificial starting Solution

1. M-Method
Example 1

Find the optimal solution for the following linear programming problem

Min Z = 4x1 - 8x2 +3x3

S.T. x1 + x2 + x3 = 7
2x1 - 5x2 + x3 ≥10
x1, x2, x3 ≥ 0
Solution
Min Z = 4x1 - 8x2 +3x3 + M(R1+R2)
So:
Z-4x1 + 8x2 -3x3 – M R1 – M R2 = 0
S.T.
x1 + x2 + x3 +R1 =7
2x1 - 5x2 + x3 – x4 +R2 =10

x1 x2 x3 x4 R1 R2 Solution
Z -4 8 -3 0 -M -M 0
R1 1 1 1 0 1 0 7
R2 2 -5 1 -1 0 1 10
After adjusting Z-row, the table will be:

x1 x2 x3 x4 R1 R2 Solution Ratio
Z 3M-4 -4M+8 2M-3 -M 0 0 17M
R1 1 1 1 0 1 0 7 7
R2 2 -5 1 -1 0 1 10 5

x1 x2 x3 x4 R1 R2 Solution
Z
R1
x1 1 -5/2 ½ -1/2 0 1/2 5
After adjusting Z-row and R1 row, the table will be:
x1 x2 x3 x4 R1 R2 Solution Ratio
Z 0 3.5M-2 0.5M-1 0.5M-2 0 -1.5M+2 2M+20
R1 0 7/2 ½ ½ 1 -1/2 2 4/7
x1 1 -5/2 ½ -1/2 0 1/2 5
 x1 x2 x3 x4 R1 R2 Solution
Z
x2 0 1 1/7 1/7 2/7 -1/7 4/7
x1
After adjusting Z-row and x1 row, the table will be:

x1 x2 x3 x4 R1 R2 Solution
Z 0 0 -3/7 -12/7 -4M+(22/7) -M+(12/7) 148/7
x2 0 1 1/7 1/7 2/7 -1/7 4/7
x1 1 0 6/7 -1/7 5/7 1/7 45/7

This is the optimum

solution
x1 = 45/7
x2 = 4/7
x3 = 0
Z=148/7

Example 2

Find the optimal solution for the following linear programming problem

Min Z = 2x1 + 3x2

S.T. (½)x1 +(1/4) x2 ≤ 4

x1 + 3x2 ≥20
x1 + 3x2 = 10
x1, x 2 ≥ 0
Solution
Min Z = 2x1 + 3x2 + M(R1+R2)
So:
Z-2x1 - 3x2– M R1 – M R2 = 0
S.T.
(½)x1 +(1/4) x2 +S1 =4
x1 + 3x2 - x3 +R1 =20
x1 + 3x2 +R2 = 10
 x1 x2 S1 x3 R1 R2 Solution
Z -2 -3 0 0 -M -M 0
S1 ½ ¼ 1 0 0 0 4
R1 1 3 0 -1 1 0 20
R2 1 1 0 0 0 1 10
This is the 1st
After adjusting Z-row, the table will be: construction table

x1 x2 S1 x3 R1 R2 Solution Ratio
Z 2M-2 4M-3 0 -M 0 0 30M
S1 ½ ¼ 1 0 0 0 4 16
R1 1 3 0 -1 1 0 20 20/3
R2 1 1 0 0 0 1 10 10

x1 x2 S1 x3 R1 R2 Solution
Z
This is the 2nd
S1
construction x2 1/3 1 0 -1/3 1/3 0 20/3
table
R2
After adjusting Z, S1, and R2 rows, the table will be:
x1 x2 S1 x3 R1 R2 Solution Ratio
Z (2M-3)/3 0 0 (M-3)/3 (3-4M)/3 0 (60+10M)/3
S1 5/12 0 1 1/12 -1/12 0 7/3 28/5=5.6
x2 1/3 1 0 -1/3 1/3 0 20/3 20
R2 2/3 0 0 1/3 -1/3 1 10/3 5

x1 x2 S1 x3 R1 R2 Solution
Z
S1
x2
x1 1 0 0 ½ -1/2 3/2 5
After adjusting Z, S1, and x2 rows, the table will be:
x1 x2 S1 x3 R1 R2 Solution
Z 0 0 0 -1/2 (1-2M)/2 (3-2M)/2 25
S1 0 0 1 -1/8 1/8 -5/8 ¼
x2 0 1 0 -1/2 ½ -1/2 5
x1 1 0 0 ½ -1/2 3/2 5

This is the optimum solution

x1 = 5 x2 = 5 Z=25
Example 3

Find the optimal solution for the following linear programming problem

Max Z = x1 + x2

S.T. 2x1 + x2 ≥ 4
x1 + 2x2 = 6
x1, x 2 ≥ 0
Solution
Max Z = x1 + x2 – M(R1+R2)
So:
Z – x1 – x2 + M R1 + M R2 = 0
S.T.
2x1 + x2 – x3 + R1 =4
x1 + 2x2 +R2 = 6

x1 x2 x3 R1 R2 Solution
Z -1 -1 0 M M 0
R1 2 1 -1 1 0 4
R2 1 2 0 0 1 6

After adjusting Z-row, the table will be:

x1 x2 x3 R1 R2 Solution Ratio
Z -3M-1 -3M-1 M 0 0 -10M
R1 2 1 -1 1 0 4 2
R2 1 2 0 0 1 6 6

x1 x2 x3 R1 R2 Solution
Z
x1 1 ½ -1/2 0 2
R2

After adjusting Z-row and R2 row, the table will be:

x1 x2 x3 R1 R2 Solution Ratio
Z 0 -1.5M-1/2 -0.5M-0.5 0 2-4M
x1 1 ½ -1/2 0 2 4
R2 0 3/2 ½ 1 4 8/3
 x1 x2 x3 R1 R2 Solution
Z
x1
x2 0 1 1/3 8/3

After adjusting Z-row and x1 row, the table will be:

x1 x2 x3 R1 R2 Solution Ratio
Z 0 0 -1/3 10/3
x1 1 0 -2/3 2/3
x2 0 1 1/3 8/3 8

x1 x2 x3 R1 R2 Solution
Z
x1
x3 0 3 1 8

After adjusting Z-row and x1 row, the table will be:

x1 x2 x3 R1 R2 Solution
Z 0 1 0 6
x1 1 2 0 6
x3 0 3 1 8

This is the optimum

solution
x1 = 6
x2 = 0
Z= 6