(10 points) Linear Programing (SLOI): 4. iven constraints. 2x+Sy subject to the g Graph the Feasible Region, and minimize the quantity z x +2y 21 r +2y s10 2 2x 2 r 20 (10 points) Linear Pro...
Consider the following constraints and the corresponding graph below Constraint 1: 2x-y21 Constraint 2:x+2y S8 Constraint 3: x-3y 2-2 2x-y-1 4 x +2y 8 4 7 a. (3 points) Shade the feasible region in the graph provided above. b. (3 points) The objective function is Minimize 2x-3y. Mark the optimal solution(s) in the above graph Do not calculate the x and y coordinates at optimal solution(s). Draw the optimal objective function line through the optimal solution(s).
4. (hand solution) Use the graphical approach of linear programming to solve this problem; draw a graph and identify the feasible region Maximize f (x, y) = 10x-Sy subject to 4. (hand solution) Use the graphical approach of linear programming to solve this problem; draw a graph and identify the feasible region Maximize f (x, y) = 10x-Sy subject to
L.P. Model: 20- Maximize Subject to: 18- Z= 2X + 8Y 1X + 2Y = 6 5X + 1 Y = 20 X,Y 20 (C1) (C2) 16- 14- On the graph on right, the constraints C, and Cy have been plotted. 12- Using the point drawing tool, plot the four corner points for the feasible area. 10- 8- 6- 4- 2- 0- 0 2 4 6 00- 12 14 16 00 20 10 X
Minimize the objective function 1/2x+3/4y subject to the constraints (In graph form please) 2x+2y>=8 3x+5y>=16 x>=0, y>=0
(-2<x<3 21 Graph the feasible region for the system-15y 35 (2x + y<6
Consider the following constraints and the c g graph below: Constraint L:4x-y21 Constraint 2: x+ys4 Constraint 3:-x-4y 2-8 x, y20 4x-y=1 x-4y -8 a. (2 points) Shade the feasible region in the graph provided above. b. (1 point) For this part only the objective function is Minimize -2x + y. Which of the following describes the optimal solution? (Put a check next to your answer) Infeasible solution Unique optimal solution the point (4,0) minimizes the LP Alternate optimal solution Unbounded...
-/2 POINTS MY NOTES ASK YOUR TEACHER Solve the following linear programming problem. Restrict x 20 and y 2 0. Maximize f = 3x + 4y subject to x + y s 9 2x + y s 14 y s6. (x, y) = ( ) -/2 POINTS MY NOTES ASK YOUR TEACHER Solve the following linear programming problem. Restrict x 2 0 and y 2 0. Minimize g = 6x + 8y subject to the following. 5x + 2y >...
2. (20 marks) (a) Calculate the surface area of the graph of f(x,y) = x + 20y over the region R= {(x,y) e R2:1 < x < 4,2 sy s 2x} in the xy-plane. OV (b) Integrate the function g(x, y, z) = x +y +z over the surface that is described as follows: x = 2u – v, y = v + 2u, z= v – u Here u € [0,20), v € [0,21].
QUESTION 1 Given the following LP, answer questions 1-10 Minimize -3x15x2 Subject to: 3x2x 24 2x1+4x2 2 28 2s 6 x1, x2 20 How many extreme points exist in the feasible region for this problem? We cannot tell from the information that is provided The feasible e region is unbounded QUESTION 2 Given the following LP, answer questions 1-10 Minimize 2- 31+5x2 Subject to: 3x2x 24 2x1+4x2228 t is the optimal solution? (2, 6) (0, 12) (5,4.5) None of the...
1. Solving the linear programming problem Maximize z 3r1 2r2 3, subject to the constraints using the simplex algorithm gave the final tableau T4 T5 #210 1-1/4 3/8-1/812 0 0 23/4 3/8 7/8 10 (a) (3 points) Add the constraint -221 to the final tableau and use the dual simplex algorithm to find a new optimal solution. (b) (3 points) After adding the constraint of Part (a), what happens to the optimal solution if we add the fourth constraint 2+...