Please use this identifier to cite or link to this item:
http://dspace.dtu.ac.in:8080/jspui/handle/repository/19373
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | ROHIT | - |
dc.contributor.author | HARSOLIA, MAHENDER | - |
dc.date.accessioned | 2022-07-28T10:21:24Z | - |
dc.date.available | 2022-07-28T10:21:24Z | - |
dc.date.issued | 2022-05 | - |
dc.identifier.uri | http://dspace.dtu.ac.in:8080/jspui/handle/repository/19373 | - |
dc.description.abstract | The constraint structure if the transportation iproblem iis iso iimportant ithat ithe iliterature iis ifilled iwith iefforts ito iprovide iefficient ialgorithms ifor isolving iit. iThe iintent iof ithis idissertation iis ito ipresent ian iefficient iapproach ifor ifinding ian iinitial ibasic ifeasible isolution iof ithe itransportation iproblem i(TP). iThe iproposed imethod iis iillustrated iwith iseveral inumerical iexamples. iAn ianalysis ito iidentify ithe ireason iof idifferent isolutions iby idifferent methods is also carried it. Finally a comparative study is made, and we observed that the imethod ipresented iherein igives ia ibetter iresult. | en_US |
dc.language.iso | en | en_US |
dc.relation.ispartofseries | TD-5938; | - |
dc.subject | RE-SOLUTION OF | en_US |
dc.subject | TRANSPORTATION PROBLEM | en_US |
dc.subject | LINEAR PROGRAMMING | en_US |
dc.title | ANALYSIS AND RE-SOLUTION OF THE TRANSPORTATION PROBLEM : A LINEAR PROGRAMMING APPROACH | en_US |
dc.type | Thesis | en_US |
Appears in Collections: | M Sc Applied Maths |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
ROHIT and mahender M.Sc..pdf | 1.6 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.