{"id":226873,"date":"2018-09-17T08:11:49","date_gmt":"2018-09-17T08:11:49","guid":{"rendered":"http:\/\/localhost\/wordpress\/index.php\/2018\/09\/17\/math-540-quiz-4-chp-3\/"},"modified":"2018-10-24T08:46:31","modified_gmt":"2018-10-24T08:46:31","slug":"math-540-quiz-4-chp-3","status":"publish","type":"post","link":"https:\/\/www.benedictsol.com\/blogs\/math-540-quiz-4-chp-3\/","title":{"rendered":"MATH 540 Quiz 4 Chp. 3"},"content":{"rendered":"<p>&#8220;\ufffd \ufffd \ufffd Question 1\t\u00a0\tA systematic approach to model formulation is to first construct the objective function before determining the decision variables.\u00a0\t\u00a0\t&#8220;\ufffd \ufffd \ufffd Question 2\t\u00a0\tA constraint for a linear programming problem can never have a zero as its right-hand-side value.\t\u00a0\t\u00a0\t&#8220;\ufffd \ufffd \ufffd Question 3\t\u00a0\tProduct mix problems cannot have &#8220;greater than or equal to&#8221; (\u2265) constraints.\u00a0\t\u00a0\t&#8220;\ufffd \ufffd \ufffd Question 4\t\u00a0\tIn a transportation problem, a demand constraint (the amount of product demanded at a given destination) is a less-than-or equal-to constraint (\u2264).\u00a0\t\u00a0\t&#8220;\ufffd \ufffd \ufffd Question 5\t\u00a0\tIn a balanced transportation model, supply equals demand such that all constraints can be treated as equalities.\u00a0\t\u00a0\t&#8220;\ufffd \ufffd \ufffd Question 6\t\u00a0\tIn formulating a typical diet problem using a linear programming model, we would expect most of the constraints to be related to calories.\u00a0\t\u00a0\t&#8220;\ufffd \ufffd \ufffd Question 7\t\u00a0\tSmall motors for garden equipment is produced at 4 manufacturing facilities and needs to be shipped to 3 plants that produce different garden items (lawn mowers, rototillers, leaf blowers). The company wants to minimize the cost of transporting items between the facilities, taking into account the demand at the 3 different plants, and the supply at each manufacturing site. The table below shows the cost to ship one unit between each manufacturing facility and each plant, as well as the demand at each plant and the supply at each manufacturing facility.\t\u00a0\tWhat is the demand constraint for plant B?\t\u00a0\t&#8220;\ufffd \ufffd \ufffd Question 8\t\u00a0\tIn a portfolio problem, X1, X2, and X3 represent the number of shares purchased of stocks 1, 2, an 3 which have selling prices of $15, $47.25, and $110, respectively.\u00a0 The investor has up to $50,000 to invest. The stockbroker suggests limiting the investments so that no more than $10,000 is invested in stock 2 or the total number of shares of stocks 2 and 3 does not exceed 350, whichever is more restrictive.\u00a0 How would this be formulated as a linear programming constraint?\t\u00a0\t\u00a0\t&#8220;\ufffd \ufffd \ufffd Question 9\t\u00a0\tThe following types of constraints are ones that might be found in linear programming formulations:\t1. \ufffd\u00a0\u00a0\u00a0 \u2264\t2. \ufffd\u00a0\u00a0\u00a0 =\t3. \ufffd\u00a0\u00a0\u00a0 >\u00a0\t\u00a0\t&#8220;\ufffd \ufffd \ufffd Question 10\t\u00a0\tIn a portfolio problem, X1, X2, and X3 represent the number of shares purchased of stocks 1, 2, an 3 which have selling prices of $15, $47.25, and $110, respectively. The investor stipulates that stock 1 must not account for more than 35% of the number of shares purchased.\u00a0 Which constraint is correct?\t\u00a0\t&#8220;\ufffd \ufffd \ufffd Question 11\t\u00a0\tThe production manager for the Softy soft drink company is considering the production of 2 kinds of soft drinks: regular and diet. Two of her resources are constraint production time (8 hours = 480 minutes per day) and syrup (1 of her ingredient) 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 optimal daily profit?\t\u00a0\t&#8220;\ufffd \ufffd \ufffd Question 12\t\u00a0\tA systematic approach to model formulation is to first\t\u00a0\t&#8220;\ufffd \ufffd \ufffd Question 13\t\u00a0\tThe owner of Chips etc. produces 2 kinds of chips: Lime (L) and Vinegar (V). He has a limited amount of the 3 ingredients used to produce these chips available for his next production run: 4800 ounces of salt, 9600 ounces of flour, and 2000 ounces of herbs. A bag of Lime chips requires 2 ounces of salt, 6 ounces of flour, and 1 ounce of herbs to produce; while a bag of Vinegar chips requires 3 ounces of salt, 8 ounces of flour, and 2 ounces of herbs. Profits for a bag of Lime chips are $0.40, and for a bag of Vinegar chips $0.50.\tWhat is the constraint for salt?\t\u00a0\t&#8220;\ufffd \ufffd \ufffd Question 14\t\u00a0\tCompared to blending and product mix problems, transportation problems are unique because\t\u00a0\t&#8220;\ufffd \ufffd \ufffd Question 15\t\u00a0\tIf Xij = the production of product i in period j, write an expression to indicate that the limit on production of the company&#8217;s 3 products in period 2 is equal to 400.\t\u00a0\t&#8220;\ufffd \ufffd \ufffd Question 16\t\u00a0\tBalanced transportation problems have the following type of constraints:\t\u00a0\t\u00a0\t&#8220;\ufffd \ufffd \ufffd Question 17\t\u00a0\tThe owner of Black Angus Ranch is trying to determine the correct mix of two types of beef feed, A and B which cost 50 cents and 75 cents per pound, respectively.\u00a0 Five essential ingredients are contained in the feed, shown in the table below.\u00a0 The table also shows the minimum daily requirements of each ingredient.\t\u00a0\tIngredient \ufffd\u00a0 Percent per pound in Feed A\u00a0 Percent per pound in Feed B\u00a0 Minimum daily requirement (pounds)\t1 \ufffd\u00a0\u00a0\u00a0\u00a0 20 \ufffd\u00a0\u00a0 24 \ufffd\u00a0\u00a0 30\t2 \ufffd\u00a0\u00a0\u00a0\u00a0 30 \ufffd\u00a0\u00a0 10 \ufffd\u00a0\u00a0 50\t3 \ufffd\u00a0\u00a0\u00a0\u00a0 0 \ufffd\u00a0\u00a0\u00a0\u00a0 30 \ufffd\u00a0\u00a0 20\t4 \ufffd\u00a0\u00a0\u00a0\u00a0 24 \ufffd\u00a0\u00a0 15 \ufffd\u00a0\u00a0 60\t5 \ufffd\u00a0\u00a0\u00a0\u00a0 10 \ufffd\u00a0\u00a0 20 \ufffd\u00a0\u00a0 40\t\u00a0\t\u00a0\tThe constraint for ingredient 3 is:\t\u00a0\t&#8220;\ufffd \ufffd \ufffd Question 18\t\u00a0\tLet xij = gallons of component i used in gasoline j. Assume that we have two components and two types of gasoline. There are 8,000 gallons of component 1 available, and the demand gasoline types 1 and 2 are 11,000 and 14,000 gallons respectively. Write the supply constraint for component 1.\t\u00a0\t&#8220;\ufffd \ufffd \ufffd Question 19\t\u00a0\tKitty Kennels provides overnight lodging for a variety of pets. An attractive feature is the quality of care the pets receive, including well balanced nutrition. The kennel&#8217;s cat food is made by mixing two types of cat food to obtain the &#8220;nutritionally balanced cat diet.&#8221; The data for the two cat foods are as follows:\u00a0\t \ufffd \ufffd\u00a0\t\u00a0\tKitty Kennels wants to be sure that the cats receive at least 5 ounces of protein and at least 3 ounces of fat per day. What is the cost of this plan? Express your\u00a0\u00a0 with two places to the right of the decimal point. For instance, $9.32 (nine dollars and thirty-two cents) would be written as 9.32\t\u00a0\t&#8220;\ufffd \ufffd \ufffd Question 20\tQuickbrush Paint Company makes a profit of $2 per gallon on its oil-base paint and $3 per gallon on its water-base paint. Both paints contain two ingredients, A and B. The oil-base paint contains 90 percent A and 10 percent B, whereas the water-base paint contains 30 percent A and 70 percent B. Quickbrush currently has 10,000 gallons of ingredient A and 5,000 gallons of ingredient B in inventory and cannot obtain more at this time. The company wishes to use linear programming to determine the appropriate mix of oil-base and water-base paint to produce to maximize its total profit. How many gallons of oil based paint should the Quickbrush make? Note: Please express your\u00a0\u00a0 as a whole number, rounding the nearest whole number, if appropriate.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>&#8220;\ufffd \ufffd \ufffd Question 1 \u00a0 A systematic approach to model formulation is to first construct the objective function before determining the decision variables.\u00a0 \u00a0 &#8220;\ufffd \ufffd \ufffd Question 2 \u00a0 A constraint for a linear programming problem can never <a href=\"https:\/\/www.benedictsol.com\/blogs\/math-540-quiz-4-chp-3\/\" 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-226873","post","type-post","status-publish","format-standard","hentry"],"_links":{"self":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/posts\/226873","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=226873"}],"version-history":[{"count":0,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/posts\/226873\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/media?parent=226873"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/categories?post=226873"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.benedictsol.com\/blogs\/wp-json\/wp\/v2\/tags?post=226873"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}