A primal linear program has the form:minx∈Rnc⊺xsubject toAx≥bmin𝑥∈𝑅𝑛𝑐⊺𝑥subject to𝐴𝑥≥𝑏where A𝐴 is an m×n𝑚×𝑛 matrix. The dual linear program has the form:maxy∈Rmb⊺ysubject to{Dy=cy≥0max𝑦∈𝑅𝑚𝑏⊺𝑦subject to{𝐷𝑦=𝑐𝑦≥0Which of the following is a correct expression for the matrix D𝐷?Question 3Answera.D=I𝐷=𝐼b.D=A⊺𝐷=𝐴⊺c.D=A𝐷=𝐴d.D=A+bc⊺

For a primal-dual pair of linear programs (where the primal is a minimisation problem and the dual is a maximisation problem), you are told that the optimal value of the dual linear program is 22. Which of the following statements is true?Question 1Answera.The primal linear program is infeasible.b.Any feasible point of the dual linear program has value at least 22.c.The primal linear program is unbounded.d.Any feasible point of the primal linear program has objective value of at least 22.

state the weak duality theorem (1 mark)ii) Write the dual of the given primal problem.Min W=10y1 − 15y2Subject toy1 − 4y2 ≥ 3y1 + y2 ≥ 53y1 − 2y2 = 7y1, y2 ≥ 0 (2 marks)iii) Given the linear programming problemMax z = 15y1 + 25y2Subject toy1 + y2 ≤ 450y2 ≤ 3504y1 + 5y2 ≤ 2000y1 ≤ 350y1, y2 ≥ 0Find the range of optimality of y1, y2. (3 marks)Will the optimal basis change when the objective function coefficient of y1, y2change to 17 and 24 respectively? (2 marks)

Write the dual of the following linear programming problem:Maximize 8x1 + 3x2 − 2x3subject to x1 − 6x2 + x3 > 25x1 + 7x2 − 2x3 = −4x1 ≤ 0, x2 ≥ 0, x3 unrestricted.

Consider the quadratic program minx1,x2f(x1,x2)subject toCx≥dmin𝑥1,𝑥2𝑓(𝑥1,𝑥2)subject to𝐶𝑥≥𝑑where C𝐶 is a 5×25×2 matrix and d𝑑 is a length 5 vector. (c) How many variables does the dual quadratic program have? Answer 4 Question 1(d) What is the value of the dual quadratic program at the point y=0𝑦=0?

onsider the following primal problem:max z = −40x1 − 30x2 − 20x3s.t.10x1 + 3x2 + 5x3 ≤ 104x1 + 10x2 + 4x3 ≤ 15x1, x2, x3 ≥ 0 .(i) State its dual problem, and find the optimal solution of the latter using the SimplexMethod