Form the dual maximization problem Use X X2 and x3 as the

Last updated: 7/1/2023

Form the dual maximization problem Use X 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 Minimize g 16y 15y2 subject to the following Y1 y 100 2y1 y 2 140 6y 5y 2 580 Maximize f 16 S 15 subject to X1 X2 X3 0 The minimum value of the objective function is which occurs at y