Scribd Logo
Upload

Welcome to Scribd!

  • CH 6 Solver Min Cost Capacitated Network

    Uploaded by

    Oscar Cuestas
    16 views7 pages
    The document provides the results of an optimization model solved in Microsoft Excel that minimizes the total cost of flows between 5 nodes in a network given supply, demand, capacity, and unit cost constraints. It lists the optimal flows between nodes, total cost of 490, and intermediate calculations including node names, demands, unit costs and capacities. The model found the lowest cost solution for meeting all demands was to send various amounts of flow between different node pairs within their capacity limits.

    Original Description:

    ggc

    Original Title

    ch6SolverMinCostCapacitatedNetwork

    Copyright

    © © All Rights Reserved

    Available Formats

    XLS, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document provides the results of an optimization model solved in Microsoft Excel that minimizes the total cost of flows between 5 nodes in a network given supply, demand, capacity, and unit cost constraints. It lists the optimal flows between nodes, total cost of 490, and intermediate calculations including node names, demands, unit costs and capacities. The model found the lowest cost solution for meeting all demands was to send various amounts of flow between different node pairs within their capacity limits.

    Copyright:

    © All Rights Reserved
    Download as XLS, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    16 views7 pages

    CH 6 Solver Min Cost Capacitated Network

    Uploaded by

    Oscar Cuestas
    The document provides the results of an optimization model solved in Microsoft Excel that minimizes the total cost of flows between 5 nodes in a network given supply, demand, capacity, and unit cost constraints. It lists the optimal flows between nodes, total cost of 490, and intermediate calculations including node names, demands, unit costs and capacities. The model found the lowest cost solution for meeting all demands was to send various amounts of flow between different node pairs within their capacity limits.

    Copyright:

    © All Rights Reserved
    Download as XLS, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 7

    Microsoft Excel 9.

    0 Answer Report
    Worksheet: [genTrans.xls]Sheet1
    Report Created: 9/7/01 5:52:04 PM

    Target Cell (Min)


    Cell Name Original Value Final Value
    $F$20 S2 Flow 180 180

    Adjustable Cells
    Cell Name Original Value Final Value
    $B$20 S1 - D1 Flow 0 20
    $B$21 S1 - D2 Flow 0 0
    $B$22 S1 - D3 Flow 0 30
    $B$23 S1 - D4 Flow 50 0
    $B$24 S2 - D1 Flow 0 0
    $B$25 S2 - D2 Flow 19.9999999998 0
    $B$26 S2 - D3 Flow 0 150
    $B$27 S2 - D4 Flow 160.000000001 30
    $B$28 S3 - D1 Flow 100 80
    $B$29 S3 - D2 Flow 180.000000001 200
    $B$30 S3 - D3 Flow 0 0
    $B$31 S3 - D4 Flow 0 0
    $B$32 S4 - D1 Flow 0 0
    $B$33 S4 - D2 Flow 0 0
    $B$34 S4 - D3 Flow 180.000000007 0
    $B$35 S4 - D4 Flow 89.9999999932 270

    Constraints
    Cell Name Cell Value Formula Status Slack
    $F$19 S1 Flow 49.9999999984 $F$19=$G$19 Not Binding 0
    $F$20 S2 Flow 179.999999999 $F$20=$G$20 Not Binding 0
    $F$21 S3 Flow 280 $F$21=$G$21 Not Binding 0
    $F$22 S4 Flow 270 $F$22=$G$22 Not Binding 0
    $F$23 D1 Flow -99.9999999993 $F$23=$G$23 Not Binding 0
    $F$24 D2 Flow -200 $F$24=$G$24 Not Binding 0
    $F$25 D3 Flow -180 $F$25=$G$25 Not Binding 0
    $F$26 D4 Flow -300 $F$26=$G$26 Not Binding 0
    General Capacitated Network Model with Solver
    Input data:
    No. of nodes 5 <<maximum 10
    Unit Cost Matrix
    N1 N2 N3 N4 N5
    N1 0 3 7 5 0
    N2 0 0 2 0 1
    N3 0 0 0 0 8
    N4 0 0 0 0 4
    N5 0 0 0 0 0

    Demand 0 0 0 30 60
    Optimum solution: Intermediate calculations:
    Total cost = 490 Name Node Flow Demand From To UnitCost
    From - To Flow Capacity N1 1 40 40 1 2 3
    N1 - N2 5 999999 N2 2 50 50 1 3 7
    N1 - N3 0 10 N3 3 0 0 1 4 5
    N1 - N4 35 35 N4 4 -30 -30 1 5 0
    N1 - N5 0 0 N5 5 -60 -60 2 1 0
    N2 - N1 0 0 2 3 2
    N2 - N3 25 60 2 4 0
    N2 - N4 0 0 2 5 1
    N2 - N5 30 30 3 1 0
    N3 - N1 0 0 3 2 0
    N3 - N2 0 0 3 4 0
    N3 - N4 0 0 3 5 8
    N3 - N5 25 999999 4 1 0
    N4 - N1 0 0 4 2 0
    N4 - N2 0 0 4 3 0
    N4 - N3 0 0 4 5 4
    N4 - N5 5 999999 5 1 0
    N5 - N1 0 0 5 2 0
    N5 - N2 0 0 5 3 0
    N5 - N3 0 0 5 4 0
    N5 - N4 0 0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    0
    Capacity Matrix (blank cell= infinity)
    Supply N1 N2 N3 N4 N5
    40 N1 0 10 35 0
    50 N2 0 0 60 0 30
    0 N3 0 0 0 0
    0 N4 0 0 0 0
    0 N5 0 0 0 0 0

    You might also like