78. CHAPTER 3, components. Management wants to determine how many units of ‘each product 10 produce so as to maximize profit. For each unit of product 1, 1 unit of frame parts and 2 units of electrical compo- rents are required. For each unit of product 2,3 units of frame parts and 2 units of electrical components are required, The company has ‘200 units of frame parts and 300 units of electrical components. Each unit of product 1 gives a profit of $1, and each unit of product 2, up to 60 units, gives a profit of $2, Any excess over 60 units of product 2 brings no profit, so such an excess has been ruled out (a) Formulate a linear programming model for this problem. ba (b) Use the graphical method to solve this model. What isthe resulting total profit? G18) The Primo insurance Company is introducing 160 ne prod Uet lines: special risk insurance and mortgages. The expoced profit 185 per unt on special sinsurance and 82 per nit on monsge. Mansgement wishes to establish sles quotas for the new proict ines to maximize total expeced profit. The work require sents ae a follows ‘Work-Hours per Unit Work Hours Department | Special Risk Mortgage | _Avallable Undeswriting | 3 2 2400 ‘Adtministration ° 1 800 Claims 2 ° 1200 (@) Formulate a linear programming model for this problem. A (b) Use the graphical method to solve this model. (©) Verify the exact value of your optimal solution from past (b) by solving algebraically for the simultaneous solution of the relevant (wo equations, (3.1.10) Weenies and Buns is food processing plant which manu factures bot dogs and hot dog buns. They grind their own flour for the hotdog buns at 2 maximum rate of 200 pounds per week. Each hot dog bun requires 0.1 pound of flour They curently havea con tract with Pigland, Inc. which specifies that a delivery of 800 pounds of pork product i delivered every Monday. Each hot dog Fequites +} pound of pork product. All the other ingredients inthe thot dogs and hot dog buns are in plentiful supply. Finally, the Iabor force at Weenies and Buns consists of 5 employces working full time (40 hours per week each), Bach hot dog requires 3 minutes of labor, and each hot dog bun requires 2 minutes of labor. Each hot dog yields a profit of $0.80, and each bun yields a profit of $0.30. ‘Weenies and Buns would like £9 know how many hot dogs and how many hot dog buns they should produce each week so as, to achieve the bighest possible profit (a) Formulate @ linear programming mode! for this problem. 1 (b) Use the graphical method to solve this model 3-114 The Omega Manufacturing Company has discontinued the production of a certain unprofitable product line, This act INTRODUCTION TO LINEAR PROGRAMMING created considerable excess production capacity. Management considering devoting this excess capacity to one or more of the products; call them products 1, 2, and 3. The available capaci fon the machines that might limit output is summarized in the fg lowing table: Available Ti (Machine Hours per Week] Machine Type Niling machine 500 Lathe 350 Grinder 150 ‘The number of machine hours required for euch unit of the spective products is Productivity coefficient (in machine hours per unit) Machine Type Miling machine Lathe Grinder The sales department indicates that the sales potential if Drocivets I and 2 exceeds the maximum production rate and the sales potential for product 3 is 20 units per week. The ui profit would be $50, $20, and $25, respectively, on products 1, and 3. The objective is to determine how much of each produ (Omega should produce to maximize prof. (@) Formulate a linear programming mode! for this problem. 34-12, Consider the following problem, where the value of & thas not yet been ascertained, Maximize Z= 0%, +m, subject to nt ms 6 x, +e < 10 and 420, 20. Use graphical analysis to determine the optimal solution(s) (21%) forthe various possible values of e(=% < e) <2), D 34-13, Consider the following problem, where the value of & has not yet been ascertained, Maximize ate,j PROBLEMS wena +n 2 bat net i. J Consider the following problem, where the value of cy been ascertained 20 graphical analysis to determine the optimal solution(s) for te vos posible vas of Gy, Conder loving mode Wilbinee | 2= a, +50, ge" Bas + In = 30 Bot 12 (as, + = 20 reo, nz Myeo neo. (2), Use the graphical method co solve this model {b), How does the optimal solution change if the objective fonction is changed to Z = 40x, + 70x? (You may find it helpful 10 te the Graphical Analysis and Sensitivity Analysis procedure in OR Tutorial) (© How does the optimal solution change if the thied functional constraint i changed 0 2x, + xq = 15? (You may find it help “sft use the Graphical Analysis end Sensitivity Analysis pro- cxdure in [OR Tutorial) GFAP Ralph Edmund loves steaks and potatoes, Therefore, he has ose ogo ons steady dit af only tose wo feods (pls some lipids and vit supplements) forall his meas, Ralph cealzes ‘that this isn't the healthiest diet, so he wants to make sure that he ete ight queues ofthe two foods to sais some oy ma Sera eutements He has bined the mations nd cost n= Ii shown tthe top ofthe next column Ralph wishes to determine the number of daily servings (may ‘be fractional) of steak and potatoes that will meet these require- Bead wa minima cost, (@)Fornuite sina programming mode fr this problem 3408) Use te rophieal metho to solve tis move ©(0) Use 2 computer to solve this model by the simplex method. a1 Grams of ingredient per Serving t— Daily Requirement Ingredient | Steak Potatoes (Grams) Carbohydrates 5 13 = 50 Protein 20 5 = 40 Fat 15 2 260 Cost per serving | $4 82 34-10. Web Mercantile sells many household products through an caline catalog. The company nceds substantial warehouse space for storing its goods. Plans now are being made for leasing warehouse storage space over the next S months. Just how much space will be required in each of these monthsis own, However, since these space requirements are quite differnt, it may be most economical to lease ‘only the amount needed each month on & month-by-month basis, On the other hand, the additional cost for leasing space for additional ‘months is much Jess than forte fist month, 0 it may be less expen sive to lease the maximum amount needed for the entre 5 months. Another option is the intermediate approach of changing the total amount of space leased (by adding a new lease and/or having an old lease expire) at least once but not every moath, “The space requirement and the leasing costs for the vations leasing periods areas follows: Required Leasing Period | Cost per Sq.Ft Month | Space (Sq. Ft.) (Months) Leased 1 30,000 1 565 2 20,000 2 sioc 3 440,000 3 313s 4 10,000 4 3160 s 50,000 5 $190 ‘The objective is to minimize the total space requirements. (a) Formulate a linear programming model for this problem, € (b) Solve this model by the simplex method. ing cost for meeting the 4-11. Lary Edison is the director of the Computer Center for Buckly College, He now needs to schedule the staffing of the cen ter [Cis open from 8 AM. unt midnight. Larry has monitored the of the center at various times of the day, and determined that the Following number of computer consultants are equired: ‘Time of Day B ans-nooa) 4 Noon Pa, 8 Ae B Pa 10 8 par-midnight 682 CHAPTER 3 ‘Two types of computer consultants can be hired: fulltime and part-time, The fulltime consultants work for 8 consecutive hours in any of the following shifts: moming (B a.m.~4 944), aftemoon (no0n-8 pm.) and evening (4 et~-midnight). Fulltime consultants are paid $40 per hour Part-time consultants can be hired to work any of the four shifts listed in the above table, Part-time consultants are paid $30 per hour. ‘An additional requirement is that during every time period, ‘there must be a least 2 fulltime consultants on duty for every part time consultant on duty. Lary would like to determine how many full-time and how ‘many part-time workers should work each shift to meet the above requirements at the minimum possible cost. (a) Formulate a linear programming model for this problem. € (b) Solve this model by the simplex method. 3.4.12. The Medequip Company produces precision medical diagnostic equipment at two factories. Theee medical centers have placed orders for this month's production output. The table below ‘hows what the cost would be for shipping each unit from exch fa tory o each ofthese customers. Also shown are the number of units that will be produced at each faciory and the number of units ordered by each customer Unit shipping Cost output fectory 1 800 $700 [400 unes Factory 2 | $400 $900 $600 [500 uns Order size | 300 units 200 units 400 units: ae {A decision now needs to be made about the shipping plan for hhow many units to ship from each factory to each customer {a) Formulate a linear programming mode! for this problem, (b) Solve this model by the simplex method, 34-13." Al Perris has $60,000 that he wishes 0 invest now btder to use the accumulation for purchasing a retirement annuity Jn 5 years. After consulting with his financial adviser, he has been offered four types of xed-income investments, which we will label as investments A, B,C, D. Investments A and B are available at the beginning of exch of the next 5 years (call them years I (0 5). Bach dollar invested n A at the beginning of a year returns $1.40 (a profit of $0.40) 2 yeats later (in time for immediate reinvestment). Each dollar invested in B at the beginning ofa year returns §1,70 three years later Investments C and D will each be available at one time in the future. Bach dollar invested in C atthe beginning of year 2 returns ‘$1.00 atthe end of year 5. Each dollar invested in D at the begin: ning of year 5 returns $1.30 atthe end of year 5. INTRODUCTI ION TO LINEAR PROGRAMMING Al wishes to know which investment plan maximizes the amount of money that can be accumulated by the beginning of year 6. (a) All the funetional constraints for this problem can be express as equality constraints. To do this, let A, By Cx and D, bet amount invested in investment A, B,C, and D, respectively, the beginning of year for each ¢ where the investment is av able and will mature by the end of year 5. Also let R, be d number of available dollars nor invested at the beginning year 1 (and so available for investment in later year). Th the amount invested at the beginning of year 1 plus Ry m equal the number of dollars available for investment at th time. Write such an equation in terms of the relevant variabl above for the beginning of each of the 5 years to obtain {ive functional constraints for this problem. (b) Pormolate @ complete linear programming model for ¢his problem. € (6) Solve this model by the simplex model east sponte cass crane teed Goaginlge ce ceeee Allo ——— __4 Property 1 gos Percentage of tin Percentage of zine Percentage of lead 60 10 30 25 15 60 45 45 10 Cost (5/b) 7 7 8B ‘he objective ist determine the proportions of thes alloys tha shouldbe blended to proce the ew alloy ata miimum cost (@) Formulate linear programing model or is problem € (0) Solve this model hy the splexmethod: Sobre cargo plane has three compartments for storing cargo | front. enter, and back. These compartments have capacity fini fon both weight und space, as summarized below: Weight Capacity (Tons) ‘Space Capacity (Cubic Feet) Compartment Furthermore, the weight of the cargo in the respective compart ments must be the same proportion of that camparment’s weight capacity to m: ntain the balance of the airplanePROBLEMS ‘the following four cargoes have been offered for shipment gman upcoming Hib a space is evaable: Profit (s/Ton) Volume (Cubic Feet/Ton) on of these cargoes can be accepted. The objective is 0 yy mech iy) ofeach cargo soul be acexped and ute cach among the cmparent to maximize he 16S prt for the igh. doa ainca programming model fr hs problem Feast model bythe dimple meth to finkone of multiple optimal solutions. solvex ‘3416, Oxbridge University maintains a powerful mainframe Coroputer for research use by its faculty, PRD. students, and eseich associates. During all working hours, an operator must be fvfiabe to operate and maintain the computer, as well 35 to per- form some programming services. Beryl Ingram. the director of the ‘computer facility, over.2es the operation. ft is now the beginning of the fall semester, and Beryl is com- ffouted with the problem of assigning different working hours to ber operators, Because all the operators are curently enrolled in the iver, they are available 1o work only a limited number of hours each day, a shown in the following table ‘Maximum Hours of Availability Operators. Wage Rate | Mon, Tue. Wed. Thurs. Fri KC sasihow | 6 0 6 0 6 Da S26 | 0 6 0 6 0 He seuhour | 4 8 4 0 sc sasmour | 5 5 5 OS. Ks. sasmour | 3-038 NK ssomor | 0 0 0 6 2 There are six operators (four undergraduate students and two ‘graduate seadents), They all have different wage rates because of differences in their experience with computers and in their pro- ‘samming ability. The above table shows their wage rates, along, ‘ith the maximum number of hours that each can work each day. Each operator és guaranteed a cerain minimam number of tours per week that will maintain an adequate knowledge of the ‘operation. This level is set arbitrarily at 8 hours per week for the ‘undergraduate students (K.C., D.H., H. B.,and S.C.) and 7 hours Der week for the graduate students (K. 8, and N. K.) 83 “The computer facility isto be open for operation from 8 a.m. to 10 rst. Monday through Friday with exacily one operator on duty during these hours. On Saturdays and Sundays, the computer is to be operated by other staff. Because of a tight budget, Beryl has «0 minimize cost. She wishes to determine the number of hours she should assign to each ‘operator on each day. (@) Formulate a linear programming model fer this problem, © {b) Solve this model by the simplex method, 3.417. Joyce and Marvin run a day care for preschoolers. They ate trying to decide what to feed the children for lunches. They ‘would like to keep their costs down, but also need to meet the nutritional requirements of the children. They have already decided to go with peanut butter and jelly sandwiches, and some combination of graham crackers, milk, and orange juice. ‘The nutritional content of each food choice and its cost are given in the table below. Food item Bread (2 slice) s Peanut butts 1 thsp) 4 Strawberry jely tbsp) 7 Graham cracker (1 cracker) 8 aie (1 cup) 1s Ice (1 cup) 35 “The nutritional requirements areas follows, Each child should receive between 400 and 600 calories. No more than 30 percent of the total calories should come from fat. Each child should consume atleast 60 milligrams (mg) of vitamin C and 12 grams (g) of pro tein, Furthermore, for practical reasons, each child needs exactly 2 slices of bread (1o make the sandwich), atleast twice as much peanut butter as jelly, and at least | cup of liquid (milk and/or jee), “Joyce and Marvin would like to select the food choices foreach child which minimize cost while meeting the above requirements {a) Formullate a linear programming model for this problem. © (b) Solve this model by the simplex method 35-1, Read the referenced article that fully describes the OR study ‘summarized in the application vignette presented in Sec. 35. Briefly deseribe how near programming was applied inthis study. ‘Then list the various financial and nonfinancial benefits that resulted from this study 35-2.* You are given the following data fora linear programming problem where the objective isto maximize the profit from allocat ‘ng three resources to two nonnegative activities,