Comparative Study of Efficiency of Integer Programming, Simplex Method and Transportation Method in Linear Programming Problem (LPP)
American Journal of Theoretical and Applied Statistics
Volume 4, Issue 3, May 2015, Pages: 85-88
Received: Mar. 8, 2015;
Accepted: Mar. 24, 2015;
Published: Mar. 31, 2015
Views 4313 Downloads 307
Ayansola Olufemi Aderemi, Department of Mathematics and Statistic, The Polytechnic, Ibadan, Oyo State, Nigeria
Oyenuga Iyabode Favour, Department of Mathematics and Statistic, The Polytechnic, Ibadan, Oyo State, Nigeria
Abimbola Latifat Adebisi, Department of Mathematics and Statistic, The Polytechnic, Ibadan, Oyo State, Nigeria
In this paper, we present a Linear Programming Problem (LPP) to minimize the cost of transportation of NBC, PLC products from three distribution centres to ten depots. Three methods of analysis were considered namely: Integer Programming, simplex method and transportation method via computer packages. The result of the analysis revealed that, the cost of transportation from these distribution centres to all the 10 depots are the same. That is, the optimal cost is N9, 127, 776.
Ayansola Olufemi Aderemi,
Oyenuga Iyabode Favour,
Abimbola Latifat Adebisi,
Comparative Study of Efficiency of Integer Programming, Simplex Method and Transportation Method in Linear Programming Problem (LPP), American Journal of Theoretical and Applied Statistics.
Vol. 4, No. 3,
2015, pp. 85-88.
Aminu, Y.A (1998). Operation Research for Science and Management studies.Ijagbo Best Way Printer, Nigeria.
Aremu, MA (2007). A Linear Programming Approach to Profit Optimization in a Production Mixed System, Nigerian Journal of Science and Technical Research; Vol. 2, No. 1, pp 30 — 39.
Arsham, H (1992). Post optimality analyses of the transportation problem. Journal of the Operational Research Society, Vol. 43, pp. 121-139.
Arsham, H and Khan, A. B (1989). A simplex-type algorithm for general transportation problems. An alternative to stepping-stone. Journal Operational Research Society, Vol. 40(6), pp. 581-590.
Balinski, M.L and Gomory, R. E (1963). A mutual primal-dual simplex method, Recent Advances in Mathematical Programming (Graves and Wolfe, eds), McGraw-Hill, New York.
Ford, L.R and Fulkerson, D.R (1957). A simple algorithm for finding maximal network flows and application to the Hitchcock problem. Canadian Journal of Mathematics, Vol. 9, pp. 210-218.
Fulkerson, D.R (1961). An out-of-kilter method for minimal cost flow problems. Journal of the Society for Industrial and Applied Mathematics, Vol. 9, pp. 18-27
Garvin, W.W (1960). The distribution of a product from a several sources to numerous localities. Journal of Mathematics Physics. Vol. 20, pp. 224-230.
Handy, T (2002). Operations Research- An Introduction (Sixth Edition). Pearson Education Inc.
Henderson, A and Schlaifer, R (1954). Mathematical programming: Better information for better decision-making, Harvard Business Review. Vol. 32, pp.73-100.
Kirca and Stair (1990). A heuristic for obtaining an initial solution for the transportation problem. Journal of Operational Research Society. Vol. 41(9), pp. 865-867.
Kumar, Tapojit (2001). Comparison of Optimization Techniques in large scale Transportations. Journal of undergraduate Research at Minnesota State University, Mankato Vol. 1, Article 10
Lucey,, T (1992). Introduction to Quantitative Techniques. London Publication.
Marower, M.S and Williamson, E(1970). Teach Yourself Operational Research. English University Press.
Poolsap, U. et al (200). Prediction of RNA Secondary Structure with Pseudoknops using integer programming. BMC Bioinformatics, 10 (Suppi. 1), S38.
Sato, K. et al (2011). IPknot: fast and accurate prediction of RNA secondary structures with Pseudoknops using integer programming Bioinformatics, 27; i85 — i93.
Taha, HA (2003). Operational Research: An Introduction. Prentice Hall Inc(Seventh edition), New York, USA.
Winston, W.L (1994). Operation Research; Application and Algorithm (Third Edition). International Thompson Publishing.