Scribd
Upload
12 views6 pages

Maths 2 Chapter 3 Theory

The document outlines the steps for solving a transportation problem, starting with defining the objective function and setting up a transportation table. It details the process of finding an initial feasible solution, testing for optimality, and making allocations based on costs. The steps include constructing matrices, allocating maximum quantities, and ensuring supply and demand constraints are met.

Uploaded by

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

Maths 2 Chapter 3 Theory

The document outlines the steps for solving a transportation problem, starting with defining the objective function and setting up a transportation table. It details the process of finding an initial feasible solution, testing for optimality, and making allocations based on costs. The steps include constructing matrices, allocating maximum quantities, and ensuring supply and demand constraints are met.

Uploaded by

krishnajagave
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 6
Con Demand —» Demand = | Solution of a Transp ortahion Proble Step |: Detine the objective funckon te be mi Goes {o'Th ne. anghraints poSed on The problem Slep 2 * Set-up a +ransportahion table ith mb and columns. Sep Bt Find an initia Feaxible soluki 420 sfron_the dato —Skp 4 + “Test cshethes dhe inibval feasible Solubion CT! ae $a basi feasible soluhdn CG-F5) A Jenatble ne Soluhion 1 beste ih tte mo. of positive altecah Sum of _ocigins and is_one less than the = i an, The A = | eset i : —enocurpied colt Cwoler-sopeve) Ha —}Skep 5: “Test the Solution fee optimality. : clvaasute, Qr=0 pte ft Tp tt salicn_is ta imal, getonimpraued oe Ssanspoxdatio: ~ [step 1 Repeat the Skea 5 ae iil the solullen | becomes —aphimal i pit Constsuct an enely mxn matrix C where mt the origin and nis the d2dHinahion) ew ith Cit aly by Shep 9: Stoct eatth the North -Weat Lorene cell Le Cit) colt Altocate the much as possible in this cell. Nofe thab %ismin Cor,bid. Enclose the allocated gyranhdy x1 in a Cixcle sith CL, 1) cell and So on, till the fist -mur total is completely allocated oe : ‘ ity Boo 1¢ and Subseg in_dne remaining Cotls of dhe Second =o dill the Second -mo etal is at Sltp 5+ Continue Such allo cation in subsequent cows 51 72-9. ep 6 2 Eualuale 2 = JY V_Cij mij i=1_j+l Step 1: Conshvuct an amply ta. madi tatty en eiqie sky = . Slep a: Find the cell cith the lowest taSt among aij Stous and columns: Allocate Hg maxinoun Wee ee b the : leo Bt Next, allocate tHe maximum possible gyrontity in the next loweat Cost cell _. again Keeping in_moind the comme ponding “ou, Caluran totals. _ ~Takrhigg_ ine sun oe column —tsith the Aig ae moo was and columns. if He gp ceuns in tha “eon then | maximum difference 0 CCuonS— mark < + if dhe ma’ seam difference OCCURS. : RelG hee ta cemanke chances One hich the Smallest ¢ast and allocate the. maxitaum possible tn the Incest cast cell im that ‘fou 0% column ty . sty So aa to exchousst dhe Supply © Capacily avai lab lat a_particuler dedknalion Sdep B+ Reducs the no ewpply —© apaci ty awailabi i asthe Coltumn demand C ce qssinement ) ky the assigned dn the call: i abil Slen 4 : Th dhe enol. apacith availahbilihy ) Sabsty q og Slip Hh CS Skep ¢ ? Now, all thats altecabions Cor assig 4 that ue have made in the above tables can a _combined fnty a ingle chsan portab'on an al

You might also like