Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    Shortest Path and Transportation Problems

    Uploaded by

    Rajwinder Singh
    The document contains two shortest path problems and one transportation problem to solve. For the first shortest path problem, the shortest path from A to K is A->B->C->I->J->K with a length of 11. For the second shortest path problem, the shortest path from A to K is A->C->D->F->H->J->K with a length of 15. The optimal solution for the transportation problem is to ship 0 units from O1 to D1, 6 units from O1 to D2, 6 units from O1 to D3, and 1 unit from O2 to D3, with a total cost of 31.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Shortest Path and Transportation Problems

    Uploaded by

    Rajwinder Singh
    7 views2 pages
    The document contains two shortest path problems and one transportation problem to solve. For the first shortest path problem, the shortest path from A to K is A->B->C->I->J->K with a length of 11. For the second shortest path problem, the shortest path from A to K is A->C->D->F->H->J->K with a length of 15. The optimal solution for the transportation problem is to ship 0 units from O1 to D1, 6 units from O1 to D2, 6 units from O1 to D3, and 1 unit from O2 to D3, with a total cost of 31.

    Original Description:

    Algo

    Original Title

    SP&TRPRB

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document contains two shortest path problems and one transportation problem to solve. For the first shortest path problem, the shortest path from A to K is A->B->C->I->J->K with a length of 11. For the second shortest path problem, the shortest path from A to K is A->C->D->F->H->J->K with a length of 15. The optimal solution for the transportation problem is to ship 0 units from O1 to D1, 6 units from O1 to D2, 6 units from O1 to D3, and 1 unit from O2 to D3, with a total cost of 31.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as doc, pdf, or txt
    7 views2 pages

    Shortest Path and Transportation Problems

    Uploaded by

    Rajwinder Singh
    The document contains two shortest path problems and one transportation problem to solve. For the first shortest path problem, the shortest path from A to K is A->B->C->I->J->K with a length of 11. For the second shortest path problem, the shortest path from A to K is A->C->D->F->H->J->K with a length of 15. The optimal solution for the transportation problem is to ship 0 units from O1 to D1, 6 units from O1 to D2, 6 units from O1 to D3, and 1 unit from O2 to D3, with a total cost of 31.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as doc, pdf, or txt
    of 2

    BA 308B Dr.

    Campbell

    SHORTEST PATH AND TRANSPORTATION PROBLEMS For each network below find the shortest path from A to K and determine its length. 1. a !answer" length # $% 11 B 12 2 origin A 8 C 5 13 7 D 1 E 3 I 10 F 8 4 8 2
    '

    G 2 H 2 4 4 10 J 7 8 destination K

    1. b

    !answer" length # $& ' 8 2 13 D 7 3 F 10 15 H 12 6 5 I 2 6 J 13 8 4 destination K

    B 4 origin A 3 C 10 6

    BA 308B Dr. Campbell

    Find the optimal sol(tion for each transportation problem below. )ach cell shows the (nit cost for shipping from the origin to the destination. $. !answer" cost # 31*0 to D1 6 O1 6 from O2 5 O3 150 200 125 275 6 6 10 100 9 7 4 350 4 D2 3 D3 5 300 D4

    3.

    !answer" cost # &0 D1 O1 5 3 1 1 4 10 20 to D2 2 30 4 10 1 O3 20 2 20 D3

    from

    O2

    You might also like