webapps/assessment/take/launch.jsp?course_assessment_id=_70661_1&course_id=_248778_1&content_id=_1745072_1&step=null 9 Maps 1 The following linear programming model is solved graphically: Maximize Z-4x1 + 5x2 subject to: X1 +2x2 5 10 *1 + x2 56 X1, X220 The obtained optimal solution is (2, 4). We want to add a new constraint x1 5 4. Without solving the new linear programming model, the corresponding new optimal solution Become (4,2) O Remain the same equal to (2, 4) Become (4,4) O Impossible to know the result directly, we must redo the resolution