{"id":47811,"date":"2022-04-02T02:29:45","date_gmt":"2022-04-02T02:29:45","guid":{"rendered":"https:\/\/assignmenttutors.net\/blog\/mat540-quiz-3-mathematics-homework-help\/"},"modified":"2022-04-02T02:29:45","modified_gmt":"2022-04-02T02:29:45","slug":"mat540-quiz-3-mathematics-homework-help","status":"publish","type":"post","link":"https:\/\/assignmenttutors.net\/blog\/mat540-quiz-3-mathematics-homework-help\/","title":{"rendered":"Mat540 quiz 3 | Mathematics homework help"},"content":{"rendered":"
\n

Quiz 3<\/p>\n

Question 1\u00a0<\/span><\/p>\n

\u00a0\u00a0Surplus variables are only associated with minimization problems.\u00a0<\/span><\/p>\n

\u00a0<\/p>\n

\u00a0Question 2\u00a0<\/span><\/p>\n

\u00a0\u00a0A feasible solution violates at least one of the constraints.\u00a0<\/span><\/p>\n

\u00a0\u00a0<\/p>\n

\u00a0Question 3\u00a0<\/span><\/p>\n

\u00a0\u00a0A linear programming model consists of only decision variables and constraints.\u00a0<\/span><\/p>\n

\u00a0<\/p>\n

\u00a0Question 4\u00a0<\/span><\/p>\n

\u00a0\u00a0Graphical solutions to linear programming problems have an infinite number of possible objective function lines.\u00a0<\/span><\/p>\n

\u00a0<\/p>\n

\u00a0Question 5 \u00a0<\/p>\n

\u00a0\u00a0If the objective function is parallel to a constraint, the constraint is infeasible.\u00a0<\/span><\/p>\n

\u00a0\u00a0<\/p>\n

\u00a0Question 6\u00a0<\/span><\/p>\n

\u00a0\u00a0A linear programming problem may have more than one set of solutions.\u00a0<\/span><\/p>\n

\u00a0<\/p>\n

\u00a0Question 7\u00a0<\/span><\/p>\n

\u00a0\u00a0In minimization LP problems the feasible region is always below the resource constraints.<\/p>\n

Question 8 \u00a0<\/p>\n

\u00a0\u00a0The 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 This linear programming problem is a:<\/p>\n

\u00a0\u00a0<\/p>\n

\u00a0Question 9 \u00a0<\/p>\n

\u00a0\u00a0The 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 The equation for constraint DH is:<\/p>\n

\u00a0\u00a0<\/p>\n

\u00a0Question 10 \u00a0<\/p>\n

\u00a0\u00a0The 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 Which of the following constraints has a surplus greater than 0?<\/p>\n

\u00a0\u00a0<\/p>\n

\u00a0Question 11\u00a0<\/p>\n

\u00a0\u00a0Which of the following statements is not true?<\/p>\n

\u00a0\u00a0<\/p>\n

\u00a0Question 12 \u00a0<\/p>\n

\u00a0\u00a0Decision variables<\/p>\n

Question 13 \u00a0<\/p>\n

\u00a0\u00a0The 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?<\/p>\n

\u00a0<\/p>\n

\u00a0Question 14 \u00a0<\/p>\n

\u00a0\u00a0The 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?<\/p>\n

\u00a0<\/p>\n

\u00a0Question 15 \u00a0<\/p>\n

\u00a0\u00a0The 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?<\/p>\n

\u00a0<\/p>\n

\u00a0Question 16 \u00a0<\/p>\n

\u00a0\u00a0Cully 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?<\/p>\n

\u00a0\u00a0<\/p>\n

\u00a0Question 17 \u00a0<\/p>\n

\u00a0\u00a0Cully 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 storage space constraint?<\/p>\n

\u00a0<\/p>\n

\u00a0Question 18 \u00a0<\/p>\n

\u00a0\u00a0A 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 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.\u00a0<\/span><\/p>\n

\u00a0\u00a0<\/p>\n

\u00a0Question 19 \u00a0<\/p>\n

\u00a0\u00a0Solve the following graphicallyMax z = 3×1 +4×2 s.t. x1 + 2×2 \u2264 16 2×1 + 3×2 \u2264 18 x1 \u2265 2 x2 \u2264 10 x1, x2 \u2265 0Find 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\u00a0<\/span><\/p>\n

\u00a0<\/p>\n

\u00a0Question 20 \u00a0<\/p>\n

\u00a0\u00a0Consider the following minimization problem: Min z = x1 + 2×2 s.t. x1 + x2 \u2265 300 2×1 + x2 \u2265 400 2×1 + 5×2 \u2264 750 x1, x2 \u2265 0 Find 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<\/div>\n","protected":false},"excerpt":{"rendered":"

Quiz 3 Question 1\u00a0 \u00a0\u00a0Surplus variables are only associated with minimization problems.\u00a0 \u00a0 \u00a0Question 2\u00a0 \u00a0\u00a0A feasible solution violates at least one of the constraints.\u00a0 \u00a0\u00a0 \u00a0Question 3\u00a0 \u00a0\u00a0A linear programming model consists of only decision variables and constraints.\u00a0 \u00a0 \u00a0Question 4\u00a0 \u00a0\u00a0Graphical solutions to linear programming problems have an infinite number of possible objective […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[16],"tags":[],"class_list":["post-47811","post","type-post","status-publish","format-standard","hentry","category-education"],"_links":{"self":[{"href":"https:\/\/assignmenttutors.net\/blog\/wp-json\/wp\/v2\/posts\/47811","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/assignmenttutors.net\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/assignmenttutors.net\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/assignmenttutors.net\/blog\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/assignmenttutors.net\/blog\/wp-json\/wp\/v2\/comments?post=47811"}],"version-history":[{"count":0,"href":"https:\/\/assignmenttutors.net\/blog\/wp-json\/wp\/v2\/posts\/47811\/revisions"}],"wp:attachment":[{"href":"https:\/\/assignmenttutors.net\/blog\/wp-json\/wp\/v2\/media?parent=47811"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/assignmenttutors.net\/blog\/wp-json\/wp\/v2\/categories?post=47811"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/assignmenttutors.net\/blog\/wp-json\/wp\/v2\/tags?post=47811"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}