Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2001/ib/paper-3/15d/solution

Use the original PDF constraints, whose right sides are and . Introduce nonnegative surplus variables , slack , and artificial variables :
All seven variables are nonnegative. Phase I of the two-phase simplex method minimizes with initial basis . The initial simplex dictionary is
Enter and leave : the ratio test gives . Substituting gives
Now enter and leave . The bounds from are , so the ratio test selects . The new dictionary is
The associated basic solution has and , which is a global minimum because artificial variables are nonnegative. Delete their columns for Phase II. In the remaining basis the objective is
For , both reduced costs are nonnegative, so the simplex method has reached the optimum at :
For , the coefficient of is negative. Enter ; the ratio test gives from and from , so leaves. Eliminating gives
and hence
The two reduced costs are now positive, so is optimal and
At the whole feasible edge from to is optimal; both value formulas agree. These dictionaries explicitly carry out both phases rather than inferring the answer solely from a feasible-region sketch.

New to topics? Read the docs here!