1. Bubba’s diet requires that all the food he eats come from one of the four ‘basic food groups’ (chocolate cake, ie cream, soda, cheesecake). The nutritional content per unit of each food a Sugar Fat ‘Type of Food [S]_Calories (oz]__foz] Bro 075 S00 ce Shocolate Tce Cream [1 scoop] 0.380 400 48 oa 8 2 1.20 sw 0 He must consume at least 2000 calories, 24 07 of chocolate, 40 oz of sugar, and 32 07 of fat daily. Formulate a linear programming model that ean be used to satisfy Bubba’s nutritional re quirements at minimum cost. 2. A manufacturer of plastic is planning to blend a new product from four chemical compounds. These compounds are mainly composed of three elements: A, B and C. The composition and unit cost of these chemicals are shown in the following table: Chemical Compound ‘The new product consists of 25 percent element A, at least 35 percent element B, and at least 20 percent element C. Owing to side effects of compounds | and 2, they must not exceed, 25 percent and 30 percent, respectively, of the content of the new product. Formulate the problem of finding the least costly ay of blending as a linear program. 3. During each 6-hour period of the day, the Bloomington Police Department needs at least the mumber of policemen shown in the table below. Policemen can be hired to work either 12 consecutive hours or 18 consecutive hours. Policemen are paid $30 per hour for each of the first 12 hours a day they work and are paid $45 per hour for each of the next 6 hours they work in Shite Number of Policemen Required T 12 2 Gam s 3 12pm ~ 6pm 6 46pm — 12am 15 Formulate an LP that ean be used to minimize the cost of meeting Bloomington’s daily police requirements,4. Coalco produces coal at two mines and ships it to three customers. The customer demands are 70, 60 and 40 tons respectively. The cost per ton of producing coal, the ash and sulfur content (per ton) of the coal, the production capacity (in tons) of each mine and the cost (in dollars) of shipping a ton of coal from a mine to each customer are given in following tables. It is required that the total amount of coal shipped contains at most 5% ash and at most 4% sulfur. Production Capacity Suilfer Content Mine Cost {S|__[Ton [Tons] T 35 100 0.05 2 2 140 0.03 Shipment Cost Customer 72 9 6 8120 8 Formulate an LP that minimizes the cost of meeting customer demands.5. Printed circuit boards (PCBs) are made at two manufacturing facilities (M1 and M2) and are shipped to three distribution centers (DC1, DC2, and DC3) every day. The manufacturing process for PCBs varies slightly between the two manufacturing facilities. The time required to assemble each PCB, and the amount of solder required to build each PCB, is described the table helow. This table also provides the daily availability of assembly time and solder at each manufacturing facility, MIM Assembly Time [minutes/PCB] 2.13 1.94 Solder Consumed foz./PCB]_ 0.97 _1.02 s Ti ites/day} 360 360 le Solder (ov. 190 170 \ds for PCBs are as follows: Exactly 90 PCBs are required by DCI, exactly and exactly 100 PCBs are required by DC3. The daily dei 60 PCBs are required by DC: ‘The cost (in dollars) of shipping a single PCB from a manufacturing faci center is shown in the following table. y toad ribution From\To DCL DC2_DC3 MI 025 031 0.18 M2015 0.29 031 probleng is to determine the number of PCBs that should be produced such that the total cost is ‘The objective of th at each manufacturing facility and shipped to distribution centers, minimized. (a) Clearly define the decision variables required to solve this problem. (b) Formulate the linear program (LP) associated with this problem. operations. The first operation is performed at either machine center 1 or 2 at either machine center 3 or 4. Operation times for each machine center per unit produced, ‘machine center capacities, and machine center eosts per minute are shown in the table below. Daily requirements are 500 units for product A and 400 units for product B. The objective is to find a production schedule that minimizes total machine center production costs. [Problem adapted from Daellenbach, George, and MeNiekle,) ‘Machine Centers: I 2 a Product A oT TL minntes Produet B a) 10 minntes Capacity 49003800 6100 minutes Cost /mminute 31.30 $1.50 31.60 (a) Clearly define the decision variables required to solve this probl (b) Formulate the linear program (LP) associated with this problem,7. Consider a regional power system with two generating stations, A and B. These stations serve customers in regions X and Y. Customers in region X have a total demand of 30 MW: (megawatts), while customers in region Y have a total demand of 45 MW. Generating station A has a production capacity of 95 MW, with an operating cost of $109 per MW, Generating, station B has a production capacity of 100 MW, with an operating cost of $120 per MW. Power can be transmitted directly from a generating station to a customer region, but there is a 10% loss in power. Power can also be transmitted from one generating station to the ‘other. In this ease there is a 15% loss in power. line has a maximum capacity (in units of MW), as shown in the following, indicates that no power can Each transmission table (wher To From A BX _Y A 03530 B | 90 4045, ‘The goal is to find an optimal plan for power distribution, including the quantity of power generated at each station, (Problem adapted from Jensen and Bard) (a) Clearly define the decision variables required to solve this problem, (b) Formulate the linear program (LP) associated with this probl 8, You are organizing a party and have the following amounts of liquor availa! ‘#50 fi. 02. of bourbon, © 70 fl. 02. of vodka, © 65 fl, 02, of white vermouth, © 75 fi. o2. of red vermouth, © 25 fi. oz. of brandy, and 20 fl. 02, of coffee liquen‘You are considering mixing the following drinks: Drink Mixture ‘Chaumneies 2/3 bourbon, 1/3 red vermouth Black Russians 3/4 vodka, 1/4 coffee liqueur Sweet Italians 1/4 brandy, 1/2 red vermouth, 1/4 white vermouth, Molotov Cockt 2/3 vodka, 1/3 white vermouth Bourbon on the Rocks _ bourbon Each drink contains 4 fl. oz. Your objective is to mix the ingredients in such a way that the Jargest number of drinks ean be made. However, you feel that at least twice as many Molotov Cocktails as Black Russians have to be mixed to provide a balanced selection. [Problem adapted from Dacllenbach, George, and MeNickle,] (a) Clearly define the decision variables required to solve this problem. (b) Formulate the linear program (LP) associated with this problem. | A Denver-based company has Je Atlanta. Several corporate employees are planning to vi ng the next week, and the travel office must arrange rental cars for all of them, Daily demand for cars is as follows: Day: Sat. Sun, Mon. ‘Tes. Wed. Thurs. Fit Cass 3 59 ‘The car rental company offers the following six plans: 1. Daily cost on Saturday or Sunday 35 2. Daily cost for weekdays $50 3. Three-day plan (three consecutive wel $125 4. Weekend plan (Saturday and Sunday) 860 5, All-weekdays plan (Monday thru Friday) S180 6._All-week plan (Saturday thru Friday) $200 A car is used by one person at a time, but when a ear is rented for more than one day it may be used by different people on different days. The objective of the problem is to minimize the cost of car rentals required to cover all employee demands. [Problem adapted from Jensen and Bard.) (a) Clearly define the decision variables required to solve this problem. (b) Formulate the linear program (LP) associated with this problem.10. A production manager is planning the scheduling of two products on three machines. Each product can be manufactured on any of the machines. The unit production costs (in $) are summarized below.The time (in hours) required to produce each unit of product on each of the machines is summarized below. Machine Product 128 A 040 025 0.15 B 0.20 030 0.35 Suppose that 4000 units of Product 1 and 3000 units of Produet 2 are required, and that the available machine-hours are 1500, 1200, and 2000 respectively. Formulate the scheduling problem as a linear program, 11, (from Winston) Bach hour from 10am to 7p, Bank Oue receives cheeks and inst process them. Its goal isto process all the checks the same day they are received. The bank has 13 check-processing machines, each of which ean process up to 500 checks per hour. Tt takes ‘one worker to operate each machine. Bank One hires both fulltime and parttime workers. Full-time workers work 10am - 6pm, 1am - Tpm, or Noon-Spm and are paid $160 per day: Part-time workers work either 2pm-7pm or 3pm-8pm and are paid $75 per day. The number of checks received cach hour is given below. In the interest of maintaining continuity, Bank One believes it must have at least three full-time workers tnder contract. Develop a. cost- minimizing work schedule that processes all checks by Spm. Hints: «You need to know how many full-time workers start at 10am, how many’ start at Ham, and how many start at noon. (These would make good decision variables, since we dom’ now these mubers of workers; although we do know that we need at least 3 workers who start at either 10am, Lam, oF noon.) There are 13 machines, where each machine can process 500 cheeks per hour and each machine requtes 1 worker. If Fi fulltime workers start ther sift at 10a, what is the ‘maximum number of checks that ean be processed between 10am and Ham? Are there ‘any part-time workers working at 10aun? # IF Fi fulltime workers start at 10am (and work until 6a), Fi full-time workers work fom Llam-Tpm, Fig full-time workers work from noou-Spm, and PT part-time workers start at 2pm (and work until 7pm), how many workers are available from 2pm until Spzs? ‘What is the maximum numberof checks that ean be processed by these workers (i each machine requires a worker and each machine can process up to 500 checks per hour)?‘You'll want a decison variable that lets you know how many checks are actually processed cach hour (perhaps you let Pig represent the numberof checks processed between 10am id Mam), © TF 5000 checks arrive at 10am, and there are Pip checks actually processed between 10am and Ham, how many checks are still unprocessed at ami? You'll want a decision variable that lets you know this value (perhaps you let, represent the number of checks ‘that arrived before Ham but are still unprocessed at 1am). ‘© How many checks are unprocessed at noon’? Remeber, there are 4000 checks arriving ‘at Ham, but there may also be some checks left over from 0am. There will also be some checks that are processed between 11am and noon, 12, (from BJS) A steel manufacturer produces four sizes of L beams: small, medium, large, and ‘These beams can be produced on any one of three machine types: A, B, and C. The lengths in feet of the I beams that ean be produced on the machines per hour are ized below: c 350 700 600 335 Assume that each machine ean be used up to 50 hours per week and that the hourly operating costs of these machines are respectively $30, $50, and $80. Further suppose that 12,000, 6000, 5000, and 7000 feet of the different size I beams are required weekly. Formulate the machine scheduling problem as a linear program.13, (from BJS) An agricultural mill manufactures feed for cattle, sheep, and chickens, This is done by mixing the following main ingredients: corn, limestone, soybeans, and fish meal. These ingredients contain the following nutrients: vitamins, protein, calcium, and erude fat. The contents of the nutrients in standard units for each kilogram of the ingredients are summarized the following table: Nutrient Units ngredient Vitamins Protein Calcium Crude Fat s 10 6 5 6 5 10 6 10 2 6 6 4 8 6 9 ‘The mill is contracted to produce 12, 8, and 9 (metric) tons of cattle feed, sheep feed, and chicken feed. Because of shortages, a limited amount of the ingredients is available ~ namely, 9 tons of corn, 12 tons of limestone, 5 tons of soybeans, and 6 tons of fish meal. ‘The price per kilogram of these ingredients is, respectively, $0.20, $0.12, $0.24, and $0.12. ‘The minimal and maximal units of the various nutrients that are permitted is summarized below for a kilogram of the cattle feed, the sheep feed, and the chicken feed. Nutrient Units Vitamins Protein Caleium Crude Fat Min Max Min Max Min Max Min Max $0 6 «0 T «0 4 8 6 «© 6 «© 6 w 4 6 46 6 ww 6 wo a 5 Formulate this feed-mix problem so that total cost is minimized.|. (from BIS) The technical staff of a hospital wishes to develop a computerized menu-planning, system, To start with, a Iunch menu is sought, ‘The menu is divided into three major categories: vegetables, meat, and dessert. At least one equivalent serving of each eategory is desired. The cost per serving of some suggested items as well as their content of carbohydrates, vitamins, protein, and fats is summarized below: a 1 5 2 5 1 6 1 2 1 1 1 1 3 1 oo 8 5 2 1.20 6 6 1 os 1 3 1 o 0.28 Apple 1 2 0 o oa Pudding 1 0 0 o 05, Jello 1 0 0 0 oa Suppose that the minimal requirements of carbohydrates, vitamins, protein, and fats per meal are respectively 5, 10, 10, and 2, Formulate the menu-planning problem as a linear program,