OperationsResearch

Unit5

Unit5
Structure

TransportationProblem

5.1. 5.2. 5.3. 5.4.

Introduction FormulationofT.P TransportationAlgorithm Theinitialbasicfeasiblesolution 5.4.1NorthWestCornerRule 5.4.2MatrixMinimumMethod 5.4.3Vogelsapproximationmethod

5.5.

Movingtowardsoptimality 5.5.1Improvingthesolution 5.5.2 ModifiedDistributionMethod/MODIMethod/UVmethod. 5.5.3 Degeneracyintransportationproblem

5.6. 5.7. 5.8.

Summary TerminalQuestions AnswerstoSAQsandTQs

5.1Introduction Herewestudyanimportantclassoflinearprogramscalledthetransportationmodel.Thismodel studies the minimization of the cost of transporting a commodity from a number of sources to severaldestinations.Thesupplyateachsourceandthedemandateachdestinationareknown. Thetransportationprobleminvolvesmsources,eachofwhichhasavailableai (i=1,2,..,m) unitsofhomogeneousproductandndestinations,eachofwhichrequiresbj (j=1,2.,n)unitsof products.Hereai andbj arepositiveintegers.Thecostcij oftransportingoneunitoftheproduct
th th fromthei sourcetothej destinationisgivenforeachiandj.Theobjectiveistodevelopan

integral transportation schedule that meets all demands from the inventory at a minimum total transportationcost. Itisassumedthatthetotalsupplyandthetotaldemandareequal.
m n

i.e.

i=1

a = i

bj

(1)

j=1

SikkimManipalUniversity

77

OperationsResearch

Unit5

Thecondition(1)isguaranteedbycreatingeitherafictitiousdestinationwithademandequalto thesurplusiftotaldemandislessthanthetotalsupplyora(dummy)sourcewithasupplyequal totheshortageiftotaldemandexceedstotalsupply.Thecostoftransportationfromthefictitious destinationtoallsourcesandfromalldestinationstothefictitioussourcesareassumedtobezero sothattotalcostoftransportationwillremainthesame.

LearningObjectives: Afterstudyingthisunit,youshouldbeabletounderstandthefollowing

1. Toformulatethetransportationproblem. 2. Findtheinitialbasicfeasiblesolution 3. Comparetheadvantagesofvariousmethodsoffindinginitialbasicfeasiblesolution. 4. Handleandsolvethedegeneracyinthetransportationproblem. 5. Applythemodeltominimizethecostoftransportingacommodity.

5.2 FormulationOfTransportationProblem Thestandardmathematicalmodelforthetransportationproblemisasfollows. Let xij be number of units of the homogenous product to be transported from sourceitothedestinationj Thenobjectiveisto
m n

Minimizez=

i=1

C ij xij

j=1

Subjectto j=1 m x = bj ij = 1 2 .......... n , , ., ij i=1

n

x = a ,i = 1 2 ......,m , , ij i

(2)

withallxij 0andintegrals Theorem: A necessary and sufficient condition for the existence of a feasible solution to the transportationproblem(2)isthat

SikkimManipalUniversity

78

OperationsResearch

Unit5

m i=1

a = i

bj

j=1

SelfAssessmentQuestions1 Fillintheblanks

1. Transportationproblemsareaspecialtypeof___________. 2. Thenumberofrowsandcolumnsneednotalwaysbe___________. 3. Transportationproblemdevelopsascheduleat__________________.

5.3 TheTransportationAlgorithm(MODIMethod) Thefirstapproximationto(2)isalwaysintegralandthereforealwaysafeasiblesolution.Rather than determining a first approximation by a direct application of the simplex method it is more efficient to work with the table given below called the transportation table. The transportation algorithmisthesimplexmethodspecializedtotheformatoftableitinvolves: i) ii) iii) iv) findinganintegralbasicfeasiblesolution testingthesolutionforoptimality improvingthesolution,whenitisnotoptimal repeatingsteps(ii)and(iii)untiltheoptimalsolutionisobtained.

ThesolutiontoT.Pisobtainedintwostages.InthefirststagewefindBasicfeasiblesolutionby any one of thefollowing methodsa) Northwest cornerrale b) Matrix Minima Methodorleast cost method c) Vogels approximation method. In the second stage we test the B.Fs for its optimalityeitherbyMODImethodorbysteppingstonemethod. D1 S1 S2 S3
C11

D2
C12

Dn
C1n

Supply a1 a2

ui u1 u2 u3

x11
C21

x12
C22

x1n
C2n

x21 x31

C31

x22 x32

C32

x2n x3n

C3n

a3

Cm1

Cm2

Cmn

SikkimManipalUniversity

79

OperationsResearch

Unit5

Sm xm1 Demand b1 vj v1 xm2 b2 V2 xmn bn vm

am

um

ai = bi

TransportationTable

SelfAssessmentQuestions2 StateYesorNo

1. InT.P ai = bj forgettingafeasiblesolution. 2. T.Pcanalsobesolvedbysimplexmethod. 3. Matrixminimamethodgivesoptimumsolution.

5.4 TheInitialBasicFeasibleSolution LetusconsideraT.Pinvolvingmoriginsandndestinations.Sincethesumoforigincapacities equals the sum of destination requirements, a feasible solution always exists. Any feasible solution satisfying m+n 1 of the m+n constraints is a redundant one and hence can be deleted.ThisalsomeansthatafeasiblesolutiontoaT.Pcanhaveatthemostonlym+n 1 strictlypositivecomponents,otherwisethesolutionwilldegenerate. ItisalwayspossibletoassignaninitialfeasiblesolutiontoaT.P.insuchamannerthattherim requirementsaresatisfied.Thiscanbeachievedeitherbyinspectionorbyfollowingsomesimple rules. We begin by imagining that the transportation table is blank i.e. initially all xij = 0. The simplestproceduresforinitialallocationdiscussedinthefollowingsection.

5.4.1 NorthWestCornerRule Step1: Thefirstassignmentismadeinthecelloccupyingtheupperlefthand(northwest)corner of the transportation table. The maximum feasible amount is allocated there, that is x11 = min (a1,b1) SothateitherthecapacityoforiginO1 isuseduportherequirementatdestinationD1 issatisfied orboth.Thisvalueofx11 isenteredintheupperlefthandcorner(smallsquare)ofcell(1,1)inthe transportationtable Step2: Ifb1 >a1 thecapacityoforiginO,isexhaustedbuttherequirementatdestinationD1 is

SikkimManipalUniversity

80

OperationsResearch

Unit5

stillnotsatisfied,sothatatleastonemoreothervariableinthefirstcolumnwillhavetotakeona positive value. Move down vertically to the second row and make the second allocation of magnitude x21 =min(a2,b1 x21)inthecell(2,1).ThiseitherexhauststhecapacityoforiginO2 orsatisfies theremainingdemandatdestinationD1. If a1 > b1 the requirement at destination D1 is satisfied but the capacity of origin O1 is not completelyexhausted.Movetotherighthorizontallytothesecondcolumnandmakethesecond allocation of magnitude x12 = min

(a1x11,b2)inthecell(1,2).ThiseitherexhauststheremainingcapacityoforiginO1orsatisfies thedemandatdestinationD2. If b1 = a1, the origin capacity of O1 is completely exhausted as well as the requirement at destinationis completelysatisfied. Thereisatieforsecond allocation, Anarbitrary tie breaking choiceismade.Makethesecondallocationofmagnitudex12 =min(a1 a1,b2)=0inthecell(1, 2)orx21=min(a2,b1 b2)=0inthecell(2,1). Step 3: Start from the new north west corner of the transportation table satisfying destination requirementsand exhaustingtheorigincapacitiesoneatatime,movedowntowardsthelower rightcornerofthetransportationtableuntilalltherimrequirementsaresatisfied. Example 1: Determine an initial basic feasible solution to the following transportation problem usingthenorthwestcornerrule: 01 02 03 D1 6 8 4 6 D2 D3 4 1 9 2 3 6 10 15 Requirements D4 5 7 2 4 14 16 5 35

Availability

th th WhereOiandDjrepresentthei originandthej destinationrespectively.

Solution: ThetransportationtableofthegivenT.P.has12cells. Followingnorthwestcornerrule,the Firstallocationismadeinthecell (1,1),themagnitudebeing x11 =min(14,6)=6 Thesecondallocationismade inthe610154cell(1,2)andthe

610154 16 5 14

SikkimManipalUniversity

81

OperationsResearch

Unit5

magnitudeofallocationisgivenby x12=min(146,10)=8 Thethirdallocationismadeinthecell(2,2),themagnitudebeingx22=min(16,10 8) = 2. The magnitude of fourth allocation, in the cell (2, 3)isgivenby x23 = min (16 2, 15) =14. Thefifth allocationis madeinthe cell (3,3), the magnitudebeingx33=min(5,1514)=1.Thesixthallocationinthecell(3,4)isgivenbyx34=min (51,4)=4. NowalltherimrequirementshavebeensatisfiedandhenceaninitialfeasiblesolutiontotheT.P. hasbeenobtained.Thesolutionisdisplayedas D1 D4 01 02 03 6 6 2 8 4 6 9 1 3 10 6 15 8 4 14 2 4 2 4 5 14 16 5 4 D2 D3

Clearly,thisfeasiblesolutionisnondegeneratebasicfeasiblesolutionfortheallocatedcellsdo notformaloop.Thetransportationcostaccordingtotheaboveloopisgivenby. Z=x11 c11 +x12 c12+x22 c22 +x23 c23+x33 c33 +x34 c34 = 6 6 +8 4+2 9+14 2+ 1 6 + 4 2 =128 5.4.2MatrixMinimumMethod Step1: Determinethesmallestcostinthecostmatrixofthetransportationtable.Letitbe cij , Allocatexij=min(ai,bj)inthecell(i,j)
th Step2: Ifxij=aicrossoffthei rowofthetransportationtableanddecreasebjbyaigotostep3. th ifxij=bjcrossoffthei columnofthetransportationtableanddecreaseai bybj gotostep3. th th ifxij=ai=bjcrossoffeitherthei roworthei columnbutnotboth.

Step 3: Repeat steps 1 and 2 for the resulting reduced transportation table until all the rim requirements are satisfied whenever the minimum cost is not unique make an arbitrary choice amongtheminima.

SikkimManipalUniversity

82

OperationsResearch

Unit5

Example2:ObtainaninitialbasicfeasiblesolutiontothefollowingT.P.usingthematrixminima method. D1 01 02 03 1 4 0 4 D2 2 3 2 D3 3 2 2 D4 4 0 1 6 6 8 10 24 Capacity

6 8 Demand

th th Where0iandDidenotei originandj destinationrespectively.

Solution: ThetransportationtableofthegivenT.P.has12cells.Followingthematrixminima method. The first allocation is made in the cells (3,1) the magnitude being x21 = 4. This satisfies the requirementatdestinationD1 and thuswecrossoffthefirstcolumnfromthetable.Thesecond allocationismadeinthecell(2,4)magnitudex24=min(6,8)=6.Crossoffthefourthcolumnof thetable.Thisyieldsthetable(i) 1 4
4

2 3 2
6 8

3
6

4 6 8 8
4

6 6 0

6 2 6

2 2
6

2 2

0
4

2 10
6 8

(i)

(ii)

There is again a tie for the third allocation. We choose arbitrarily the cell (1,2)andallocatex12 =min(6,6)=6there.Crossoffeitherthesecondcolumnofthefirstrow .Wechoosetocrossoffthefirstrowofthetable.Thenextallocationofmagnitudex22=0ismade inthecell(3,2)crossoffthesecondcolumngettingtable(ii)
6 6

1
2 6

3
2

4
6

4
4 0 6 4

3
0

2
6

(iii)

(iv)

SikkimManipalUniversity

83

OperationsResearch

Unit5

Wechoosearbitrarilyagaintomakethenextallocationincell(2,3)ofmagnitudex23 =min(2,8) =2crossoffthesecondrowthisgivestable(iii).Thelastallocationofmagnitudex23 =min(6, 6)=6ismadeinthecell(3,3). Nowalltherimrequirementshavebeensatisfiedandhenceaninitialfeasiblesolutionhasbeen determined.Thissolutionisshownintable(iv) Sincethecellsdonotformaloop,thesolutionisbasicone.Moreoverthesolutionisdegenerate also.Thetransportationcostaccordingtotheaboverouteisgivenby Z= 6 2 +2 2+6 0+4 0+ 0 2+ 6 2 =28 5.4.3VogelsApproximationMethod TheVogelsApproximationMethodtakesintoaccountnotonlytheleastcostcij butalsothecost thatjustexceedscij .Thestepsofthemethodaregivenbelow. Step 1: For each row of the transportation table identify the smallest and the nest to smallest costs. Determine the difference between them for each row. Display them alongside the transportation table by enclosing them in parenthesis against the respective rows. Similarity computethedifferencesforeachcolumn. Step2: Identifytheroworcolumnwiththelargestdifferenceamongalltherowsandcolumns.If
th atieoccurs,useanyarbitrarytiebreakingchoice,letthegreatestdifferencecorrespondtothei th rowandletCij bethesmallestcostinthei row.Allocatethemaximumfeasibleamountxij =min th th th (ai,bj)inthe(i,j) cellandcrossoffthei roworthej columnintheusualmanner.

Step3: Recomputethecolumnandrowdifferencesforthereducedtransportationtableandgo tostep2.Repeattheprocedureuntilalltherimrequirementsaresatisfied. Remarks: 1. Aroworcolumndifferenceindicatestheminimumunitpenaltyincurredbyfailingtomakean allocationtothesmallestlostcellinthatroworcolumn. 2. It is clear that VAM determines an initial basic feasible solution which is very close to the optimum solution, that is, the number of iterations required to reach the optimal solution is smallinthiscase

SikkimManipalUniversity

84

OperationsResearch

Unit5

Example3: Obtain an initial basic feasible solution to the following T.P using the Vogels approximation method: Warehouses A B C D Requirement Stores II III 1 3 3 5 4 4 1 4 25 17 Availability 34 15 12 19 80

I 5 3 6 4 21

IV 3 4 3 2 17

Solution: The transportation table of the given T.P has 16 cells. The differences between the smallestand next to smallest costsin each row and eachcolumn are computedanddisplayed insidetheparenthesisagainsttherespectivecolumnsandrows.Thelargestofthesedifferences is(3)andisassociatedwiththefourthrowofthetransportationtable. TheminimumcostinthefourthrowisC42 =1.Accordinglyweallocatex42 =min(19,25)=19in thecell(4,2).ThisexhauststheavailabilityatwarehouseD.Crossoffthefourthrow.Therow andcolumndifferencesarenowcomputedfortheresultingreducedtransportationtable(ii).

5 3 6 19 4
21 (1) 25 (2)

1 3 4 1
17 (1) (i)

3 5 4 4
17 (1)

3 34(2) 4 3
12(1) 15(0)

56 1

3 34(2) 15(0)

4 12(1)

2
19(3) 21 (2)

6 19 (2)

4 (ii)

17 (1)

17 (0)

thelargestofthisis(2)andisassociatedwiththefirstrowaswellasthefirstandsecondcolumn. WeselectarbitrarilythefirstrowwhoseminimumcostisC12 =1.Thusthesecondallocationof magnitudex12 =min(34,6)=6ismadeinthecell(1,2)Crossoffthesecondcolumnfromthe table.Continuinginthisway,thesubsequentreducedtransportationtablesandthedifferences forthesurvivingrowsandcolumnsareshowninfig(iii)

SikkimManipalUniversity

85

OperationsResearch

Unit5

5 15 3

28 (0) 15 (1)
5 3 12 6 6 (1) 4 17 (1) 3 12(1) 17 (0) 3 28(0) 6 5 6 17 3 17 5 3 5

12(1)
4 3

21 (2)

17 (1)

17 (0)

Fig(iii) Eventually,thebasicfeasiblesolutionisobtainedasshownintable(iv)below:
6 5 15 3 3 5 12 6 18 4 1 4 2 4 4 3 4 6 1 17 3 5 3

Table(iv) Thetransportationcostaccordingtotheaboverouteisgivenby: Z=6x5+6x1+17x3+5x3+15x3+12x3+19x(1)=164. SelfAssessmentQuestions3 StateTrueorFalse

1. InMatrixminimamethodwestartallocatingfromlefttopcellofthetable. 2. Invogelsapproximationmethodwefirstconstructpenaltyandthenstartallocating. 3. NorthwestcornerRulegivesoptimumsolution. 4. Vogelapproximationmethodgivessolutionneartotheoptimumsolution

5.5MovingTowardsOptimality AfterevaluatinganinitialbasicfeasiblesolutiontoaTransportationproblem,thenextquestionis howtogettheoptimumsolution.Thebasictechniquesare:

SikkimManipalUniversity

86

OperationsResearch

Unit5

1. Determiningthenetevaluationsforthenon basicvariables(emptycells) 2. Determiningtheenteringvariable 3. Determiningtheleavingvariable 4. Computingabetterbasicfeasiblesolution 5. Repeatingsteps(1)to(4)untilanoptimumsolutionhasbeenobtained.

5.5.1 Improvingthesolution Definition: Aloopisthesequenceofcellsinthetransportationtablesuchthat: i) ii) iii) iv) Eachpairofconsecutivecellslieeitherinthesameroworsamecolumn Nothreeconsecutivecellsliesinthesameroworsamecolumn Thefirstandthelastcellsofthesequenceliesinthesameroworcolumn Nocellappearsmorethanonceinthesequence

Considerthenonbasicvariablecorrespondingtothemostnegativeofthequantities. cij ui vj.Calculatedinthetestforoptimalityitismadetheincomingvariable.Constructa loopconsistingexclusivelyofthisincomingvariable(cell)andcurrentbasicvariables(cells). Then allocate to the incoming cell as many units as possible such that, after appropriate adjustments have been made to the other cells in the loop, the supply and demand constraints are not violated, all allocations remain nonnegative and one of the old basic variableshasbeenreducedtozero.(whereuponitceasestobebasic)

ModifiedDistributionMethod/ModiMethod/UVMethod.
Step1:Underthismethodweconstructpenaltiesforrowsandcolumnsbysubtractingtheleast valueofrow/columnfromthenextleastvalue. Step 2: We select the highest penalty constructed for both row and column. Enter that row / columnandselecttheminimumcostandallocatemin(ai,bj) Step3:Deletetheroworcolumnorbothiftherimavailability/requirementsismet. Step4:Werepeatsteps1to2totillallallocationsareover. Step5:Forallocationallformequationui +v j =cj setoneofthedualvariableui /vj tozeroand solveforothers. Step6:Usethesevaluetofind Dij =cij ui v j ofall Dij ,thenitistheoptimalsolution.

SikkimManipalUniversity

87

OperationsResearch

Unit5

Step7:Ifany Dij 0,selectthemostnegativecellandformloop.Startingpointoftheloopis+ve andalternativelytheothercornersoftheloopareveand+ve.Examinethequantitiesallocated atveplaces.Selecttheminimum.Additat+veplacesandsubtractfromveplace. Step8:Formnewtableandrepeatsteps5to7till Dij 0

BalancedT.P Example4: Solvethefollowingtransportationproblem withcostcoefficientsdemandsandsuppliesasgiven inthefollowingtable: Destinations A SourcesI II III Demand 6 4 1 6 B 8 9 2 10 C 4 8 6 15 Supply 14 12 5

Sincetotaldemand=31=Totalsupply,theproblemisbalanced. TheinitialbasicfeasiblesolutionisobtainedbyVogelsapproximationmethod.Thefollowing tablegiventheinitialsolution: Supply 6 4 6 1 5 Demand 6 10 15 Destination 5 2 8 14 9 1 6 5 8 12 4 14

SikkimManipalUniversity

88

OperationsResearch

Unit5

D1 Sources 1 2 6 3 6

D2 8

D3 4 14 8 1 2 6

Supply
14 12

4 5 1 5 6 10

15

The optimum allocations are x13 = 14, x21 = 6, x22 = 5, x23 = 1, x32 = 5. The minimum transportationcostis144+64+59+18+52=143. Forallocatedcells. u1 +v 3 =4 u1 =4 PSetu2 =0 Pu1 +v 3 =4 Pu2 +v2 =9 Pu2 +v3 =8 u3 +v 2 =5 u1 =4 v 1 =4 v 2 =9 v 3 =8

Note: Selectthatvariableu i /vi isrepeatedvery oftenforeasycalculation.Hereu2 is repeatedoften

Forunallocatedcells Dij =cij ui vj D11 =6(4)4=6 D12 =8(4)9=3 D31 =1(4)4=1 D33 =6(4)8=2 Sinceall Dij 0theoptimumsolutionu X13 =14x4=56 X21 =6x4=24 X22 =5x9=45

SikkimManipalUniversity

89

OperationsResearch

Unit5

X23 =1x8=8 X32 =5x2=10 Totalcost=143 UnbalancedT.P Example5 A car company isfaced with an allocationproblem resulting from rental agreement that allow cars to be returned to locations other than those which they were originally rented. At the presenttimetherearetwocarswith15and13simplexcarsrespectivelyand4locationsrequiring 9,6,7and9carsrespectively.Theunittransportationcosts(indollars)betweenthelocationsan givenbelow: Destinations D1 D2 D3 D4 Sources S1 S2 45 14 17 18 21 19 30 31

Obtainaminimumcostschedule. Solution: SincethesupplyandrequirementsarenotequalitiscalledanunbalancedT.P.ingeneralif Sai Sbj thenitiscalledanunbalancedT.P.weintroducedeitheradummyroworadummy column with cost zero an quantity Sbi Saj respectively. Applying VAM Method we find B.F.SasDestinations

D1 45 S1 Sources S2 14 9 0 S3 st 1 Cancel Demand P1 9/0 6

D2 17 3 18 4 0 6

D3 21 6 19 0 3 7/3

D4 30 31 0 9/6

P1 P2 P3 P4 44411 44112 0

15/9/6 13/4 3

14171930-

SikkimManipalUniversity

90

OperationsResearch

Unit5

P2 P3 P4

31

121 121 = = = = = 21 0 126 102 76 180

X34 =Min[3,9]=3x10 X21 =Min[13,9]=9x14 X12 =Min[15,6]=6x17 X23 =Min[4,7]=4x9 X14 =Min[6,6]=6x30

TotalCost547 Testingforoptimality Pu1 +v 2 =17 Pu1 +v 3 =21 Pu1 +v4 =30 Pu2 +v1 =14 Pu2 +v 3 =19 Pu3 +v 4 =0 PSetu1 =0 u1 =2 u3 =30 v 1 =16 v 2 =17 v 3 =21 v 4 =30 Forunallocatedcells Dij =cij ui vj D11 =45016=29 D22 =8+217=3 D24 =31+230=3 D31 =0+3026=4 D32 =0+3017=13 D33 =0+3021=9 For nonallocated cells determine cij uI v i. Since all then quantities are nonnegative, the current solution is optimal. The minimum transportation cost is =

617+321+630+914+419+3.0=470.

SikkimManipalUniversity

91

OperationsResearch

Unit5

Whichachievedbytransportingx12=6carsfromsources1todentition2,x13=3,x14=6cars fromsources1todestinations3and4respectivelyx21=9andx33=4carsfromsources2to destinations1and3respectively. 5.5.3 DegeneracyInTransportationProblem Itwasshownthatabasicsolutiontoanmorigin,ndestinationTransportationproblemcanhave at most m+n1 positive basic variables (nonzero) and so that otherwise the basic solution degenerates. It follows that whenever the number of basic cells is less than m+n1, the transportationproblemisadegenerateone.Thedegeneracycandevelopintwoways: Case 1: The degeneracy develops while determining an initialassignment via any one of the initialassignmentmethodsdiscussedearlier. Toresolvedegeneracy,weaugmentthepositivevariablesbyasmanyzerovaluedvariablesas isnecessarytocompletetherequiredm+n1basicvariables.Thesezerovaluedvariablesare selectedinsuchamannerthattheresultingm+n1variablesconstituteabasicsolution.The selectedzerovaluedvariablesaredesignatedbyallocatinganextremelysmallpositivevalueto each one ofthem. The cells containing these extremely smallallocations are then treatedlike anyotherbasiccells.Thesarekeptinthetransportationtableuntiltemporarydegeneracyis removedoruntiltheoptimumsolutionisattained,whicheveroccursfirst. Atthatpoint,weseteach=0. Case2: Thedegeneracydevelopsatsomeiterationstage.Thishappenswhentheselectionof the entering variable results in the simultaneous drive to zero of two or more current (pre iteration)basicvariables. Toresolvedegeneracy,thepositivevariablesareaugmentedbyasmanyzerovaluedvariables as is necessary to complete m+n1 basic variables. These zerovalued variables are selected fromamongthosecurrentbasicvariableswhicharesimultaneouslydriventozero.Therestof theprocedureisexactlythesameasdiscussedincase1above. Note: Theextremelysmallvalueisinfinitesimallysmallanditneveraffectsthevalueitisadded toorsubtractedfrom. Weintroduceinunallocatedminimumcostcellsuchthatwecannotformaloop Example: ObtainanoptimumbasicfeasiblesolutiontothefollowingdegenerateT.P.

SikkimManipalUniversity

92

OperationsResearch

Unit5

From

3 Available

3 4

4 1 Demand

6 5

5 10

Solution:FollowingtheNorthWestCornerrule,aninitialassignmentismadeasshownintable 1.Sincethebasiccellsdonotformaloop,thesolutionisbasic.However,sincethenumberof basiccellsis4whichislessthan5.(=m+n1)thebasicsolutiondegenerates.

2
7 3 4

2
2 3

1
1 3

5
4 6

Table1 (Initialassignment) In order to complete the basis and thereby remove degeneracy, we require only one more positivebasicvariable.Weselectthevariablex23 andallocateanegligiblysmallpositivequantity

inthecells(2,3)asshownintable2.

1
7 3 4

2
2 3 4

1
1

3+ =3 5 6

5
4

15+ =5 Table2

SikkimManipalUniversity

93

OperationsResearch

Unit5

(Augmentedsolution) Noticethatevenaftertheinclusionofcell(2,3)inthebasisthebasiccellsdonotformaloop.i.e. the augmented solution remains basic. The net evaluations can now be computed and the solutionistestedforoptimality Startingtable: Sinceallthenetevaluationsforthenonbasicvariablesarenotnonpositive,theinitialsolutionis notoptimum.Thenonbasiccell(1,3)mustenterthebasis.Theexitcriterion removesthebasiccell(2,3)fromthebasismax q = e .

uI q
2

ui

(3) 3
1

q
(4) 5 4
2

q 7
2 1

(3) 3 6

+q 4 0 (4) e

+q 2 (2) 3

e
1 (0) 4 5

q 3

1 (4) 4

3 q 6 2

q
(6) 3
5

Vi

Firstiteration:

1 Startingtable

Vj

7 6 Firstiteratedtable

Introducethecell(1,3)intothebasisanddropthecell(2,3)fromit.Determinethecurrentnet evaluations.Sinceallofthemarenotnonpositivethecurrentsolutioncanbeimproved. SecondIteration: Introduce the cell (3,1) and drop the cell (1,1) from the basis. Since some of the current net evaluationsarestillpositive,thecurrentsolutioncanfurtherbeimproved. Ui (6) 7
2

(3) 2 3
1

q 2

q
1 (2) 0 3

SikkimManipalUniversity

94

OperationsResearch

Unit5

+q 3

(2) 3 4 1

q 6 5

v j

(SecondIteratedTable) ui (6) 7 (2) 1 2 1 (0) 1 3 Vj 3 2 4 0 (Optimumtable) Thirditeration: Introducethecell(2,3)anddropthecell(2,1)fromthebasis.Sinceallthecurrentnetevaluations arenonpositive,thecurrentsolutionisanoptimumone Thetransportationcostaccordingtotheaboverouteisgivenby z = 2 4 + 1 1+ 2 3 + 4 3 + 1 6 =33 SelfAssessmentQuestions4 Fillintheblanks 6 (1) 2 3 4 4

2
3

1. Allthevaluesof DCij ui vj shouldbe__________ or_________forthesolutiontobe

optimum.

2. InunbalancedT.P ai is____________________to bj. 3. Ifthenumberofallocationislessthan_________thenitissaidtobeadegenerateT.P

5.6. Summary Thetransportationproblemisaspecialtypeoflinearprogrammingprobleminwhichtheobjective istotransportahomogeneousproductmanufacturedatseveralplants(origins)toanumberof different destinations at a minimum total cost. In this chapter, you learned several different techniques for computing an initial basic feasible solution to a transportation problem such as north west corner rule, matrix minimum method and vogel approximation method. Further we

SikkimManipalUniversity

95

OperationsResearch

Unit5

studiedthedegeneracyintransportationproblem withexamplesonobtaininganoptimumbasic feasiblesolution.

TerminalQuestions 1. Solvethefollowingtransportationproblem Destination A Source I II III Requirement 21 17 32 6 B 16 18 27 10 C 25 14 18 12 D 13 23 41 15 11 13 19 43 Availability

2. A company has three cement factories located in cities 1,2,3 which supply cement to four projects located in towns 1,2,3,4. Each plant can supply daily 6,1,10 truck loads of cement respectivelyand thedailycementrequirementsoftheprojectsarerespectively7,5,3,2truck loads. The transportation costper truckload ofcement ( in hundredsof rupees) from each planttoeachprojectsiteareasfollows. 1 1 Factories 2 3 2 1 5 2 3 0 8 3 11 6 15 4 7 1 9

Determinetheoptimaldistributionforthecompanysoastominimizethetotaltransportation cost.

SikkimManipalUniversity

96

OperationsResearch

Unit5

3. Solvethefollowingtransportationproblem To 9 7 6 6 4 12 3 5 8 4 9 7 9 11 6 6 7 11 2 2 9 5 3 2 4 10 5 11 10 2 5 6 2 9 22

Answer ToSelfAssessmentQuestions SelfAssessmentQuestions1

1. L.P.P 2. equal 3. minimumcost

SelfAssessmentQuestions2 a)Yesb)Yesc)No

SelfAssessmentQuestions3 a)False b)True c)False d)True

SelfAssessmentQuestions4

1. zero 2. Notequalto 3. m+n1

TerminalQuestions 1. TheoptimaltransportationcostisRs.796 2 OptimaltransportationcostisRs.10,000 3 TheminimumtransportationcostisRs.112as e 0

SikkimManipalUniversity

97