Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2020/ib/paper-1/7h/solution

Write the absolute-value constraint as
Introduce slacks . In the simplex algorithm, let enter and leave, then let enter and leave. The final dictionary is
Thus
For sufficiently small perturbations, the same two constraints remain active:
Solving gives
and therefore the perturbed optimal value is

New to topics? Read the docs here!