Question 1: Consider the linear programming problem: max: 14x1 + 11x2 + 3x3 s.t. 19x1 + 19x2 + 19x3

Question 1: Consider the linear programming problem: max: 14x1 + 11x2 + 3x3 s.t. 19X1 19X2 + 19X3 39 + 15X3 29 3X1 14X2 + 15X3 2 10 20 Convert the problem into standard form and identify an initial BFS using as few artificial variables as possible set up phase I of the problem You do not need to use the simplex method to solve the resulting phase I problem.