Form the dual maximization problem (Use X1, X2, and X3 as the variables and f as the function.) and use the simplex method to solve the minimization problem. Assume that all variables are nonnegative. 17y1 +16y2, subject to the following. Minimize g = Y1 + y 2 100 2Y1 641 Maximize f= + Y2 140 + 5/2 580 subject to 17 16 X1, X2, X3 0. The minimum value of the objective function is which occurs at (Y Y2) = 1'