Prepare a graph of the constraints and objective function and solve the following linear programming problem: Maximize: f=2x₁-x₂ Subject to constraint 1: x₁ + x₂ > 2 constraint 2: x₁ + x₂ ≤5 constraint 3: x₁-x, sl constraint 4: -x₁ + x₂ ≤4 constraint 5: x, 20 constraint 6: x₂ 20 Hints: Draw the line of each constraint on the graph below (two constraints are already drawn) After drawing all the lines shade the optimal region. Try f-0, f=2 and f-4. Which one is the optimum, and what are the values of x1 and x₂? -4 -3 constraint2 -2 -6- -1 5 -4- 3 2 1 -2 -3- بنا x₂ 0 constraint4 1 2 3 4 5 6 X₁

دما Identify the feasible region for the following set of constraints: 2A IB≤ 0 -1A + 1.5B ≤ 200 A, B≥ 0

Find the minimum and maximum values of z = 6x + 5y, if possible, for the following set of constraints. x+y≤6 -x+y≤4 2x - y ≤ 10 Select the correct choice below and, if necessary, fill in the answer box to complete your choice. A. The minimum value is B. There is no minimum value. (Round to the nearest tenth as needed.) Select the correct choice below and, if necessary, fill in the answer box to complete your choice. OA. The maximum value is (Round to the nearest tenth as needed.) B. There is no maximum value.

Use the graphing tool to graph in equality and the boundary lines representing the nonnegative constraints.