Math Question: The linear programming problem is given: (c,x) --> min, Ax = b, x>=0. Find out, whether x0 is an optimal solution for this problem. If not - find one, or proof that the goal function is unbounded.