2. Let us consider our usual LP in standard inequality form max I: -x subject to A): E b, x E [I with n decision variables and m constraints. We introduce slack variables: that is we rewrite it max c-xn {Primal} (All ] x = b 1:09:32 [1: m 3:3 with 3:5. the decision variables and x3 the slack variables, while 1.11 is the identity matrix. We assmne that this LP has an optimal solution.' we denote by 63,121\