Consider the problem of minimizing c/x over a polyhedron P. Prove the following: (a) A feasible solution x is optimal if and only if c' d ;::: 0 for every feasible direction d at x. (b) A feasible solution x is the unique optimal solution if and only if c' d > 0 for every nonzero feasible direction d at x.