FFor the Ready Mikks problem, find all the corner-point feasible solutions
FSuppose that another constraint is added to the problem : XE + XI ³ 1, and the problem is changed from maximization to minimization. For this new problem, find the new optimal solution
FDiscuss and answer the following question: Is it possible to get a non-convex feasible region from the addition of a linear constraint?