Subsequently Direct Right Maximum Minimum Financial plan Eventual Procedure for Sheltered and Fanatical Rectangular Arrangement

: In this research, the proposed algorithm is Next Immediate Right Maximum Minimum Allotment method. This algorithm is to calculate the optimal value of cost for the Travelling agent to reduce the transportation cost. The expressed algorithm is very useful to derive the allotment in every sector of the rectangular matrix without any disturbance in degeneracy condition.


Introduction
The transportation problem is one of LPP (Special case) [1][2].This lead to minimize the cost with maximum utilization [3] [4].Here every supply and demand will have its own properties to satisfy the degeneracy condition.[5] Evidently Transportation problems have an application in Biomedical Engineering and Hospital field.[6][7][8].Ethically Transportation models take part in an essential role in medicine distribution management along with cost minimizing and improving service in effective manner.[1], [3], [9], [10]

Algorithm:
Next Immediate Right Maximum Minimum Allotment (Nirmxmia) STEP 1: Construct the Transportation Table (TT) for the given pay off matrix (POM).

NOTE:
If the given pay off matrix is not balanced then balance the payoff matrix by introducing Zero column or Zero row and allot demand and supply for the row or column in the very last iteration.
Example 1: Consider the following Balanced POM to achieve minimum cost.

Table 1
By Applying the above said Procedure, We get Step 1: Here the Maximum cost is 70 in (2, 1) and (3,3) in NCTT, we got the tie up with maximum cost, so we considered the maximum cost 70 along with the maximum demand 7, (Here 70 is a Pivot Element & highlighted with Violet Colour in the following table 1.1).Select the minimum cost 10 from the next immediate right side of

Research Article
the Pivot element and allot the maximum possible demand 7 units.Blue colour marked row is not considered for the next iteration.

Table 1.1
Step 2: Here the Maximum cost is 70 in (2, 1) and (3,3) in NCTT, we got the tie up with maximum cost, so we considered the maximum cost 70 along with the maximum demand 7, (Here 70 is a Pivot Element & highlighted with Violet Colour in the following table 1.2).Select the minimum cost 20 from the next immediate right of the Pivot element column and allot the maximum possible demand 7 units.Blue colour marked column is not considered for the next iteration.

Table 1.2
Step 3: Here the Maximum cost is 70 in (2, 1) and (3,3) in NCTT, we got the tie up with maximum cost, so we considered the maximum cost 70 along with the maximum demand 7, (Here 70 is a Pivot Element & highlighted with Violet Colour in the following table 1.3).Here we interchange second and third column along with their demand.Select the minimum cost 8 from the next immediate right side of the Pivot element and allot the maximum possible demand 8 units.Blue colour marked row is not considered for the next iteration.

Table 1.3
Step 4: Here the Maximum cost is 70 in (2, 1) and (3,3) in NCTT, we got the tie up with maximum cost, so we considered the maximum cost 70 along with the maximum demand 7. (Here 70 is a Pivot Element & highlighted with Violet Colour in the following table 1.4).Here we interchange first and third column along with their demand Select the minimum cost 40 from the right side of the Pivot element and allot the maximum possible demand 3 units.Blue colour marked row is not considered for the next iteration.

Table 1.4
Step 5: Here the Maximum cost is 70 in TT (2, 1), (Here 70 is a Pivot Element & highlighted with Violet Colour in the following table 1.5).Supply the maximum possible supply 7 units in NCTT (2, 3) and 2 units in NCTT (1, 2) which leads to the solution satisfying all the conditions.

Table 1.5
The resulting initial feasible solution is given below.

Table 3
By Applying the Proposed algorithm, we get the resulting initial feasible solution is given below.

STEP 2 :STEP 3 :
Choose the maximum element from POM. Supply the maximum demand for the minimum element of the next immediate right side column (or) row of the chosen maximum element column in NCTT.

STEP 4 :STEP 5 :
Select the next maximum element in newly CTT and repeat the step 2 & 3 until degeneracy condition satisfied.In case, maximum element column is in extreme right, then shift the entire column where the minimum element appears to the right of the maximum element column.

Table 1 .6 Optimum Cost: Table 1.7 Example 2: Consider
the following Balanced POM to achieve minimum cost.

Table 2
By Applying the above Mentioned Procedure, We get the resulting initial feasible solution is given below.

Table 2 .1 Optimum Cost:Table 2 . 2 Example 3 :
Consider the following Balanced POM to achieve minimum cost.