2015Unpublished venueRequires access

NETWORK SIMPLEX METHOD USED TO TRANSPORTATION PROBLEM

Bangladesh Dhaka

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

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

Key concepts: Minimum-cost flow problem, Flow network, Mathematical optimization, Transportation theory, Simplex algorithm, Simplex, Multi-commodity flow problem, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
NETWORK SIMPLEX METHOD USED TO TRANSPORTATION PROBLEM — Research Paper | ScholarLens