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