{"id":226777,"date":"2018-09-17T08:08:43","date_gmt":"2018-09-17T08:08:43","guid":{"rendered":"http:\/\/localhost\/wordpress\/index.php\/2018\/09\/17\/mat-540-week-7-quiz-3-three-sets\/"},"modified":"2018-10-24T08:36:16","modified_gmt":"2018-10-24T08:36:16","slug":"mat-540-week-7-quiz-3-three-sets","status":"publish","type":"post","link":"https:\/\/www.benedictsol.com\/blogs\/mat-540-week-7-quiz-3-three-sets\/","title":{"rendered":"MAT 540 Week 7 Quiz 3 (Three Sets)"},"content":{"rendered":"<p>MAT 540 Week 7 Quiz 3 Set 1 QUESTIONS\tQuestion 1: Graphical solutions to linear programming problems have an infinite number of possible objective function lines.\u00a0\tQuestion 2: The following inequality represents a resource constraint for a maximization problem:\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 X + Y \u2265 20\u00a0\tQuestion 3: In minimization LP problems the feasible region is always below the resource constraints.\u00a0\tQuestion 4: In a linear programming problem, all model parameters are assumed to be known with certainty.\u00a0\tQuestion 5: A feasible solution violates at least one of the constraints.\u00a0\tQuestion 6: If the objective function is parallel to a constraint, the constraint is infeasible.\tQuestion 7: If the objective function is parallel to a constraint, the constraint is infeasible.\tQuestion 8: Cully furniture buys 2 products for resale: big shelves (B) and medium shelves (M). Each \u00a0 \u00a0big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75000 to invest in shelves this week, and the warehouse has 18000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. What is the maximum profit?\tQuestion 9: The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*.\u00a0\t\u00a0Which of the following points are not feasible?\tQuestion 10: The production manager for the Coory soft drink company is considering the production of 2 kinds of soft drinks: regular (R) and diet(D). Two of the limited resources are production time (8 hours = 480 minutes per day) and syrup limited to 675 gallons per day. To produce a regular case requires 2 minutes and 5 gallons of syrup, while a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case. What is the time constraint?\tQuestion 11: The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*.\u00a0\tThe equation for constraint DH is:\tQuestion 12: Which of the following statements is not true?\tQuestion 13: In a linear programming problem, a valid objective function can be represented as\tQuestion 14: The linear programming problem:\tMIN Z = \u00a0 \u00a0 \u00a0 \u00a0 \u00a02&#215;1 + 3&#215;2\u00a0\tSubject to: \u00a0 \u00a0 \u00a0 x1 + 2&#215;2 \u2264 20\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 5&#215;1 + x2 \u2264 40\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 4&#215;1 +6&#215;2 \u2264 60\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 x1 , x2 \u2265 0 ,\tQuestion 15: The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*.\u00a0\tThis linear programming problem is a:\tQuestion 16: A graphical representation of a linear program is shown below. The shaded area represents the feasible region, and the dashed line in the middle is the slope of the objective function.\tIf this is maximization, which extreme point is the optimal solution?\tQuestion 17: Which of the following could be a linear programming objective function?\tQuestion 18: Solve the following graphically\tMax z = \u00a0 \u00a0 3&#215;1 +4&#215;2\u00a0\ts.t. \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 x1 + 2&#215;2 \u2264 16\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 2&#215;1 + 3&#215;2 \u2264 18\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 x1 \u00a0 \u00a0\u2265 2\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0x2 \u00a0 \u00a0\u2264 10\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 x1, x2 \u2265 0\tFind the optimal solution. What is the value of the objective function at the optimal solution? Note: The answer will be an integer. Please give your answer as an integer without any decimal point. For example, 25.0 (twenty five) would be written 25\tQuestion 19: Consider the following linear programming problem:\u00a0\tMax Z = \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 $15x + $20y\u00a0\tSubject to: \u00a0 \u00a0 \u00a0 8x + 5y \u2264 40\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 0.4x + y \u2265 4\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 x, y \u2265 0\u00a0\tAt the optimal solution, what is the amount of slack associated with the first constraint?\u00a0\tQuestion 20: Max Z = \u00a0 \u00a0$3x + $9y\u00a0\tSubject to: \u00a0 \u00a0 \u00a0 20x + 32y \u2264 1600\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 4x + 2y \u2264 240\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 y \u2264 40\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 x, y \u2265 0\u00a0\tAt the optimal solution, what is the amount of slack associated with the second constraint?\t\u00a0\tMAT 540 Week 7 Quiz 3 Set 2 QUESTIONS\u00a0\tQuestion 1: A linear programming problem may have more than one set of solutions.\tQuestion 2: A feasible solution violates at least one of the constraints.\u00a0\tQuestion 3: Graphical solutions to linear programming problems have an infinite number of possible \u00a0objective function lines. \u00a0\tQuestion 4: In a linear programming problem, all model parameters are assumed to be known with certainty.\tQuestion 5: Surplus variables are only associated with minimization problems.\tQuestion 6: A linear programming model consists of only decision variables and constraints.\tQuestion 7: If the objective function is parallel to a constraint, the constraint is infeasible.\tQuestion 8: Cully furniture buys 2 products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75000 to invest in shelves this week, and the warehouse has 18000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. What is the maximum profit?\tQuestion 9: The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*.\u00a0\tThis linear programming problem is a:\tQuestion 10: Decision variables\tQuestion 11: The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*.\u00a0\tWhich of the following points are not feasible?\tQuestion 12: Cully furniture buys 2 products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75000 to invest in shelves this week, and the warehouse has 18000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. What is the objective function?\tQuestion 13: The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*.\u00a0\tThe equation for constraint DH is:\tQuestion 14: The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*.\tWhich of the following constraints has a surplus greater than 0?\tQuestion 15: A graphical representation of a linear program is shown below. The shaded area represents the feasible region, and the dashed line in the middle is the slope of the objective function.\u00a0\tIf this is maximization, which extreme point is the optimal solution?\tQuestion 16: The production manager for the Coory soft drink company is considering the production of 2 kinds of soft drinks: regular (R) and diet (D). Two of her limited resources are production time (8 hours = 480 minutes per day) and syrup (1 of her ingredients) limited to 675 gallons per day. To produce a regular case requires 2 minutes and 5 gallons of syrup, while a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case. What is the objective function?\tQuestion 17: Which of the following could be a linear programming objective function?\tQuestion 18: A graphical representation of a linear program is shown below. The shaded area represents the feasible region, and the dashed line in the middle is the slope of the objective function.\tWhat would be the new slope of the objective function if multiple optimal solutions occurred along line segment AB? Write your answer in decimal notation.\tQuestion 19: Max Z = \u00a0 \u00a0$3x + $9y\u00a0\tSubject to: \u00a0 \u00a0 \u00a0 20x + 32y \u2264 1600\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 4x + 2y \u2264 240\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 y \u2264 40\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 x, y \u2265 0\u00a0\tAt the optimal solution, what is the amount of slack associated with the second constraint?\tQuestion 20: Solve the following graphically\tMax z = \u00a0 \u00a0 3&#215;1 +4&#215;2\u00a0\ts.t. \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 x1 + 2&#215;2 \u2264 16\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 2&#215;1 + 3&#215;2 \u2264 18\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 x1 \u00a0 \u00a0\u2265 2\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0x2 \u00a0 \u00a0\u2264 10\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 x1, x2 \u2265 0\t\u00a0\tFind the optimal solution. What is the value of the objective function at the optimal solution? Note: The answer will be an integer. Please give your answer as an integer without any decimal point. For example, 25.0 (twenty five) would be written 25\tMAT 540 Week 7 Quiz 3 Set 3 QUESTIONS\tQuestion 1: A feasible solution violates at least one of the constraints.\tQuestion 2: A linear programming model consists of only decision variables and constraints.\t\u00a0\tQuestion 3: If the objective function is parallel to a constraint, the constraint is infeasible.\tQuestion 4: In minimization LP problems the feasible region is always below the resource constraints.\tQuestion 5: Surplus variables are only associated with minimization problems.\tQuestion 6: If the objective function is parallel to a constraint, the constraint is infeasible.\tQuestion 7: A linear programming problem may have more than one set of solutions.\tQuestion 8: The production manager for the Coory soft drink company is considering the production of 2 kinds of soft drinks: regular (R) and diet(D). Two of the limited resources are production time (8 hours = 480 minutes per day) and syrup limited to 675 gallons per day. To produce a regular case requires 2 minutes and 5 gallons of syrup, while a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case. What is the time constraint?\tQuestion 9: The production manager for the Coory soft drink company is considering the production of 2 kinds of soft drinks: regular and diet. Two of her limited resources are production time (8 hours = 480 minutes per day) and syrup (1 of her ingredients) limited to 675 gallons per day. To produce a regular case requires 2 minutes and 5 gallons of syrup, while a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case. For the production combination of 135 cases of regular and 0 cases of diet soft drink, which resources will not be completely used?\tQuestion 10: In a linear programming problem, the binding constraints for the optimal solution are:\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 5&#215;1 + 3&#215;2 \u2264 30\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 2&#215;1 + 5&#215;2 \u2264 20\u00a0\tWhich of these objective functions will lead to the same optimal solution?\tQuestion 11: Which of the following statements is not true?\tQuestion 12: The production manager for the Coory soft drink company is considering the production of 2 kinds of soft drinks: regular (R) and diet (D). Two of her limited resources are production time (8 hours = 480 minutes per day) and syrup (1 of her ingredients) limited to 675 gallons per day. To produce a regular case requires 2 minutes and 5 gallons of syrup, while a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case. What is the objective function?\tQuestion 13: The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*.\u00a0\tWhich of the following points are not feasible?\tQuestion 14: Decision variables\tQuestion 15: Cully furniture buys 2 products for resale: big shelves (B) and medium shelves (M). Each big shelf costs $500 and requires 100 cubic feet of storage space, and each medium shelf costs $300 and requires 90 cubic feet of storage space. The company has $75000 to invest in shelves this week, and the warehouse has 18000 cubic feet available for storage. Profit for each big shelf is $300 and for each medium shelf is $150. What is the objective function?\tQuestion 16: Which of the following could be a linear programming objective function?\tQuestion 17: The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z*.\u00a0\tWhich of the following constraints has a surplus greater than 0?\tQuestion 18: A graphical representation of a linear program is shown below. The shaded area represents the feasible region, and the dashed line in the middle is the slope of the objective function. What would be the new slope of the objective function if multiple optimal solutions occurred along line segment AB? Write your answer in decimal notation.\tQuestion 19: Consider the following linear programming problem:\u00a0\tMax Z = \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 $15x + $20y\u00a0\tSubject to: \u00a0 \u00a0 \u00a0 8x + 5y \u2264 40\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 0.4x + y \u2265 4\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 x, y \u2265 0\u00a0\tAt the optimal solution, what is the amount of slack associated with the first constraint?\tQuestion 20: Consider the following minimization problem:\u00a0\tMin z = \u00a0 \u00a0 x1 + 2&#215;2\u00a0\ts.t. \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 x1 + x2 \u2265 300\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 2&#215;1 + x2 \u2265 400\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 2&#215;1 + 5&#215;2 \u2264 750\u00a0\t\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 x1, x2 \u2265 0\u00a0\t\u00a0\tFind the optimal solution. What is the value of the objective function at the optimal solution? Note: The answer will be an integer. Please give your answer as an integer without any decimal point. For example, 25.0 (twenty five) would be written 25<\/p>\n","protected":false},"excerpt":{"rendered":"<p>MAT 540 Week 7 Quiz 3 Set 1 QUESTIONS Question 1: Graphical solutions to linear programming problems have an infinite number of possible objective function lines.\u00a0 Question 2: The following inequality represents a resource constraint for a maximization problem:\u00a0 \u00a0 <a href=\"https:\/\/www.benedictsol.com\/blogs\/mat-540-week-7-quiz-3-three-sets\/\" class=\"read-more\">Read More &#8230;<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[],"tags":[],"class_list":["post-226777","post","type-post","status-publish","format-standard","hentry"],"_links":{"self":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/posts\/226777","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/comments?post=226777"}],"version-history":[{"count":0,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/posts\/226777\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/media?parent=226777"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/categories?post=226777"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/tags?post=226777"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}