Solve the following linear programming model using the simplex method:
maximize Z = 100x1 + 20x2 + 60x3
subject to
x3 smaller than or equal to 40
2x1 + 2x2 + 2x3 smaller than or equal to 100
3x1 + 5x2 smaller than or equal to 60
x1, x2, x3 bigger than or equal to 0
Solution:
subject to
The problem is converted to canonical form by adding slack, surplus, and artificial variables as appropriate
1. As the constraint-1 is of type '≤' we should add slack variable
2. As the constraint-2 is of type '≤' we should add slack variable
3. As the constraint-3 is of type '≥' we should subtract surplus variable and add artificial variable
After introducing slack, surplus, artificial variables
subject to
Negative minimum is and its column index is 2 . So, the entering variable is
The minimum ratio is 12 and its row index is 3. So, the leaving basis variable is .
Therefore, the pivot element is 5 .
Entering , Departing , Key Element =5
Similarly, we have iteration 2, 3, 4, and 5 as follows:
Since all
Hence, optimal solution is arrived with value of variables as :
Max Z=5000
Comments