Using the data in Table 45 follow through the Bitran and Hax algorithm by hand. Assume S, = 500, SR = 1000, and So = 1500 and production of all three families. To accomplish this, set SSRS = 90 rather than 40. Also assume an aggregate production of 500 and an upper bound on each item of three times DayTABLE 4.6 Example for the Disaggregation Problem Family Item Inventory Demand Conversion Safety Stock Expected Quantity Kij 240 170 0.85 50 70 2 285 200 1.10 75 85 A 122 100 0.90 40 220 B 4 223 130 1.15 50 93 B 290 170 1.05 190010 50 120 B 193 110 1.20 40 83 420 210 bes 1.15 60 210 235 150 0.75 40 85 135 100 0.85 50 354 10 180 140 0.80 50 40 "Items whose available quantities will be less than safety-stock values if not produced