CUET Mathematics - If the corner points of the bounded feasible region of a Linear Programming Problem are (0, 2), (3, 0), (6, 0), (6, 8) and (0, 5), then the minimum value of the objective function z = 2x+3y occurs at | PYQs + Solutions | AfterBoards