{"id":226871,"date":"2018-09-17T08:11:46","date_gmt":"2018-09-17T08:11:46","guid":{"rendered":"http:\/\/localhost\/wordpress\/index.php\/2018\/09\/17\/math-540-quiz-3-7\/"},"modified":"2018-10-24T08:46:52","modified_gmt":"2018-10-24T08:46:52","slug":"math-540-quiz-3-7","status":"publish","type":"post","link":"https:\/\/www.benedictsol.com\/blogs\/math-540-quiz-3-7\/","title":{"rendered":"MATH 540 quiz 3 (7)"},"content":{"rendered":"<p>Question 1\t\u00a0\tA linear programming model consists of only decision variables and constraints.\t\u00a0\tQuestion 2\t\u00a0\tIn a linear programming problem, all model parameters are assumed to be known with certainty.\u00a0\t\u00a0\tQuestion 3\t\u00a0\tA linear programming problem may have more than one set of solutions.\t\u00a0\tQuestion 4\t\u00a0\tIn minimization LP problems the feasible region is always below the resource constraints.\u00a0\t\u00a0\tQuestion 5\t\u00a0\tA feasible solution violates at least one of the constraints.\u00a0\t\u00a0\tQuestion 6\t\u00a0\tIf the objective function is parallel to a constraint, the constraint is infeasible.\t\u00a0\tQuestion 7\t\u00a0\tGraphical solutions to linear programming problems have an infinite number of possible objective function lines.\u00a0\t\u00a0\tQuestion 8\t\u00a0\t) Which of the following could be a linear programming objective function?\t\u00a0\t\u00a0\tQuestion 9\t\u00a0\tThe 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?\t\u00a0\tQuestion 10\t\u00a0\tIn a linear programming problem, a valid objective function can be represented as\t\u00a0\tQuestion 11\t\u00a0\tCully 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?\t\u00a0\tQuestion 12\t\u00a0\tThe 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\u00a0\tWhich of the following constraints has a surplus greater than 0?\t\u00a0\tQuestion 13\t\u00a0\tWhich of the following statements is not true?\t\u00a0\tQuestion 14\t\u00a0\tCully 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?\t\u00a0\tQuestion 15\t\u00a0\tThe 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?\t\u00a0\tQuestion 16\t\u00a0\tThe 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\u00a0\tThe equation for constraint DH is:\t\u00a0\t\u00a0\tQuestion 17\t\u00a0\tA 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.\t\u00a0\tIf this is a maximization, which extreme point is the optimal solution?\t\u00a0\t\u00a0\tQuestion 18\t\u00a0\tA 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.\t\u00a0\tWhat would be the new slope of the objective function if multiple optimal solutions occurred along line segment AB? Write your\u00a0\u00a0 in decimal notation.\t\u00a0\t\u00a0\t\u00a0\tEvaluation Method\u00a0\u00a0\u00a0\u00a0 Correct\u00a0  \ufffd\u00a0\u00a0\u00a0\u00a0 Case Sensitivity\t\u00a0Exact Match\u00a0\u00a0 -1.5 \ufffd\t\u00a0Exact Match\u00a0\u00a0 &#8211; 1.5\u00a0\u00a0\u00a0\u00a0\t\u00a0\tQuestion 19\t\u00a0\tMax Z =\u00a0\u00a0\u00a0 $3x + $9y\tSubject to: \ufffd\u00a0 20x + 32y \u2264 1600\t \ufffd \ufffd \ufffd \ufffd\u00a0\u00a0\u00a0 4x + 2y \u2264 240\t \ufffd \ufffd \ufffd \ufffd\u00a0\u00a0\u00a0 y \u2264 40\t \ufffd \ufffd \ufffd \ufffd\u00a0\u00a0\u00a0 x, y \u2265 0\tAt the optimal solution, what is the amount of slack associated with the second constraint?\t\u00a0\t\u00a0\tEvaluation Method\u00a0\u00a0\u00a0\u00a0 Correct\u00a0  \ufffd\u00a0\u00a0\u00a0\u00a0 Case Sensitivity\t\u00a0Exact Match\u00a0\u00a0 96 \ufffd\u00a0\u00a0\t\u00a0\tQuestion 20\t\u00a0\tSolve the following graphically\tMax z =\u00a0\u00a0\u00a0\u00a0 3&#215;1 +4&#215;2\ts.t. \ufffd \ufffd\u00a0\u00a0 x1 + 2&#215;2 \u2264 16\t \ufffd \ufffd \ufffd\u00a0\u00a0 2&#215;1 + 3&#215;2 \u2264 18\t \ufffd \ufffd \ufffd\u00a0\u00a0 x1\u00a0\u00a0\u00a0 \u2265 2\t \ufffd \ufffd \ufffd\u00a0\u00a0\u00a0 x2\u00a0\u00a0\u00a0 \u2264 10\t \ufffd \ufffd \ufffd\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\u00a0\u00a0 will be an integer. Please give your\u00a0\u00a0 as an integer without any decimal point. For example, 25.0 (twenty five) would be written 25\t\u00a0\t\u00a0\tEvaluation Method\u00a0\u00a0\u00a0\u00a0 Correct\u00a0  \ufffd\u00a0\u00a0\u00a0\u00a0 Case Sensitivity\t\u00a0Exact Match\u00a0\u00a0 27<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Question 1 \u00a0 A linear programming model consists of only decision variables and constraints. \u00a0 Question 2 \u00a0 In a linear programming problem, all model parameters are assumed to be known with certainty.\u00a0 \u00a0 Question 3 \u00a0 A linear programming <a href=\"https:\/\/www.benedictsol.com\/blogs\/math-540-quiz-3-7\/\" 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-226871","post","type-post","status-publish","format-standard","hentry"],"_links":{"self":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/posts\/226871","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=226871"}],"version-history":[{"count":0,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/posts\/226871\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/media?parent=226871"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/categories?post=226871"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/tags?post=226871"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}