In the column minimum method, the first column that is the lowest cost cell is exhausted. The objective is to allocate the maximum either at the first source or demand at the destinations or to satisfy both. This process must be continued for all the other reduced transportation costs until and unless the supply and demand are satisfied.

The initial basic feasible solution (IBFS) is a significant step to achieve the minimal total cost (optimal solution) of the transportation problem. However, the existing methods of IBFS do not always provide a good feasible solution which can reduce the number of iterations to find the optimal solution. This initial basic feasible solution can be obtained by using any of the following methods.
a) North West Corner Method.
b) Least Cost Method.
c) Row Minimum Method.
d) Column Minimum Method.
e) Vogel's Approximation Method.
etc.
For more technical details about the algorithms please refer below URLs.
<https://theintactone.com/2018/05/24/ds-u2-topic-8-transportation-problems-initial-basic-feasible-solution/>.
<https://www.brainkart.com/article/Methods-of-finding-initial-Basic-Feasible-Solutions_39037/>.
<https://myhomeworkhelp.com/row-minima-method/>.
<https://myhomeworkhelp.com/column-minima-method/>.

Royson Almeida

IBFS

Initial Basic Feasible Solution for Transportation Problem

CMM function

<dl><dt>ex_matrix</dt>
<dd>A cost matrix where last column must be the supply and last row must be the demand. Input matrix should not have any missing values (NA), otherwise function will throw an error. It should be balanced i.e. total demand must be equal to total supply.</dd></dl>

Arguments

Column Minimum Method — CMM

<dl>

<dt>ex_matrix</dt>
<dd>A cost matrix where last column must be the supply and last row must be the demand. Input matrix should not have any missing values (NA), otherwise function will throw an error. It should be balanced i.e. total demand must be equal to total supply.</dd>

</dl>

CMM: Column Minimum Method

Description

Usage

Value

Arguments

Examples