Scribd Logo
Upload

Welcome to Scribd!

  • 7 views

    Tranp Flow

    Uploaded by

    navya111
    This flowchart describes an algorithm for solving transportation problems. It involves determining an initial feasible solution, computing cell evaluations, identifying any cells with negative evaluations, and making adjustments to find an optimal solution while maintaining feasibility. If a cell evaluation is negative, the largest such value identifies a cell to enter the basis. The process repeats until all evaluations are positive, indicating an optimal solution.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Tranp Flow

    Uploaded by

    navya111
    7 views1 page
    This flowchart describes an algorithm for solving transportation problems. It involves determining an initial feasible solution, computing cell evaluations, identifying any cells with negative evaluations, and making adjustments to find an optimal solution while maintaining feasibility. If a cell evaluation is negative, the largest such value identifies a cell to enter the basis. The process repeats until all evaluations are positive, indicating an optimal solution.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This flowchart describes an algorithm for solving transportation problems. It involves determining an initial feasible solution, computing cell evaluations, identifying any cells with negative evaluations, and making adjustments to find an optimal solution while maintaining feasibility. If a cell evaluation is negative, the largest such value identifies a cell to enter the basis. The process repeats until all evaluations are positive, indicating an optimal solution.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    7 views1 page

    Tranp Flow

    Uploaded by

    navya111
    This flowchart describes an algorithm for solving transportation problems. It involves determining an initial feasible solution, computing cell evaluations, identifying any cells with negative evaluations, and making adjustments to find an optimal solution while maintaining feasibility. If a cell evaluation is negative, the largest such value identifies a cell to enter the basis. The process repeats until all evaluations are positive, indicating an optimal solution.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 1

    FLOWCHART.

    Construct a trans-
    Determine an initial
    basu: feastble sotu-
    portation table for
    ~
    lion to the problem
    the problem. by any method for
    initial solution.
    !.
    Select a maximum
    Compute cell-evalua-
    value ofe so thai tions:
    one of the basic
    H
    du= Cn>: (u-+ v)
    cells become empty
    I) I) 1 )
    maintaining feasi-
    !for empty (non-basic)
    bility of new solution
    cells
    J ,
    Is there any negative No ~
    The solution
    cell-evaluation?
    under test is
    optimal
    Identify a loop which
    + Yes
    starts and ends at this
    cell and connecting
    Select the largest
    some or all basic
    cells. Make e
    negative cell-evalua-
    adjustment in the ~
    tion for indicating
    cells at the corners
    the cell entering
    of this loop main-
    the solution (basis).
    taining feasibility

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy