In Problem, a minimization problem, the corresponding dual problem, and the final simplex tableau in the solution of the dual problem are given.
(A) Find the optimal solution of the dual problem.
(B) Find the optimal solution of the minimization problem.
Minimize subject to
C = 16x1 + 25x2
3x1 + 5x2 ≥ 30
2x1 + 3x2 ≥ 19
x1, x2 ≥ 0
Maximize subject to
P = 30y1 + 19y2
3y1 + 2y2 ≤ 16
5y1 + 3y2 ≤ 25
y1,y2 ≥ 0