Problem 6 (5 points): Assume we are given an LP in the standard form, with A an m x n matrix: min IERn subject to Ar = b (5) 120 Recall that, as we derived in class, the associate dual program can be expressed as: max -by (6) subject to Aly+ c 20 Assume now that the primal LP has a very large number of variables (i.e. n is very large). A friend of yours claims that we can use the following trick to solve this LP more efficiently: She claims that we can consider a subset of ny