Solve linear programming problems using the simplex method and simplex table to find the maximum value of the objective function F(X) = 7.5x1 + 9x2 - 15x3 subject to given constraints