Question 2 (1 point) Producing a bookshelf requires 10 boards and 18 screws. Producing a TV stand requires 7 boards and 16 screws. Each bookshelf yields $22 profit, and each TV stand yields $26 profit. There are 55 boards and 180 screws available. Find the number of bookshelves and number of TV stands to produce to maximize profit? Let X represent the number of bookshelves and Y represent the number of TV stands. What is the objective function of the Linear Programming model for the situation above? 0 Maximize 22X + 26Y O Maximize 26X + 22Y 0 None of the answers provided is correct. 0 Minimize 22X + 26Y Question 3 (1 point) Producing a bookshelf requires 10 boards and 18 screws. Producing a TV stand requires 7 boards and 16 screws. Each bookshelf yields $22 profit, and each TV stand yields $26 profit. There are 55 boards and 180 screws available. Find the number of bookshelves and number of TV stands to produce to maximize profit? Let X represent the number of bookshelves and Y represent the number of TV stands. What are the resource inequalities for the situation above? 10X+7Y522;18X+16Y226;X20;Y20 10X+7Ys55;18X+16Y5180;X20;Y20 10X+18Y355;7X+16Y5180;X20;Y20 0 None of the answers provided is correct. Question 4 (1 point) Let X represent the number of oil changes and Y represent the number of tire rotations. Each oil change takes 19 minutes; and each tire rotation takes 15 minutes. There are 4000 minutes available. Which of the following inequalities represents the constraint above? 0 None of the answers provided is correct. 0 15X + 19V 5 4000 O 19X + 15V 2 4000 O 19X + 15V 5 4000 Question 5 (1 point) Which of the following statements is not true 0 The term slack is associated with "greater than or equal" constraints. 0 The term slack is associated with "less than or equal" constraints. 0 The term surplus is associated with "greater than or equal" constraints. 0 Slack represents the amount of resource that is not used. Sensitivity report Use the sensitivity report below from an LP problem to answer questions 6 to 10. b 6 Variable Cells 7 Final Reduced Objective Allowable Allowable 8 Cell Name Value Cost Coefficient Increase Decrease 9 $883 :1 3 0 34 6 7.333333333 10 $C$3 x2 6 0 40 11 6 11 12 Constraints 13 Final Shadow Constraint Allowable Allowable 14 Cell Name Value Price R.H. Side Increase Decrease 15 $0510 Extrusion Used 48 3 48 6 8 16 $0511 Packaging Used 18 11 18 2 2 17 $0512 Additive Used 12 O 16 1E+30 4 18 Question 6 (1 point) The optimal solution to this linear programing model is Ox1=0,x2=0. Qx1=34,x2=40. Ox1=3,x2=6. Ox1=6,x2=11. Question 7 (1 point) Which of the following constraints are binding? 0 Additive only 0 Extrusion and Packaging O Packing only 0 Extrusion only Question 8 (1 point) What is the increase in the objective function value if 2 units of extrusion are added? Question 9 (1 point) What is the increase in the objective function value if 2 units of packaging are added? 022 0 Not enough information provided 018 011 Question 10 (1 point) What is the increase in the objective function value if 2 units of additive is added