For the feasible set in the figure to the right, determine x and y so that the objective function 3x+4y is maximized
Enter your answer in each of the answer boxes
plotting of line intersects at 2 point : (20,0), (0,20)
we have to put values in the objective function to determine the maximum value
put (20,0) in objective function = 3(20) + 4(0) = 60
put (0,20) in objective function = 3(0) + 4(20) = 80
as maximum value =80
the value of x= 0 and y =20
answer : x =0, y=20
For the feasible set in the figure to the right, determine x and y so that...
3. Consider the linear programming problem with objective function Q = 4x – 3y and constraints: 9x + 4y > 180, 3x + 8y > 120, 0 < x < 35, y > 0. Graph all constraints and show the feasible region and all corner points. Can the objective function be maximized? If so, find the maximum value of Q.
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...
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+9y (b)2-x + 3y (7, 5) (0 어 (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. A. The maximum value of the...
Match the following terms to their definition Feasible region Binding constraint [Choose] [Choose A feasible solution for which there are no other feasible points with a better objective function value in the entire feasible region. The change in the optimal objective function value per unit increase in the right-hand side of a constraint Restrictions that limit the settings of the decision variables A controllable input for a linear programming model The expression that defines the quantity to be maximized or...
Solve the LP problem. If no optimal solution exists, indicate whether the feasible region is empty or the objective function is unbounded. HINT [See Example 1.] (Enter EMPTY if the region is empty. Enter UNBOUNDED if the function is unbounded.) a)Maximize p = 3x + 2y subject to −4x+y≥10 x+3y≤12 x ≥ 0, y ≥ 0 p= (x,y)= b) Maximize and minimize p = x + 2y subject to x + y ≥ 6 x + y ≤ 8 x...
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 13 (0, 10) (a) z 0.40x 0.25y (b) z- 1.75x +0.75y (3, 7) (a) What is the maximum of z=0.40x + 0.25y? Select the correct answer below and, if necessary, fill in the answer boxes to complete your choice 0 A. The maximum value of the...
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. АУ 13-1 (0, 11) (a) z = 0.40x + 1.50y (b) z = 2.50x + 0.50y (5,8) (a) What is the maximum of z = 0.40x + 1.50y? Select the correct answer below and, if necessary, fill in the answer boxes to complete your choice. (8,4)...
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...
10) Determine whether the matrix operator is invertible, if so, find its inverse. a)T(x, y) = (3x + 4y, 5x + 7y) b)T(x1, X2 X3) = (x; + 2x2 + 3x3, xz – X3, X; +3x2 + 2x3)
Determine the domain of the function of two variables f left parenthesis x comma y right parenthesisf(x,y)equals=StartRoot y minus 3 x EndRooty−3x.