Scribd Logo
Hochladen

Willkommen bei Scribd!

  • Objective Function Z X + X + X + X + X + X + X + X + X: Branch Node City Node City Distance Node Network Flow

    Hochgeladen von

    Jhayanti Nithyananda Kalyani
    7 Ansichten3 Seiten
    This document presents an objective function and constraints for a network flow optimization problem. The objective is to minimize the cost function Z, which is defined as the sum of costs associated with flows between six nodes on a network. There are five constraints that require the flows into and out of each node to sum to zero.

    Originalbeschreibung:

    sdfg

    Originaltitel

    Copy of Tugas2

    Copyright

    © © All Rights Reserved

    Verfügbare Formate

    XLSX, PDF, TXT oder online auf Scribd lesen

    Stufen Sie dieses Dokument als nützlich ein?

    Sind diese Inhalte unangemessen?

    Dieses Dokument melden
    This document presents an objective function and constraints for a network flow optimization problem. The objective is to minimize the cost function Z, which is defined as the sum of costs associated with flows between six nodes on a network. There are five constraints that require the flows into and out of each node to sum to zero.

    Copyright:

    © All Rights Reserved
    Als XLSX, PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    7 Ansichten3 Seiten

    Objective Function Z X + X + X + X + X + X + X + X + X: Branch Node City Node City Distance Node Network Flow

    Hochgeladen von

    Jhayanti Nithyananda Kalyani
    This document presents an objective function and constraints for a network flow optimization problem. The objective is to minimize the cost function Z, which is defined as the sum of costs associated with flows between six nodes on a network. There are five constraints that require the flows into and out of each node to sum to zero.

    Copyright:

    © All Rights Reserved
    Als XLSX, PDF, TXT herunterladen oder online auf Scribd lesen
    Markieren Sie unangemessene Inhalte
    von 3

    hlm.

    304 2 objective function


    2
    Z = 2X12 + 4X13 + 3X14 + 2X25 +1X23 + 2X34 + 2X36 + 3X46 + 2X56
    2

    1
    3
    2 4 2
    3

    Branch Node City Node City Distance Node Network Flow


    TOTAL
    objective function 1 Roanoke
    Z = 2X12 + 4X13 + 3X14 + 2X25 +1X23 + 2X34 + 2X36 + 3X46 + 2X56
    2 Staunton
    3 Charlottesville
    CONSTRAINT 4 Richmond
    X12 + X13 + X14 = 1 5 Winchester
    X12 - X23 - X25 = 0 6 Washington DC
    X13 + X23 -X34 -X36 = 0
    X14 + X34 - X46 = 0
    X25 -X56 = 0
    X36 + X46 + X56 = 1
    Charlottesville
    Winchester
    Washington DC

    Das könnte Ihnen auch gefallen