Question 4 a) b) By using the Simplex Method, solve the following linear programming: Maximize Z=7x+5x2+6x3 x1 + x2+x3≤ 11 2x13x2+4x3 ≤ 22 5x17x2+9x3 ≤ 55 ≥0, x2≥0, x3 ≥0 (15 marks) Formulate the dual programming of the above linear programming and determine the optimal objective value of the dual programming. (10 marks)

Fig: 1