If cx = x, + x2 + 3x3 is minimized subject to x1 + x2 + x3 = 1, x2 0, show that two corners of the feasible set give the same minimum cx = 1. Find all solutions x, and explain geometrically how more than one solution is possible. %3D %3|