<?xml version="1.0" encoding="UTF-8"?>
<article xmlns:xlink="http://www.w3.org/1999/xlink">
<front><article-meta>
<title-group><article-title>Recent Trends and Applications of Linear Programming in Network Flow: A Comprehensive</article-title></title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>Tripathi</surname><given-names>Shubham Kumar</given-names></name><xref ref-type="aff" rid="aff1"/></contrib>
<contrib contrib-type="author"><name><surname>Kumar</surname><given-names>Ranjan</given-names></name><xref ref-type="aff" rid="aff2"/></contrib>
<aff id="aff1">VIT-AP University, Inavolu, Beside AP Secretariat, Amaravati AP, India.</aff>
<aff id="aff2">VIT-AP University, Inavolu, Beside AP Secretariat, Amaravati AP, India‎.</aff>
</contrib-group>
<abstract><p>By leveraging advanced techniques and models, Operations Research (OR) provides critical insights and strategic interventions across multiple domains, including transportation, communication, project management, and supply chain optimization. The field&apos;s multifaceted approach continues to drive efficiency and innovation in numerous industries. This paper thoroughly evaluates numerous approaches and methods researchers employ to model and investigate problems. Our objective is to bridge gaps in existing literature by examining recent advancements in this field. Network flow problems encompass the shortest path, maximal cost flow, and minimal cost flow problems. These critical elements are essential for understanding transportation dynamics, communication, and resource allocation networks. Furthermore, we explore real-life scenarios where these network flow problems arise, shedding light on their practical significance.</p></abstract>
<kwd-group kwd-group-type="author"><kwd>Operational research</kwd><kwd>Network flow</kwd><kwd>Linear programming problem</kwd><kwd>Minimum cost flow</kwd></kwd-group>
</article-meta></front>
<body>
<sec id="sec-1"><label>1</label><title>Introduction</title>
<p>The significance of Operations Research (OR) in current human life in a business context cannot be overstated. OR consultants or analysts undertake detailed assessments of company issues, processes, and vulnerabilities, leveraging advanced pattern and trend analysis to construct models. According to Churchman, C. W [1], &quot;OR has been described as a method, an approach, a set of techniques, a team activity, a combination of many disciplines, an extension of particular disciplines (mathematics, engineering, economics), a new discipline, a vocation, even a religion. It is perhaps some of all these things.&quot; The field of OR involves using diverse techniques and algorithms to solve particular mathematical models. These models demand finding the values of decision variables that achieve the best possible outcome for the objective function while adhering to a system of inequality and equality constraints. These models yield critical insights and strategic interventions to resolve organizational problems efficiently.</p>
<p>OR plays a pivotal role across various domains. It has various real-life applications, such as the Traveling Salesman problem [2], inventory [3], traffic management [4], network flow optimization [5], Linear Programming (LP) [6], and so on. In the realm of RO, decision-making and problem-solving play crucial roles across diverse industries. Among the topics within RO, Linear Programming Problems (LPPs) emerge as a widely discussed subject, which will be explored in greater detail in the following paragraph.</p>
<p>LP has diverse applications, including different areas but not limited to addressing transportation challenges, optimizing vehicle routes, public transportation schedules, and airline operations to enhance efficiency and reduce costs. Researchers have explored various aspects of LP, such as Tripathi and Kumar [7], which discussed the LPP under uncertainty environments. Later, Tripathi and Kumar [8] and Tripathi et al. [9] conducted a short literature review on the LPP to explore Neutrosophic LP within advanced extended fuzzy contexts.</p>
<p>Additionally, OR contributes to communication network design, improving data transmission efficiency and call center management. Meanwhile, network analysis, which integrates the Critical Path Method (CPM) [10] and Program Evaluation and Review Technique (PERT) [11], offers valuable insights for project management, considering time constraints, resource allocation, and risk analysis. Pratyusha et al. [12] reviewed the extended uncertainty principle for Neutrosophic critical path problems. This first time, Miriyala and Kumar [13] used Python programming in Neutrosophic environments to solve critical path problems in extended uncertain environments. Additionally, Miriyala and Kumar [14] discussed another approach to solving critical path problems in a Neutrosophic environment using Python.</p>
<p>Furthermore, OR models optimize inventory levels, pricing strategies, and the entire supply chain, balancing costs, profits, and service levels. In inventory management, Dubey and Kumar [15] and Dubey et al. [16] reviewed the recent trends and advancements of the inventory model under the extended uncertainty principle. Moreover, with sensitivity analysis, Dubey and Kumar [17] investigated Neutrosophic inventory models in advanced fuzzy contexts.</p>
<p>This initiative centers around achieving specific objectives: enhancing efficiency, reducing costs, and improving overall effectiveness. Noteworthy contributions to the field of Operational Research are summarized in <xref ref-type="table" rid="tab1">Table 1</xref> and visualized in <xref ref-type="fig" rid="fig1">Fig. 1</xref> below.</p>
<table-wrap id="tab1"><label>Table 1</label><caption><p>Operational research impact on real-life applications: insights from researchers Authors Areas Applications Significance</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:1:66,214.9,537.1,236.6"/><graphic content-type="pdf-region" xlink:href="pdf-region:2:66,727.6,537.1,751"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>Lapidoth investigated by the author, with the exploration of capacity Duality theory Multiple-Antenna and Moser bounds through duality and consideration of practical Systems [18] applications for multiple-antenna systems on flat-fading channels.</p>
<p>The author proposed a novel operator selection framework Scheduling Grid scheduling Fu et al. [19] using Maximum Spread (MS) and Generational Distance problem problems (GD) to enhance diversity while maintaining convergence. The objective of this paper is to expand upon a multi-Multi-objective Hossein et objective programming methodology by introducing an LPP optimization al. [20] approach for solving LPP involving grey data and problems variables.</p>
<p>Many to Many In this paper, an enhanced approach to address the Zhu et al.</p>
<p>Assignment assignments assignment problem is presented by incorporating [21] problem backtracking into the Kuhn–Munkres algorithm.</p>
<p>Simaiakis A novel analytical queuing model for airport departure Airport Departure and processes is introduced and validated in this paper. The Queuing theory Process Balakrishnan model incorporates stochastic and dynamic features [22] through transient analysis of the D/E/1 queuing system.</p>
<p>The figure labeled as <xref ref-type="fig" rid="fig1">Fig.1</xref> visually illustrates <xref ref-type="table" rid="tab1">Table 1</xref> in a pictorial format.</p>
<fig id="fig1"><label>Figure 1</label><caption><p>Pictorial representation of Table 1.</p></caption><graphic xlink:href="https://opt.reapress.com/public/journals/1/jats-figures/51/fig-1-a3430f4fc93e.jpg"/></fig>
<p>LP is an important optimization method. Soviet mathematician Leonid Kantorovich introduced the concept of LP in the late 1930s, followed independently by American mathematician George Dantzig [23]. Its main goal is to find the best possible value for decision variables while meeting all the constraints. These constraints can be things like resource limitations or budget restrictions. Additionally, LP helps us maximize or minimize an objective function representing our ultimate goal.</p>
<p>It has many applications in various fields, including engineering, efficient home energy management [24], finance, transportation, and so on. Furthermore, we have explored significant contributions to the LPP in <xref ref-type="table" rid="tab2">Table 2</xref> below.</p>
<table-wrap id="tab2"><label>Table 2</label><caption><p>Researchers in various fields have explored the impact of LPPs on real-life applications.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:2:66,166.5,537.1,218.9"/><graphic content-type="pdf-region" xlink:href="pdf-region:3:66,715.1,537.1,755.7"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>simplex programming solving quadratic programming problems by reducing method the symmetric basis matrix, akin to the revised simplex method in LP objective functions.</p>
<p>Abaffy and 2013 ABS Mixed integer The author demonstrates the integration of Gomory&apos;s Fodor [26] Algorithm LP original cutting-plane approach into the ABS class of algorithms.</p>
<p>Chopra et al. [27] 2017 Hungarian Multirobot The author suggests a distributed adaptation of the Method assignment Hungarian method to efficiently tackle the well-problem. known multi-robot assignment.</p>
<p>Darvishi and 2020 Dual Grey LPPs To bridge grey system theory with optimization, the Nasseri [28] simplex author introduces a dual LPP, thereby extending its method foundational definitions and concepts.</p>
<p>Singaravelan et 2021 Two-Phase Efficient The author presents an innovative Two-Phase al. [24] Method- Energy Simplex Method-based demand response program based Management customized for residential customers, aiming to reduce peak demand, optimize electricity consumption costs, enhance consumer comfort, and improve computational efficiency.</p>
<p>In the survey, we examined the contributions of different authors to LPPs. This underscores the crucial role that LPPs play in the field of OR. Researchers and authors delve into strategies for maximizing profits while minimizing costs and losses within these LPPs. The decision variables in this model represent the quantities to be determined.</p>
<p>However, significant gaps exist in the current understanding of LPP, particularly regarding its application in real-world scenarios. The main objective of this paper is to delve into the contemporary trends and applications of LPPs. Therefore, we aim to bridge these gaps by examining network flow problems. Network problems primarily involve three distinct types of network problems: the shortest path, maximal cost flow, and Minimal Cost Flow (MCF) problems. This review article extensively examines crucial elements concerning network flow problems.</p>
</sec>
<sec id="sec-2"><label>2</label><title>Discuss the Recent Trends and Applications of Linear Programming in Network Flow</title>
<p>Network flow is a valuable application of LPPs that address a wide range of issues. The MCF problem, a subset of network flow problems, represents a significant and practical model. MCF involves demand nodes, supply nodes, and linear flow costs along the edges of the network problems. The primary objective of the MCF problem is to transmit flow from a set of supply nodes to a set of demand nodes through the network arcs, minimizing the total cost. This network consists of supply nodes, demand nodes, and directed arcs, each associated with a cost and capacity constraint.</p>
<p>In this section, we will discuss the MCF problem that stands out as a special case within the broader network flow problem. The MCF problem aims to determine the most cost-effective way to transport a specified flow volume through a network. The task involves finding an optimal solution that meets demand while adhering to the capacity constraints of each arc.</p>
<p>In the discussion, we will explore research conducted by various scholars concerning MCF problems in diverse uncertain environments such as Ghatee and Hashemi [29] explored a new method by using a ranking function, which transforms the fully fuzzified MCF Problem into three crisp problems that can be solved in polynomial time. They provide combinatorial algorithms to find the fuzzy optimal flow. Tripathi and Kumar [30] proposed a new approach to solving MCF problems with Neutrosophic cost problems using a multi-objective LP approach. Ebrahimnejad et al. [31] propose a standardized bounded dual simplex algorithm with penalty costs for solving the MCF problem. Using the proposed method, the minimum cost of carrying a commodity under fuzzy cost through a capacity-constrained network (utilizing available supply at some nodes to meet demand at other nodes) can be determined by using the ranking function. Majumder et al. [32] developed a new method for a network&apos;s ambiguous Maximum Flow (MF), where capacities are modeled as random fuzzy variables. The investigation focuses on developing the Chance-Constrained (CC) model and the Expected Value (EV) model for the MF problem within this fuzzy environment.</p>
<p>Furthermore, we formulate their classical equivalent models. Meanwhile, Tripathi et al. [33] addressed MCF problems with the cost of single-valued Neutrosophic numbers. They introduced a novel approach based on a custom ranking function tailored for the MCF problem-an innovative endeavor within the field of Neutrosophic sets.</p>
</sec>
<sec id="sec-3"><label>3</label><title>Conclusion</title>
<p>In this review, we thoroughly evaluate numerous approaches and methods researchers employ to model and investigate problems. This paper investigates current trends and practical applications of LP in the context of network flow problems. Our study addresses gaps by analyzing recent advancements, focusing on three types of network problems: shortest path, maximal cost flow, and MCF. Furthermore, we explore real-world scenarios where these problems exist. The paper concludes by proposing a tailored research framework suited to the current context and offering recommendations for future research.</p>
</sec>
<sec id="sec-4"><title>Author Contributions</title>
<p>Conceptualization, Tripathi; Methodology, Ranjan Kumar.; Validation, Tripathi and Ranjan kumar; formal analysis bt both of authors.</p>
</sec>
<sec id="sec-5"><title>Funding</title>
<p>The authors funded the research and All authors have read and agreed to the published version of the manuscript.</p>
</sec>
<sec id="sec-6"><title>Data Availability</title>
<p>Some data were obtained from literature, which has been included in the references. No special permission was required to obtain and use the data.</p>
</sec>
<sec id="sec-7"><title>Conflicts of Interest</title>
<p>The authors declare no conflict of interest. No Funders, other than the authors, played a role in the study&apos;s design, in the collection, analysis, or interpretation of the data, in the writing of the manuscript, or in the decision to publish the results.</p>
</sec>
<sec id="sec-8"><title>Refrences</title>
<p>[1] Churchman, C. W., Ackoff, R. L., &amp; Arnoff, E. L. (1957). Introduction to operations research. Introduction to operations research. Wiley, pp. 645. <ext-link ext-link-type="uri" xlink:href="https://psycnet.apa.org/record/1957-05210-000">https://psycnet.apa.org/record/1957-05210-000</ext-link> [2] Dey, A., Kumar, R., &amp; Broumi, S. (2022). The neutrosophic traveling salesman problem with neutrosophic edge weight: formulation and a genetic algorithm. International journal of neutrosophic science (IJNS), 19(3), 40–46. DOI: 10.54216/IJNS.190304 [3] Dubey, A., &amp; Kumar, R. (2024). Recent trends and advancements in inventory management. EAI endorsed transactions on scalable information systems, 11(2). DOI: 10.4108/eetsis.4543 [4] Dantzig, G. B., Blattner, W. O., &amp; Rao, M. R. (1966). Finding a cycle in a graph with minimum cost to time ratio with application to a ship routing problem. Defense technical information center, New York, 77–84. DOI: 10.21236/ad0646553 [5] Arisawa, S., &amp; Elmaghraby, S. E. (1972). Optimal time-cost trade-offs in GERT networks. Management science, 18(11), 589–599. DOI: 10.1287/mnsc.18.11.589 [6] Tripathi, S. K., &amp; Kumar, R. (2023). A short literature on linear programming problem. EAI endorsed transactions on energy web, 10(1). DOI: 10.4108/ew.4516 [7] Tripathi, S. K., &amp; Kumar, R. (2024). A short literature on linear programming problem under uncertainty. In Data-driven modelling with fuzzy sets (pp. 165–176). CRC Press. DOI:</p>
<p>10.1201/9781003487029-8 [8] Tripath, S. K., Dey, A., Broumi, S., &amp; Ranjan, K. (2024). Exploring neutrosophic linear programming in advanced fuzzy contexts. Neutrosophic sets and systems, 66(1), 170–184.</p>
<p><ext-link ext-link-type="uri" xlink:href="http://fs.unm.edu/nss8/index.php/111/article/download/4373/1908">http://fs.unm.edu/nss8/index.php/111/article/download/4373/1908</ext-link> [9] Tripathi, S. K., Kumar, R., &amp; others. (2023). A review of neutrosophic linear programming problems under uncertain environments. Full length article, 21(4), 94. DOI: 10.54216/IJNS.210410 [10] Pratyusha, M. N., &amp; Kumar, R. (2024). A comparative study on critical path method and project evaluation and review technique in construction under uncertain environment. In Data-driven modelling with fuzzy sets (pp. 150–164). CRC Press. DOI: 10.1201/9781003487029-7 [11] Navya Pratyusha M, R. K. (2023). Critical path method and project evaluation and review technique under uncertainty: a state-of-art review. International journal of neutrosophic science (IJNS), 21(03), 143– 153. DOI: 10.54216/IJNS.210314 [12] Dey, A., Broumi, S., Kumar, A Ranjan, &amp; Pratyusha, N. (2024). Critical path method &amp; project evaluation and review technique: a neutrosophic review. Neutrosophic sets and systems, 67, 135–146. <ext-link ext-link-type="uri" xlink:href="https://fs.unm.edu/nss8/index.php/111/article/view/4421/1917">https://fs.unm.edu/nss8/index.php/111/article/view/4421/1917</ext-link> [13] Pratyusha, M. N., &amp; Kumar, R. (2024). Enhancing critical path problem in neutrosophic environment using Python. Computer modeling in engineering &amp; sciences, 140(3), 2957–2976. DOI:</p>
<p>10.32604/cmes.2024.051581 [14] Secretariat, B. A. P., &amp; Pradesh, A. (2024). Solving neutrosophic critical path problem using Python. Journal of information &amp; optimization sciences, 45(4), 897–911. DOI: 10.47974/JIOS-1614 [15] Dubey, A., Kumar, R., &amp; others. (2023). Extended uncertainty principle for inventory control: an updated review of environments and applications. International journal of neutrosophic science, 21(4), 8. DOI: 10.54216/IJNS.210401 [16] Dubey, A., Dey, A., Broumi, S., Kumar, R. (2024). A survey on neutrosophic principles for inventory management problem. Neutrosophic sets and systems, 68(1), 19.</p>
<p><ext-link ext-link-type="uri" xlink:href="https://digitalrepository.unm.edu/cgi/viewcontent.cgi?article=2666&amp;context=nss_journal">https://digitalrepository.unm.edu/cgi/viewcontent.cgi?article=2666&amp;context=nss_journal</ext-link> [17] Dubey, A., Koumar, R. (2024). Inventory model with sensitivity analysis under uncertain environment. Journal of information and optimization sciences, 24(4), 1081–1092. DOI: 10.47974/JIOS-1693 [18] Lapidoth, A., &amp; Moser, S. M. (2003). Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels. IEEE transactions on information theory, 49(10), 2426–2467. <ext-link ext-link-type="uri" xlink:href="https://moser-isi.ethz.ch/docs/papers/alap-smos-2003-3.pdf">https://moser-isi.ethz.ch/docs/papers/alap-smos-2003-3.pdf</ext-link> [19] Fu, G. Z., Huang, H. Z., Li, Y. F., &amp; Zhou, J. (2021). An adaptive hybrid evolutionary algorithm and its application in aeroengine maintenance scheduling problem. Soft computing, 25, 6527–6538. DOI:</p>
<p>10.1007/s00500-021-05647-y [20] Razavi Hajiagha, S. H., Akrami, H., &amp; Sadat Hashemi, S. (2012). A multi-objective programming approach to solve grey linear programming. Grey systems: theory and application, 2(2), 259–271. DOI: 10.1108/20439371211260225 [21] Zhu, H., Liu, D., Zhang, S., Zhu, Y., Teng, L., &amp; Teng, S. (2016). Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking. Theoretical computer science, 618(7), 30–41. DOI: 10.1016/j.tcs.2016.01.002 [22] Simaiakis, I., &amp; Balakrishnan, H. (2016). A queuing model of the airport departure process.</p>
<p>Transportation science, 50(1), 94–109. DOI: 10.1287/trsc.2015.0603 [23] Dantzig, G. B. (2002). Linear programming. Operations research, 50(1), 42–47. DOI:</p>
<p>10.1287/opre.50.1.42.17798 [24] Singaravelan, A., Kowsalya, M., Ram, J. P., Gunapriya, B., &amp; Kim, Y. J. (2021). Application of two-phase simplex method (TPSM) for an efficient home energy management system to reduce peak demand and consumer consumption cost. IEEE access, 9, 63591–63601. DOI: 10.1109/ACCESS.2021.307268 [25] Rusin, M. H. (1971). A revised simplex method for quadratic programming. SIAM journal on applied mathematics, 20(2), 143–160. DOI: 10.1137/0120019 [26] József, Abaffy. Szabina, F. (2013). Solving integer and mixed integer linear problems with ABS method. Acta polytechnica hungarica, 10(7), 81–98.</p>
<p><ext-link ext-link-type="uri" xlink:href="http://efolyoirat.niif.hu/02400/02461/00045/pdf/EPA02461_acta_polytechnica_hungarica_2013_07_081-098.pdf">http://efolyoirat.niif.hu/02400/02461/00045/pdf/EPA02461_acta_polytechnica_hungarica_2013_07_081-098.pdf</ext-link> [27] Chopra, S., Notarstefano, G., Rice, M., &amp; Egerstedt, M. (2017). A distributed version of the hungarian method for multirobot assignment. IEEE transactions on robotics, 33(4), 932–947. DOI:</p>
<p>10.1109/TRO.2017.2693377 [28] Darvishi Salookolaei, D., &amp; Nasseri, S. H. (2020). A dual simplex method for grey linear programming problems based on duality results. Grey systems: theory and application, 10(2), 145–157. DOI: 10.1108/GS-10-2019-0044/full/html [29] Ghatee, M., &amp; Hashemi, S. M. (2007). Ranking function-based solutions of fully fuzzified minimal cost flow problem. Information sciences, 177(20), 4271–4294. DOI: 10.1016/j.ins.2007.05.007 [30] Tripathi, S., &amp; Kumar, R. (2024). Solving neutrosophic minimal cost flow problem using multi-objective linear programming problem. Journal of information and optimization sciences, 45, 1093–1104. DOI: 10.47974/JIOS-1694 [31] Ebrahimnejad, A., Nasseri, S. H., &amp; Mansourzadeh, S. M. (2013). Modified bounded dual network simplex algorithm for solving minimum cost flow problem with fuzzy costs based on ranking functions. Journal of intelligent &amp; fuzzy systems, 24(1), 191–198. DOI: 10.3233/IFS-2012-0545 [32] Majumder, S., Saha, B., Anand, P., Kar, S., &amp; Pal, T. (2018). Uncertainty based genetic algorithm with varying population for random fuzzy maximum flow problem. Expert systems, 35(4), e12264. DOI: 10.1111/exsy.12264 [33] Tripathi, S. K., Nisar, K. S., Broumi, S., Kumar, R., &amp; others. (2024). Efficient neutrosophic optimization for minimum cost flow problems. International journal of neutrosophic science, 25(1), 81. DOI:</p>
<p>10.54216/IJNS.250107</p>
</sec>
</body>
</article>