Research Article

Recent Trends and Applications of Linear Programming in Network Flow: A Comprehensive Survey

Authors

  • Shubham Kumar Tripathi * VIT-AP University, Inavolu, Beside AP Secretariat, Amaravati AP, India.
  • Ranjan Kumar VIT-AP University, Inavolu, Beside AP Secretariat, Amaravati AP, India‎.

https://doi.org/10.22105/opt.v1i1.51

Abstract

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'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.    

Keywords

Operational research Network flow‎ Linear programming problem Minimum cost flow‎
References (33)
  1. [1] Churchman, C. W., Ackoff, R. L., & Arnoff, E. L. (1957). Introduction to operations research. Introduction ‎to operations research. Wiley, pp. 645. https://psycnet.apa.org/record/1957-05210-000‎

  2. [2] Dey, A., Kumar, R., & 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. [3] Dubey, A., & 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. [4] Dantzig, G. B., Blattner, W. O., & 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. [5] Arisawa, S., & 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‎

Article Metrics

  • Published 2024-09-16
  • Issue Vol. 1 No. 1 (2024): OPT
  • Section Articles
  • Document Type Research Article
  • Views 1927
  • Downloads 25

How to Cite

Tripathi, S. K. ., & Kumar, R. . (2024). Recent Trends and Applications of Linear Programming in Network Flow: A Comprehensive Survey. Optimality, 1(1), 140-146. https://doi.org/10.22105/opt.v1i1.51

Similar Articles

1-10 of 70

You may also start an advanced similarity search for this article.