Graph the feasible region. −x + y ≤ 0, x ≤ 5, y ≥ -2 Find all corner points. there is 3 in all. (Order your answers from smallest to largest x, then from smallest to largest y.)
Given,
−x + y ≤ 0,
x ≤ 5,
y ≥ -2
Plotting the above lines -
The grey shaded area is the feasible region
C = [-2, -2]
B = [5, -2]
A = [5, 5]
2. -133.33 points Find the exact extreme values of the function :-} (x,y) - (- 6) + (y-2) + 50 subject to the following constraints: OS:5 18 OSS 13 Start by listing all nine candidates, including their z values, in the form (X,Y.2): First, list the four corner points and order your answers from smallest to largest x, then from smallest to largest y. 3) Next find the critical point. Lastly, find the four boundary points and order your answers...
<11 - 3x + y 2 3 Graph the feasible region for the follow system of inequalities by drawing a polygon around the feasible region. Click to set the corner points. 0 0 10+ 7- 6 4- 3- 2- 1. 7 8 9 10 1 6 Clear All Draw: Polygon
(2 points) Given the system of inequalities below, determine the shape of the feasible region and find the vertices of the feasible region. Give the shape as "triangle", "quadrilateral", or "unbounded". Report your vertices starting with the one which has the smallest x-value. If more than one vertex has the same, smallest x-value, start with the one that has the smallest y-value. Proceed clockwise from the first vertex. Leave any unnecessary answer spaces blank I+y<5 2.1 + y<7 I >...
Graph the feasible region for the follow system of inequalities by drawing a polygon around the feasible region. Click to set the corner points. ( 2x +5g < 4x + 4y < > 30 36 0 HD > 0 - + 5 6 7 8 9 10 Clear All Draw: Polygon Points possible: 3 This is attempt 1 of 3.
(-2<x<3 21 Graph the feasible region for the system-15y 35 (2x + y<6
Given the feasible region ((x, y) -y 0, z 2 0, y 2 0), show that the bounds 2 0 and y 2 0 are both redundant, but that both cannot be removed without altering the feasible region Given the feasible region ((x, y) -y 0, z 2 0, y 2 0), show that the bounds 2 0 and y 2 0 are both redundant, but that both cannot be removed without altering the feasible region
Find the points of inflection of the graph of the function. (Order your answers from smallest to largest x, then from smallest to largest y. If an answer does not exist, enterf(x) = x + cos(x), [0. 2π]Describe the concavity. (Enter your answers using interval notation. If an answer does not exist, enter DNE.)
Feasible region for an optimization problem is given as follows: у D E B A X Coordinates of the corner points are given in below table: Corner Points A B с D E Coordinates X 4 2 8 3 7 6 5 8 5 Find the optimum values of the following objective functions according to the given feasible region: a) min z = 5x +9y b) min z = 2x – 3y c) max z = 3x + 4y max...
The graph to the right shows a region of feasible solutions. Use this region to find maximum and minimum values of the given objective functions, and the locations of these values on the graph. 10- (2, 8) (a) z -6x +9,y (b)2-x + 3y (a) What is the maximum of z 6x+ 9y? Select the correct answer below and, if necessary, fill in the answer boxes to complete your choice. (7, 5) (0 A. The maximum value of the objective...
Solve by Linear Programming. (Be sure to show the graph of the feasible region, the appropriate vertices, optimal value, AND SHOW ALL WORK!.) Exercise 1 LP 1. Maximize: C = x – y Constraints: x ≥ 0, and y ≥ 0 x + 3y ≤ 120 3x + y ≤ 120 Exercise 2 LP 2. Maximize: C = 3x + 4y Constraints: x + y ≤ 10 – x + y ≤ 5 2x + 4y ≤ 32