Answer Happy

3 (a) Use the separable programming technique to formulate an approximate linear programming model for the following problem. Use x₁, x2 = 0, 1, 2, 3 as the breakpoints of the piecewise linear functions. [10] Max z = 3.6x₁ + 4x₂ - x² = x² Subject to -X1X₂ −1 -x1 + x₂ ≤ 1 X₁ < 2 x₁ ≥ 0, x₂ ≥ 0. (b) Show that if the slack varaibles are taken as the initial basic variables for the approximation problem, then the basic solution is infeasible. [5] (c) Formulate the auxiliary problem for finding an initial basic feasible solu- tion for the approximation problem. [5]