U can skip the argument part
Problem 1. Change the objective function in the LP we discussed in class to Z-5x_1 +3x 2, and keep all the constraints the same. (1) Show the geometric view of the optimal solution, e.g., where is the optimal solution, state how you check the optimality condition; (2) Write down the augmented form of this linear programming problem; (3) Solve this LP using the simplex tabular form with all the iterations
