Consider the linear system Ax = b, x ≥ 0 given by −x1 + 2x2 = −1 2x1 − x2 = 0 zx1, x2, ≥ 0 Draw the polyhedral cone C = {Ax | x ≥ 0}. What is the point u − b in C closest to b? What is u? Prove that...

Consider the linear system Ax = b, x ≥ 0 given by

−x1 + 2x2 = −1

2x1 − x2 = 0

zx1, x2, ≥ 0

Draw the polyhedral cone C = {Ax | x ≥ 0}. What is the point u − b in C

closest to b? What is u? Prove that the linear system is infeasible.