4/14/09
8:33 AM
Page 42
Chapter Four: Linear Programming: Modeling Examples
PROBLEM SUMMARY
1. “Product mix” example 2. “Diet” example 3. “Investment” example 4. “Marketing” example 5. “Transportation” example 6. “Blend” example 7. Product mix (maximization) 8. Sensitivity analysis (4–7) 9. Diet (minimization) 10. Product mix (minimization) 11. Product mix (maximization) 12. Product mix (maximization) 13. Product mix (maximization) 14. Ingredients mix (minimization) 15. Transportation (maximization) 16. Product mix (maximization) 17. Ingredients mix blend (minimization) 18. Crop distribution (maximization) 19. Monetary allocation (maximization) 20. Diet (minimization), sensitivity analysis 21. Transportation (maximization) 22. Transportation (minimization) 23. Warehouse scheduling (minimization) 24. School busing (minimization) 25. Sensitivity analysis (4–24) 26. Ingredients mixture (minimization) 27. Interview scheduling (maximization) 28. Multiperiod investments mixture (maximization) 29. Insurance policy mix (maximization) 30. Product mix (maximization) 31. Advertising mix (minimization), sensitivity analysis 32. Blend (maximization) 33. Multiperiod borrowing (minimization) 34. Multiperiod production scheduling (minimization) 35. Blend (maximization), sensitivity analysis 36. Assignment (minimization), sensitivity analysis 37. Transportation (minimization) 38. Scheduling (minimization) 39. Production line scheduling (maximization) 40. College admissions (maximization) 41. Network flow (minimization) 42. Blend (maximization) 43. Trim loss (minimization) 44. Multiperiod investment (maximization) 45. Multiperiod sales and inventory (maximization) 46. Multiperiod production and inventory (minimization) 47. Employee assignment (maximization) 48. Data envelopment analysis 49. Data envelopment analysis 50. Network flow (maximization) 51. Multiperiod workforce planning (minimization) 52. Integer solution (4–51) 53. Machine