NETWORK SIMPLEX METHOD USED TO TRANSPORTATION PROBLEM
Bangladesh Dhaka
Abstract
Bangladesh Dhaka
Abstract
A Transportation problem (TP) with huge number of variables can be solved by Modified Distribution Method (MODIM) and Stepping Stone Method (SSM) both are simplex method which is used in operation research such as Traveling salesmen problem, Assignment problem, Network problem and many industrial management problem. Again a network simplex method is used Maxima -and Minimal Cost Flow problem (MMCFP) by using minimum spinning tree, optimality condition and dual solution. Here a Transportation problem (TP) has been taken and converted to Minimal Cost Flow problem (MCFP) then solved by network simplex method. An accurate result has been found by applying this method. Keyword: Network Simplex Method (NSM), Minimal Cost Flow problem (MCFP), Transportation problem (TP), Network Flow, Optimality Condition.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A Transportation problem (TP) with huge number of variables can be solved by Modified Distribution Method (MODIM) and Stepping Stone Method (SSM) both are simplex method which is used in operation research such as Traveling salesmen problem, Assignment problem, Network problem and many industrial management problem. Again a network simplex method is used Maxima -and Minimal Cost Flow problem (MMCFP) by using minimum spinning tree, optimality condition and dual solution. Here a Transportation problem (TP) has been taken and converted to Minimal Cost Flow problem (MCFP) then solved by network simplex method. An accurate result has been found by applying this method. Keyword: Network Simplex Method (NSM), Minimal Cost Flow problem (MCFP), Transportation problem (TP), Network Flow, Optimality Condition.
Key concepts: Minimum-cost flow problem, Flow network, Mathematical optimization, Transportation theory, Simplex algorithm, Simplex, Multi-commodity flow problem, Computer science