Let X = [−1, 1] C R and consider the functions ₤1, f2 : X → R to be minimised, where f₁(x) = x + x² and f2(x) = x-x² for all x Є X. Solve the tradeoff model minøx µƒ₁(x)+ƒ2(x), for all values of µ ≥ 0. Show your working.

Consider the following linear programming problem: min x1 x2 3x3 − x4 s.t. — 2x1 − x2 − x4 ≤ −6 x1 x2 x3 + 2x4 <4 x1, x2, x3, x4 ≥ 0. (i) Write an equivalent formulation of this problem, to which the primal-dual algorithm can be applied. (ii) Write out the dual problem to the problem, which you formulated in (i). (iii) Solve the problem, which you formulated in (i), by the primal-dual algorithm using the dual feasible solution π = (0, -3). Write a full record of each iteration.

୮ dx L1+zadz 1+x2