Scribd
Upload
150 views14 pages

Or TP Optimal Solution

This document discusses how to determine if a given initial basic feasible solution (IBFS) is optimal and how to proceed to the next iteration if it is not. It explains that the optimality test checks if the number of allocations equals m+n-1, where m is the number of rows and n is the number of columns. It also checks if the net evaluations of empty cells are all positive by calculating u's and v's and comparing the cost to u+v. If the IBFS fails this test, the next step is to form a loop with one negative net evaluation cell and alternately assign + and - signs to corners. The minimum allocation among negative signs is shifted to obtain the next IBFS

Uploaded by

Manas Jain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
150 views14 pages

Or TP Optimal Solution

This document discusses how to determine if a given initial basic feasible solution (IBFS) is optimal and how to proceed to the next iteration if it is not. It explains that the optimality test checks if the number of allocations equals m+n-1, where m is the number of rows and n is the number of columns. It also checks if the net evaluations of empty cells are all positive by calculating u's and v's and comparing the cost to u+v. If the IBFS fails this test, the next step is to form a loop with one negative net evaluation cell and alternately assign + and - signs to corners. The minimum allocation among negative signs is shifted to obtain the next IBFS

Uploaded by

Manas Jain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 14

Optimal Solution

• The objective of this step is to get optimal solution


• It requires IBFS solution along with the unit
transportation cost matrix (Preferably IBFS obtained
by VAM)
• First we use test for optimality for the given IBFS
solution to know whether the given IBFS is optimal
solution or not.
• If optimality condition of optimality test is satisfied,
then we can conclude that IBFS is an optimal solution
• If optimality condition is not satisfied, then we need to
go to next iteration to refine the existing IBFS.
• We need to repeat these iterations till an optimality
condition is satisfied.
• Which ever iteration solution is satisfying optimality
condition, the solution of that iteration is an optimal
solution
Optimality Test
1. Check the condition:
m+n-1= number of allocations;
where m=number of rows/origins,
n=number of columns/destinations
2. Calculate u’s and v’s:
u+v = cost (use this formulae with reference to the
position of allocations only)
3. Check optimality condition:
(All net evaluations must be positive)
Net evaluations (only for empty cells) = cost-(u+v)
Example 1: Test for optimality when IBFS is
given
Total Transportation cost
= 100x15+150x18+120x15+30x20+50x25
=Rs.7850
Example 1: Test for optimality when
IBFS is given
Example 2: Test for optimality
when IBFS is given
Total Transportation cost
= 11x13+6x17+3x18+4x23+7x27+12x18
Going to Next Iteration procedure
(when optimality condition
is not satisfied)

1. Loop formation
2. Assigning signs at all corners of the
loop
3. Finding shifting allocation
4. Go to the next iteration
Going to Next Iteration procedure
1. Loop formation: we need to form a loop by satisfying the following
conditions
• The loop must be a closed loop
• The loop must be formed with horizontal lines and vertical lines
only
• Any one corner of the loop must be with negative net evaluation
cell and all other corners must be with allocations
2. Assigning signs at all corners of the loop: to begin with assign
+ sign at negative net evaluation cell and alternately -, + … and so on
3. Finding shifting allocation: The minimum allocation among
negative signs is the shifting allocation
4. Go to the next iteration:
• cost matrix remain same
• Allocations which are not part (corners) of the loop remain same
• Allocations which are part (corners) of the loop changes as follows
At every corner of the loop: the previous allocation, the sign, the
shifting allocation
Example-1: Learning to Proceed
to next iteration
IBFS Total Transportation cost
= 5x2+8x3+7x1+2x1+1x6+11x2
= Rs.71
Example-1: Learning to Proceed
to next iteration
Example-1: Learning to Proceed
to next iteration
Optimal Total Transportation cost
= 5x2+8x3+1x4+6x1+2x1+12x2
= Rs.70

You might also like