Provided any linear program and its feasible region S, illustrate that for every vertex x in S there is linear form f such that x is unique optimal solution when we minimize f over S. Create the convex set S and vertex x for which there is no fuch f.