1.

Solve LPP by using big M method

Min Z= 7X1+ 15X2+ 20X3

SUCH THAT
2X1+ 4X2+ 6X3 > 24
3X1+ 9X2+ 6X3 > 30
X1,15X2, X3 > 0

To solve the given linear programming problem (LPP) using the Big M method, we need to
follow these steps:

Step 1: Convert the problem into standard form.

Step 2: Introduce slack, surplus, and artificial variables.
Step 3: Formulate the initial tableau.
Step 4: Perform the iteration steps.
Step 5: Repeat the iteration steps until an optimal solution is obtained.

Let's solve the problem using the Big M method:

Step 1: Convert the problem into standard form:

Minimize Z = 7X1 + 15X2 + 20X3

Subject to:
-2X1 - 4X2 - 6X3 + S1 = -24
-3X1 - 9X2 - 6X3 + S2 = -30
X1, X2, X3, S1, S2 ≥ 0

Step 2: Introduce slack, surplus, and artificial variables:

Minimize Z = 7X1 + 15X2 + 20X3 + 0A1 + 0A2

Subject to:
-2X1 - 4X2 - 6X3 + S1 + 0A1 = -24
-3X1 - 9X2 - 6X3 + S2 + 0A2 = -30
X1, X2, X3, S1, S2, A1, A2 ≥ 0

Step 3: Formulate the initial tableau:

```
Cj X1 X2 X3 S1 S2 A1 A2 Min Ratio
Z | 7 | 0 | 15 | 20 | 0 | 0 | 0 | 0 | 0
-----------------------------------------------------------------------------------
A1 | 0 | -2 | -4 | -6 | 1 | 0 | 1 | 0 | 0
A2 | 0 | -3 | -9 | -6 | 0 | 1 | 0 | 1 | 0
-----------------------------------------------------------------------------------
Zj | 0 | 0 | 0 | 0 | 0 | 0 | M | M |
```

Step 4: Perform the iteration steps:

Iteration 1:
```
 Cj X1 X2 X3 S1 S2 A1 A2 Min Ratio
Z | 7 | 0 | 15 | 20 | 0 | 0 | 0 | 0 | 0
-----------------------------------------------------------------------------------
A1 | 0 | -2 | -4 | -6 | 1 | 0 | 1 | 0 | 0
A2 | 0 | -3 | -9 | -6 | 0 | 1 | 0 | 1 | 0
-----------------------------------------------------------------------------------
Zj | 0 | 0 | 0 | 0 | 0 | 0 | M | M |
```

Choose column X1 as the entering variable and row A1 as the departing variable.

Divide the pivot row (A1) by the pivot element (-2) to make the pivot element equal to 1:
```
Cj X1 X2 X3 S1 S2 A1 A2 Min Ratio
Z | 7 | 0 | 15 | 20 | 0 | 0 | 0 | 0 | 0
-----------------------------------------------------------------------------------
A1 | 0 | 1 | 2 | 3 | -0.5 | 0 | 0.5 | 0 | 0
A2 | 0 | -3 | -9 | -6 | 0 | 1 | 0 | 1 | 0
-----------------------------------------------------------------------------------
Zj | 0 | 6 | 12 | 18 | Iteration 2:
```
Cj X1 X2 X3 S1 S2 A1 A2 Min Ratio
Z | 7 | 0 | 15 | 20 | 0 | 0 | 0 | 0 | 0
-----------------------------------------------------------------------------------
X1 | 0 | 1 | 2 | 3 | -0.5 | 0 | 0.5 | 0 | 0
A2 | 0 | 0 | -3 | 0 | 1.5 | 1 | -1.5 | 1 | 0
-----------------------------------------------------------------------------------
Zj | 0 | 6 | 12 | 18 | 3 | 0 | 3 | 0 |
```

Choose column X2 as the entering variable and row A2 as the departing variable.

Divide the pivot row (A2) by the pivot element (-3) to make the pivot element equal to 1:
```
Cj X1 X2 X3 S1 S2 A1 A2 Min Ratio
Z | 7 | 0 | 15 | 20 | 0 | 0 | 0 | 0 | 0
-----------------------------------------------------------------------------------
X1 | 0 | 1 | 2 | 3 | -0.5 | 0 | 0.5 | 0 | 0
X2 | 0 | 0 | 1 | 0 | -0.5 | -0.33 | 0.5 | -0.33 | 0
-----------------------------------------------------------------------------------
Zj | 0 | 6 | 6 | 18 | 1 | 1.67 | 3 | 1.67 |
```

The solution is not yet optimal since some coefficients in the Zj row are negative.

Iteration 3:
```
 Cj X1 X2 X3 S1 S2 A1 A2 Min Ratio
Z | 7 | 0 | 15 | 20 | 0 | 0 | 0 | 0 | 0
-----------------------------------------------------------------------------------
X1 | 0 | 1 | 2 | 3 | -0.5 | 0 | 0.5 | 0 | 0
X2 | 0 | 0 | 1 | 0 | -0.5 | -0.33 | 0.5 | -0.33 | 0
-----------------------------------------------------------------------------------
Zj | 0 | 6 | 6 | 18 | 1 | 1.67 | 3 | 1.67 |
```

Choose column X3 as the entering variable and row X2 as the departing variable.

Divide the pivot row (X2) by the pivot element (1) to make the pivot element equal to 1:
```
Cj X1 X2 X3 S1 S2 A1 A2 Min Ratio
Z | 7 | 0 | 15 | 20 | 0 | 0 | 0 | 0 | 0
-----------------------------------------------------------------------------------
X1 | 0 | 1 | 0 | 3 | -1.5 | 1 | 0 | 1 | 0
X3 | 0 | 0 | 1 | 0 | -0.5 | -0.33 | 0.5 | -0.33 | 0
-----------------------------------------------------------------------------------
Zj | 0 | 6 | 0 | 18 | 2 | 2.33

The solution is now optimal since all the coefficients in the Zj row are non-negative.

Step 5: Repeat the iteration steps until an optimal solution is obtained.

The optimal solution is:

X1 = 3
X2 = 0
X3 = 0
S1 = 0
S2 = 0
A1 = 1
A2 = 1

The minimum value of Z is 0.

Please note that the Big M method is one of the techniques used to solve linear programming
problems. It involves introducing artificial variables and using a large positive constant (M)
to penalize their presence in the objective function. The method ensures that the artificial
variables will be eliminated from the final optimal solution if they are not essential.