This is an unedited manuscript accepted for publication and provided as an Article in Press for early access at the author’s request. The article will undergo copyediting, typesetting, and galley proof review before final publication. Please be aware that errors may be identified during production that could affect the content. All legal disclaimers of the journal apply.
Savita,
- Assistant Professor, Department of Mathematics Chandigarh University Mohali, Punjab, India
Abstract
Linear Programming (LP) is a fundamental optimization technique widely employed across engineering, manufacturing, transportation, finance, healthcare, and other industrial sectors to support effective resource allocation and informed decision- making. Among the various solution techniques, the graphical and algebraic methods remain the two most fundamental approaches, each offering distinct advantages depending on the complexity and dimensionality of the optimization problem. This paper presents a comprehensive comparative study of these methods by examining their underlying principles, computational procedures, applicability, strengths, and practical limitations. The graphical method provides an intuitive visualization of the feasible region and optimal solution, making it particularly suitable for problems involving two decision variables and for developing conceptual understanding. However, its applicability is restricted by dimensional limitations and reduced computational scalability. In contrast, the algebraic approach, particularly the Simplex Method and related optimization techniques, provides a systematic and iterative framework capable of solving large-scale linear programming problems involving multiple variables and constraints with high computational accuracy and efficiency. The study further investigates the practical applications of both approaches in supply chain management, manufacturing, financial portfolio optimization, healthcare resource planning, and telecommunications, demonstrating their significance in addressing real-world optimization challenges. In addition, emerging developments, including hybrid optimization strategies, artificial intelligence-assisted optimization, stochastic programming, and metaheuristic algorithms, are discussed to illustrate their contribution toward improving solution quality and computational performance. The comparative analysis indicates that while the graphical method remains an effective educational and analytical tool for small-scale optimization problems, algebraic techniques are indispensable for solving complex industrial-scale applications. The findings facilitate informed solution of LP solution methods and highlight emerging intelligent approaches for efficient optimization.
Keywords: Linear Programming, Optimization, Graphical Method, Algebraic Method, Simplex Method, Hybrid Optimization, Computational Efficiency, Resource Allocation
References
[1] G. B. Dantzig, Linear Programming and Extensions. Princeton, NJ: Princeton Univ. Press, 1963.
[2] V. Chva´tal, Linear Programming. San Francisco, CA: W. H. Freeman, 1983.
[3] R. L. Rardin, Optimization in Operations Research. Upper Saddle River, NJ: Prentice Hall, 1998.
[4] M. S. Bazaraa, J. J. Jarvis, and H. D. Sherali, Linear Programming and Network Flows, 4th ed. Hoboken, NJ: Wiley, 2010.
[5] K. G. Murty, Linear Programming. New York, NY: Wiley, 1983.
[6] H. Karloff, Linear Programming. Boston, MA: Birkha¨user, 1991.
[7] S. J. Wright, Primal-Dual Interior-Point Methods. Philadelphia, PA: SIAM, 1997.
[8] D. Bertsimas and J. N. Tsitsiklis, Introduction to Linear Optimization. Belmont, MA: Athena Scientific, 1997.
[9] A. Schrijver, Theory of Linear and Integer Programming. Chichester, U.K.: Wiley, 1998.
[10] N. Karmarkar, “A new polynomial-time algorithm for linear program-ming,” Combinatorica, vol. 4, no. 4, pp. 373–395, 1984.
[11] A. Talebi, S. P. H. Boroujeni, and A. Razi, “Integrating random regret minimization-based discrete choice models with mixed integer linear programming for revenue optimization,” Iran J. Comput. Sci., vol. 8, no. 1, pp. 21–35, 2025.
[12] T. Altiok, “Approximate analysis of exponential tandem queues with blocking,” Euro. J. Oper. Res., vol. 11, pp. 390–397, 1982.
[13] S. Balsamo and G. Iazeoalla, “Some equivalence properties for queuing networks with and without blocking,” in Proc. Perform. vol. 83, 1983, pp. 351–360.
[14] F. Baskett, K. Chandy, R. Muntz, and G. Palacios, “Open closed and mixed network of queues with different classes of customers,” J. ACM, vol. 22, pp. 248–260, 1975.
[15] S. Chaung, A. Kashper, and K. Ross, “Computing approximate blocking probabilities for large loss networks with state-dependent routing,” IEEE/ACM Trans. Networking, vol. 1, pp. 105–115, 1993.
[16] X. Chao, M. Miyazawa, and M. Pinedo, Queuing Network: Customers, signals and product form solution. Chichester, UK: Wiley, 1999.
[17] E. Kamal and A. Al-Yatama, “Blocking probability in circuit switched wavelength division multiplexing networks under multicast service,” Performance Evaluation, vol. 47, pp. 43–71, 2002.
[18] F. Kelly, “Routing and capacity allocation in network with trunk reservation,” Math. Oper. Res., vol. 15, pp. 771–792, 1990.
[19] R. Onvural and H. Perros, “On equivalencies of blocking mechanisms in queuing networks with blocking,” Oper. Res. Lett., vol. 5, pp. 293–297, 1986.
[20] M. Reiser and H. Kobayashi, “Queuing networks with multiple closed chains: Theory and computational algorithms,” IBM J. Res. Develop., vol. 19, pp. 283–294, 1975.
[21] M. Woodward, “Efficient computation of performance measures for queuing networks,” J. Comput. Oper. Res., vol. 21, pp. 453–472, 1994.
[22] A. Kumar and C. Shekhar, “Bayesian modeling of repairable systems with imperfect coverage and delayed detection dynamics,” Quality and Reliability Engineering International, 2025.
[23] A. Kumar, “Parametric optimization of repairable systems in iot: addressing detection delays, imperfect coverage, and fuzzy parameters,” Life Cycle Reliability and Safety Engineering, pp. 1–12, 2025.
[24] P. Baloda, A. Kumar, and V. Garg, “Reliability estimation of parallel systems with diverse failure modes: Semi-markov model approach,” Journal of Reliability and Statistical Studies, pp. 351–366, 2024.
[25] A. Kumar, C. Shekhar, and Savita, “Optimizing resource allocation in m/m/1/n queues with feedback, discouraged arrivals, and reneging for enhanced service delivery,” Journal of Reliability and Statistical Studies, vol. 17, no. 1, pp. 1–16, 2024.
[26] A. Kumar, C. Shekhar et al., “Cost analysis of a finite capacity queue with server failures, balking, and threshold-driven recovery policy,” International Journal of Mathematical, Engineering and Management Sciences, vol. 9, no. 5, p. 1198, 2024.
[27] C. Shekhar, S. Varshney, and A. Kumar, “Optimal control of a service system with emergency vacation using bat algorithm,” Journal of com-putational and applied mathematics, vol. 364, p. 112332, 2020.
[28] “Matrix-geometric solution of multi-server queueing systems with bernoulli scheduled modified vacation and retention of reneged cus-tomers: A meta-heuristic approach,” Quality Technology & Quantitative Management, vol. 18, no. 1, pp. 39–66, 2021.
[29] C. Shekhar, N. Kumar, A. Gupta, A. Kumar, and S. Varshney, “Warm-spare provisioning computing network with switching failure, common cause failure, vacation interruption, and synchronized reneging,” Relia-bility Engineering & System Safety, vol. 199, p. 106910, 2020.
[30] A. Kumar, S. Kaswan, M. Devanda, and C. Shekhar, “Transient anal-ysis of queueing-based congestion with differentiated vacations and customer’s impatience attributes,” Arabian Journal for Science and Engineering, vol. 48, no. 11, pp. 15 655–15 665, 2023.
[31] C. Shekhar, A. Gupta, N. Kumar, A. Kumar, and S. Varshney, “Transient solution of multiple vacation queue with discouragement and feedback,” Scientia Iranica, vol. 29, no. 5, pp. 2567–2577, 2022.
[32] A. Kumar, D. Gulia, and V. Garg, “Optimizing service queues in working vacation scenarios: A queueing theory perspective,” in 2024 International Conference on Artificial Intelligence and Emerging Technology (Global AI Summit), 2024, pp. 1342–1347.
[33] A. Kumar, P. Prikshit, and S. S. Chauhan Gonder, “Queueing system optimization and computational analysis: A comprehensive investigation into research evaluation,” in 2024, 4th International Conference on Advancement in Electronics & Communication Engineering (AECE), 2024, pp. 391–396.
[34] A. Kumar and S. Singh, “Optimizing service performance insingle working vacation: Queueing theory perspective,” in 2024, 4th Interna-tional Conference on Advancement in Electronics & Communication Engineering (AECE), 2024, pp. 386–390.
[35] C. Shekhar, A. Kumar, and S. Varshney, “Parametric nonlinear pro-gramming for fuzzified queuing systems with catastrophe,” International Journal of Process Management and Benchmarking, vol. 10, no. 1, pp. 69–98, 2020.
[36] A. Kumar, A. Kumar, and C. Shekhar, “Transformation-based stationary analysis of single server feedback fluid queue: An enhanced approach,” in 2023 3rd International Conference on Advancement in Electronics & Communication Engineering (AECE), 2023, pp. 580–583.
[37] C. Shekhar, S. Varshney, and A. Kumar, “Standbys provisioning in ma-chine repair problem with unreliable service and vacation interruption,” in The Handbook of Reliability, Maintenance, and System Safety through Mathematical Modeling. Elsevier, 2021, pp. 101–133.
[38] A. Kumar, M. Boualem, A. A. Bouchentouf, and Savita, “Optimal analysis of machine interference problem with standby, random switching failure, vacation interruption and synchronized reneging,” in Applications of advanced optimization techniques in industrial engineering. CRC Press, 2022, pp. 155–168.
[39] C. Shekhar, A. Kumar, S. Varshney, and S. I. Ammar, “Fault- tolerant redundant repairable system with different failures and delays,” Engi-neering Computations, vol. 37, no. 3, pp. 1043–1071, 2019.
[40] “M/G/1 fault-tolerant machining system with imperfection,” Journal of Industrial and Management Optimization, vol. 17, no. 1, pp. 1–28, 2020.
[41] C. Shekhar, S. Varshney, and A. Kumar, “Reliability and vacation: The critical issue,” Advances in Reliability Analysis and its Applications, pp. 251–292, 2020.
[42] V. Klimenok, C. S. Kim, and A. Dudin, “Tandem queueing system with different types of customers,” in International Conference on Analytical and Stochastic Modeling Techniques and Applications. Springer, 2011, pp. 99–112.
[43] A. Kumar, “Single server multiple vacation queue with discouragement solve by confluent hypergeometric function,” Journal of Ambient Intelli-gence and Humanized Computing, vol. 14, no. 5, pp. 6411–6422, 2023.
[44] C. Shekhar, A. Kumar, and S. Varshney, “Modified bessel series solution of the single server queueing model with feedback,” International Journal of Computing Science and Mathematics, vol. 10, no. 3, pp. 313–326, 2019.
[45] A. A. Bouchentouf, L. Medjahri, M. Boualem, and A. Kumar, “Math-ematical analysis of a markovian multi-server feedback queue with a variant of multiple vacations, balking and reneging,” Discrete and Continuous models and Applied Computational Science, vol. 30, no. 1, pp. 21–38, 2022.
[46] J. Wang, H. Abouee-Mehrizi, O. Baron, and O. Berman, “Tandem queues with impatient customers,” Performance Evaluation, vol. 135, p. 102011, 2019.
[47] C. Shekhar, A. Raina, A. Kumar, and J. Iqbal, “A survey on queues in machining system: progress from 2010 to 2017,” Yugoslav Journal of Operations Research, vol. 27, no. 4, pp. 391–413, 2017.
[48] C. Shekhar and A. Kumar, “Brief review on retrial queue: Progress in 2010-2015,” Int. Journal of Applied Sciences and Engineering Research, vol. 5, no. 4, pp. 324–336, 2016.
[49] J. E. Patin˜o, L. A. G. Pareja, and O. G. Carmona, “Optimal placement, sizing and operation of d-statcoms in power distribution systems using a mixed-integer linear programming model,” Results Eng., 2025, art. no. 104749.
[50] S. Awoniyi, “A strongly polynomial-time algorithm for the general linear programming problem,” 2025.
[51] C. Shekhar, A. Kumar, and S. Varshney, “Load sharing redundant repairable systems with switching and reboot delay, Reliability Engi-neering & System Safety, vol. 193, p. 106656, 2020.
[52] I. Akyildiz, “Exact product from solution queuing networks with block-ing,” IEEE Trans. Comput., vol. 1, pp. 122–126, 1987.
[53] B. Desert and H. Daduna, “Discrete-time tandem networks of queues effects of different regulation schemes for simultaneous events,” Perfor-mance Evaluation, vol. 47, pp. 73–104, 2002.
[54] G. Diehl, “A buffer equivalency decomposition approach tofinite buffer queueing networks,” Ph.D. dissertation, Harvard University, U.S.A., 1984.
[55] H. Perror, A. Nilsson, and Y. Liu, “Approximate analysis of product form type queuing networks with blocking and deadlock,” Perform. Eval., vol. 8, pp. 19–39, 1988.
Journal of Production Research & Management
| Volume | 16 | |
| 02 | ||
| Received | 17/07/2026 | |
| Accepted | 24/08/2026 | |
| Published | 10/09/2026 | |
| Publication Time | 55 Days |