<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="nlm-ta">REA Press</journal-id>
      <journal-id journal-id-type="publisher-id">Null</journal-id>
      <journal-title>REA Press</journal-title><issn pub-type="ppub">3042-0199</issn><issn pub-type="epub">3042-0199</issn><publisher>
      	<publisher-name>REA Press</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">https://doi.org/10.22105/opt.v1i1.51</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group><subject>Operational research, Network flow‎, Linear programming problem, Minimum cost flow‎.</subject></subj-group>
      </article-categories>
      <title-group>
        <article-title>Recent Trends and Applications of Linear Programming in Network Flow: A Comprehensive Survey</article-title><subtitle>Recent Trends and Applications of Linear Programming in Network Flow: A Comprehensive Survey</subtitle></title-group>
      <contrib-group><contrib contrib-type="author">
	<name name-style="western">
	<surname>Shubham Kumar </surname>
		<given-names>Tripathi </given-names>
	</name>
	<aff>VIT-AP University, Inavolu, Beside AP Secretariat, Amaravati AP, India.</aff>
	</contrib><contrib contrib-type="author">
	<name name-style="western">
	<surname>Ranjan </surname>
		<given-names>Kumar</given-names>
	</name>
	<aff>VIT-AP University, Inavolu, Beside AP Secretariat, Amaravati AP, India‎.</aff>
	</contrib></contrib-group>		
      <pub-date pub-type="ppub">
        <month>09</month>
        <year>2024</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>16</day>
        <month>09</month>
        <year>2024</year>
      </pub-date>
      <volume>1</volume>
      <issue>1</issue>
      <permissions>
        <copyright-statement>© 2024 REA Press</copyright-statement>
        <copyright-year>2024</copyright-year>
        <license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/2.5/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</p></license>
      </permissions>
      <related-article related-article-type="companion" vol="2" page="e235" id="RA1" ext-link-type="pmc">
			<article-title>Recent Trends and Applications of Linear Programming in Network Flow: A Comprehensive Survey</article-title>
      </related-article>
	  <abstract abstract-type="toc">
		<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'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>
    </article-meta>
  </front>
  <body></body>
  <back>
    <ack>
      <p>Null</p>
    </ack>
  </back>
</article>