Question

pt ASs Extension Requests Total Question123456789 1011 12 13 14 018 1/1 1/11-12|-121-31-61 021-41-12 | -12 |-3 |-7 1-3 i 256 (3.6%) Points @Description This consist of 4.1 and 4.2 8. O 0/2 points Previous Answers TanFin11 4.2.002 Use the technique developed in this section to solve the minimization problem. Minimize Cy subject to x + 2y S 18 3x + 2y S 36 x 2 0, y 2 o The minimum is C at (x, y) - Submit Answer Save Progress O Type here to search

Answer 1

Min C = negative 2 x + y s.t x + 2y lessthanorequalto 18 3x + 2y lessthanorequalto 36 x greaterthanorequalto 0, y greaterthanorequalto 0 Min c = negative 2 x + y + 0s, o s_2 s. t. x + 2 y + s_1 = 18 3x + 2y + s_2 = 36 x, y, s_1, s_2 greaterthanorequalto 0 entering variable (x) Leaving variable (s_2) z_j - c_j lessthanorequalto 0 Optimal solution arrived x = 12, y = 0 min C = negative 2 (12) + 0 = n e24 at (12, 0)