New Method to find initial basic feasible solution of Transportation Problem using MSDM

2017 ◽  
Vol 5 (12) ◽  
pp. 223-226 ◽  
Author(s):  
N.M. Morade ◽  
Keyword(s):  
Transportation Problem ◽  
Feasible Solution ◽  
New Method ◽  
Basic Feasible Solution

scholarly journals A New Method to Obtain an Initial Basic Feasible Solution of Transportation Problem with the Average Opportunity Cost Method

2019 ◽  
Vol 9 (2) ◽  
pp. 206-209
Keyword(s):  
Opportunity Cost ◽  
Transportation Problem ◽  
Feasible Solution ◽  
Optimal Solution ◽  
The Other ◽  
New Method ◽  
Basic Feasible Solution ◽  
Distribution Method

In this preset article, we have explained all new method to get Initial Basic Feasible solution (IBFS) of Transportation Problem (TP) with the Average Opportunity Cost Method (AOCM). It is very simple arithmetical and logical calculation.After finding the IBFS we use Modified Distribution Method (MODI) method to optimize the IBFS. Results obtained by using this method we found that IBFS of most of the transportation problem closer to optimal solution than using the other existing methods. We illustrate the same by suitable examples.

scholarly journals Statistical Methods for Solving Transportation Problems

2019 ◽  
Vol 25 (2) ◽  
pp. 10-13
Author(s):  
Alina Baboş
Keyword(s):  
Linear Programming ◽  
Statistical Methods ◽  
Approximation Method ◽  
Transportation Problem ◽  
Feasible Solution ◽  
Basic Feasible Solution ◽  
Statistical Tools ◽  
Numerical Examples ◽  
North West ◽  
Shipping Cost

Abstract Transportation problem is one of the models of Linear Programming problem. It deals with the situation in which a commodity from several sources is shipped to different destinations with the main objective to minimize the total shipping cost. There are three well-known methods namely, North West Corner Method Least Cost Method, Vogel’s Approximation Method to find the initial basic feasible solution of a transportation problem. In this paper, we present some statistical methods for finding the initial basic feasible solution. We use three statistical tools: arithmetic and harmonic mean and median. We present numerical examples, and we compare these results with other classical methods.

scholarly journals A NEW APPROACH TO FIND THE INITIAL BASIC FEASIBLE SOLUTION OF A TRANSPORTATION PROBLEM

2018 ◽  
Vol 6 (5) ◽  
pp. 321-325 ◽  
Author(s):  
Ravi Kumar R ◽  
Radha Gupta ◽  
Karthiyayini O
Keyword(s):  
Transportation Problem ◽  
Feasible Solution ◽  
Cost Minimization ◽  
Optimization Technique ◽  
Transportation Cost ◽  
Basic Feasible Solution ◽  
Standard Methods ◽  
North West ◽  
A New Technique ◽  
Optimum Solution

Transportation problem (TP) in operations research is a widely used optimization technique to study the problems concerned with transporting goods from production places to sale points. The TP may have one or more objectives such as minimization of transportation cost, minimization of distance with respect to time, and so on. There is a systematic method to solve such problems. For this, we find the Initial Basic Feasible Solution (IBFS) to the given problem. North West corner method, least cost method, Vogel’s approximation method are the standard methods one uses to find the IBFS.  In recent years, there are several other methods are proposed to solve such problems. In this paper, we propose a new technique named as Direct Sum Method (DSM) and its effectiveness is compared with the standard methods. The result shows that it is easy to compute and near to the optimum solution of the problem.

Sign in / Sign up

Export Citation Format

Share Document