Mathematical Programming Approaches
Mathematical programming is one of the most important techniques available for quantitative decision making. The general purpose of mathematical programming is finding an optimal solution for allocation of limited resources to perform competing activities. The optimality is defined with respect to important performance evaluation criteria, such as cost, time, and profit. Mathematical programming uses a compact mathematical model for describing the problem of concern. The solution is searched among all feasible alternatives. The search is executed in an intelligent manner, allowing the evaluation of problems with a large number of feasible solutions.
KeywordsSupply Chain Mathematical Programming Transportation Cost Supply Chain Network Bender Decomposition
Unable to display preview. Download preview PDF.
- Arntzen BC, Brown GG, Harrison TP and Trafton LL (1995) Global supply chain management at Digital Equipment Corporation. Interfaces 25:69–93Google Scholar
- Bowersox DJ, Closs DJ, Cooper MB (2002) Supply chain logistics management. McGraw-Hill, Boston.Google Scholar
- Geoffrion AM, Powers RF (1995) Twenty years of strategic distribution system design: an evolutionary perspective. Interfaces 25:105–128Google Scholar
- Magee TM, Glover F (1996) Integer programming. In: M. Avriel and B. Golany (eds) Mathematical programming for industrial engineers. Marcel Dekker, New York, pp. 123–270Google Scholar
- Ross A, Venkataramanan MA, Ernstberger KW (1998) Reconfiguring the supply network using current performance data. Decision Science 29:707–728Google Scholar
- Salkin HM (1975) Title Integer programming. Addison-Wesley, ReadingGoogle Scholar
- Shapiro JF (2000) Modeling the Supply Chain. Duxbury Press, New York.Google Scholar
- Truong TH, Azadivar F (2005) Optimal design methodologies for configuration of supply chains. International Journal of Production Research 43: 2217–2236Google Scholar