The linear programming model has 3 decision variables (X1, X2, X3) and aims to maximize the objective function Z = 2X1 + 5X2 + 3X3 subject to the two constraints of 1) X1 - 2X2 + X3 >= 20 and 2) 2X1 + 4X2 + X3 = 50. The model is solved using the simplex method in two phases to find the optimal solution of X1 = 4, X2 = 7, X3 = 0, Z = 150.
The linear programming model has 3 decision variables (X1, X2, X3) and aims to maximize the objective function Z = 2X1 + 5X2 + 3X3 subject to the two constraints of 1) X1 - 2X2 + X3 >= 20 and 2) 2X1 + 4X2 + X3 = 50. The model is solved using the simplex method in two phases to find the optimal solution of X1 = 4, X2 = 7, X3 = 0, Z = 150.
The linear programming model has 3 decision variables (X1, X2, X3) and aims to maximize the objective function Z = 2X1 + 5X2 + 3X3 subject to the two constraints of 1) X1 - 2X2 + X3 >= 20 and 2) 2X1 + 4X2 + X3 = 50. The model is solved using the simplex method in two phases to find the optimal solution of X1 = 4, X2 = 7, X3 = 0, Z = 150.