Consider the linear programming problem Let be the artificia

Consider the linear programming problem Let be the artificial variables, and suppose that at the end of phase 1 a basic feasible solution to the problem has been found (no artificial variables are in the basis). Prove that, in the final phase-1 basis, the reduced costs are zero for the original variables and are one for the artificial variables.