Question: Hello! please answer all questions clearly please its sometimes hard to understand the experts please thank you! Use the following scenario and data for questions

Hello! please answer all questions clearly please its sometimes hard to understand the experts please thank you!
Hello! please answer all questions clearly please
Hello! please answer all questions clearly please
Hello! please answer all questions clearly please
Hello! please answer all questions clearly please
Hello! please answer all questions clearly please
Hello! please answer all questions clearly please
Hello! please answer all questions clearly please
Hello! please answer all questions clearly please
Hello! please answer all questions clearly please
Hello! please answer all questions clearly please
Hello! please answer all questions clearly please
Hello! please answer all questions clearly please
Use the following scenario and data for questions 11 to 20 The following linear programming problem can be solved with the graphic method. The lines for the constraints have been drawn. You are required to finish the graph and then answer the following questions. min 4x + 20 x2 Sili 7x + 2 xz 214 5x + 6x2 2 30 2x: + 10 x 220 Xtz 20 X 10 9 8 7 6 5 4 3 3 4 7 8 9. 2 7.44+2 xy - 14 5 6 5 +6 - 30 10 11 2 x + 10x = 20 QUESTION 11 The point (1, 4) satisfies O none of the constraints. O he first and second constraints but not the third. O the first and third constraints but not the second. O the second and third constraints but not the first. all three constraints. Assigning a value of 20 to the objective function, i.e., making 4X1 +20X2 =20 the line for the objective function goes through the following two points O (1.0) and (5,0) O (0, 1) and (0,5) O (1.0) and (0,5). O (5,0) and (0, 1) O none of the above QUESTION 13 The feasible region of this problem O is unbounded. O is a straight line segment. contains the origin. O all of the above. O none of the above. QUESTION 14 This problem O does not have a feasible solution. O has alternative optimal solutions. O has an unbounded objective function. O has a unique, i.e., a single, optimal solution. O none of the above. QUESTION 15 The point (90/19, 20/19) is O feasible but not optimal. O infeasible. O optimal. O not an intercept point. O none of the above. QUESTION 16 The point (6, 3) is O feasible. O not on the boundary of the feasible region. not optimal. O all of the above. none of the above. QUESTION 17 The point (3, 1) satisfies O the first constraint but not the other two. O the second constraint but not the other two. O the third constraint but not the other two. O all three constraints. none of the above. QUESTION 18 The point (10,0) is feasible but not optimal. O an optimal solution. O infeasible. O not on the boundary of the feasible region. none of the above. QUESTION 19 The value of the objective function at the point (90/19, 20/19) is 40 O 360/19 400/19 O not determined O none of the above QUESTION 20 The optimal objective function value is O 4 O 20 0 40 80 O cannot be determined

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!