A Short Literature on Linear Programming Problem
DOI:
https://doi.org/10.4108/ew.4516Keywords:
operational research, Linear Programming Problem, simplex MethodAbstract
Researchers and scientists have developed various approaches and methodologies over time to model and analyze different types of linear programming problems, such as assignment problems and parametric programming problems. This paper provides a critical review and classification of existing modelling approaches and solution methods related to linear programming problems. Moreover, the simplex method is discussed in detail through a comprehensive literature review. The paper concludes by presenting an integrated research framework that is directly applicable to the present context, along with suggestions for future research directions.
Downloads
References
Sharma JK. Operation research: Theory and application, 4th edition. Macmillan Publisher India Ltd; 2009.
Quddoos A, Javaid S, Khalid MM. A new method for finding an optimal solution for transportation problems. International Journal on Computer Science and Engineering. 2012;4:1271.
Pearson M, Monks T, Gibson A, Allen M, Komashie A, Fordyce A, Harris-Golesworthy F, Pitt MA, Brailsford S, Stein K. Involving patients and the public in healthcare operational research—The challenges and opportunities. Operations Research for Health Care. 2013;2:86–89.
Ergun O, Karakus G, Keskinocak P, Swann J, Villarreal M. Operations research to improve disaster supply chain management. Encyclopedia Of Operations Research And Management Science. 2010;6:3802–3810.
Mulvey JM, Rosenbaum DP, Shetty B. Strategic financial risk management and operations research. European Journal of Operational Research. 1997;97:1–16.
Porteus EL. Optimal lot sizing, process quality improvement and setup cost reduction. Operations research. 1986;34:137–144.
Luna AC, Diaz NL, Graells M, Vasquez JC, Guerrero JM. Mixed-integer-linear-programming-based energy management system for hybrid PV-wind-battery microgrids: Modeling, design, and experimental verification. IEEE Transactions on Power Electronics. 2016;32:2769–2783.
Aksin Z, Armony M, Mehrotra V. The modern call center: A multi-disciplinary perspective on operations management research. Production And Operations Management. 2007;16:665–688.
Taha HA. Operations Research: An Introduction. Pearson Education India; 2013.
Thompson GL, Zawack DJ. A problem expanding parametric programming method for solving the job shop scheduling problem. Annals of Operations Research. 1985;4:327–342.
Yu W, Lui R. Dual methods for nonconvex spectrum optimization of multicarrier systems. IEEE Transactions On Communications. 2006;54:1310–1322.
Sulaiman NA, Hamadameen AQO. Optimal transformation technique to solve multi-objective linear programming problem (MOLPP). Kirkuk University Journal-Scientific Studies. 2008;3:96–106.
Mohsenian-Rad AH, Wong VWS, Jatskevich J, Schober R, Leon-Garcia A. Autonomous demand-side management based on game-theoretic energy consumption scheduling for the future smart grid. IEEE transactions on Smart Grid. 2010;1:320–331.
Vilaplana J, Solsona F, Teixidó I, Mateo J, Abella F, Rius J. A queuing theory model for cloud computing. The Journal of Supercomputing. 2014;69:492–507.
McCarl BA, Apland J. Validation of linear programming models. Journal of Agricultural and Applied Economics. 1986;18:155–164.
Charnes A, Cooper WW, Miller MH. Application of linear programming to financial budgeting and the costing of funds. The Journal of Business. 1959;32:20–46.
Delson JK, Shahidehpour SM. Linear programming applications to power system economics, planning and operations. IEEE Transactions on Power Systems. 1992;7:1155–1163.
Vignaux GA, Michalewicz Z. A genetic algorithm for the linear transportation problem. IEEE transactions on systems, man, and cybernetics. 1991;21:445–452.
Kapoor VK. Operations research techniques for management. New Delhi: Sultan Chand & Sons.; 2003.
Adlakha V, Kowalski K, Lev B. Solving transportation problems with mixed constraints. International Journal of Management Science and Engineering Management. 2006 January;1:47-52.
Wang G, Wan Z, Wang X, Lv Y. Genetic algorithm based on simplex method for solving linear-quadratic bilevel programming problem. Computers & Mathematics with Applications. 2008;56:2550–2555.
Bedekar PP, Bhide SR, Kale VS. Optimum coordination of overcurrent relays in distribution system using dual simplex method. In: 2009 Second International Conference on Emerging Trends in Engineering & Technology; 2009. p. 555–559.
Kim T, Dong M. An iterative Hungarian method to joint relay selection and resource allocation for D2D communications. IEEE Wireless Communications Letters. 2014;3:625–628.
Karimi N, Davoudpour H. A branch and bound method for solving multi-factory supply chain scheduling with batch delivery. Expert Systems with Applications. 2015;42:238–245.
Nabli H. An overview on the simplex algorithm. Applied Mathematics and Computation. 2009;210:479–489.
Boonperm Aa, Sinapiromsaran K. The artificial-free technique along the objective direction for the simplex algorithm. In: Journal of Physics: Conference Series; 2014. p. 012193.
Nabli H, Chahdoura S. Algebraic simplex initialization combined with the nonfeasible basis method. European Journal of Operational Research. 2015;245:384–391.
Sangngern K, Boonperm Aa. A new initial basis for the simplex method combined with the nonfeasible basis method. In: Journal of Physics: Conference Series; 2020. p. 012002.
Downloads
Published
Issue
Section
License
Copyright (c) 2023 EAI Endorsed Transactions on Energy Web
This work is licensed under a Creative Commons Attribution 3.0 Unported License.
This is an open-access article distributed under the terms of the Creative Commons Attribution CC BY 4.0 license, which permits unlimited use, distribution, and reproduction in any medium so long as the original work is properly cited.
