Posted: December 30th, 2021
4. Consider the following linear programming problems:A.B.Min 4x + 3×2 + 6.x3Max5x1 + 5×2 + 24x3S.C.s.t.1x, +05x, + 1x, 2: 1515×1 + 4×2 + 12×3 – 28002×2 + 1x, 2: 3015x) + 8×2$ 60001x, + 1x, + 2×3 = 20+ 8×3 = 1200XXX20For each model:a. Write the dual problem.b. Solve the dual for problem A and the primal problem for B.c. Use the dual solution to identify the optimal solution to the original primal problem forA and the contrary for B.d. Verify that the optimal values for the primal and dual problems are equal.
Place an order in 3 easy steps. Takes less than 5 mins.