Given a linear programming problem in the variables n with free variables Pk mk we write the standard form variabl 1 k 1 Pk Mk Xk 1 Xn Xn 1 n s where the final s variables are the slack variables listed in the same order as their corresponding constraints The linear programming problem can be put into the standard form minimize x1 subject to x1 X1 minimize The cost for your standard form solution is Is this solution to your standard form problem feasible No answer given 3x3 2x X2 X3 1 2x2 403 4 x1 x3 0 where in the last line we enclose the comma separated list of standard form variables in square brackets Is 0 1 2 a feasible solution to the original problem No answer given The cost for this solution is A corresponding solution to the standard form problem is the vector subject to 0