Scribd Logo
Upload

Welcome to Scribd!

  • 40 views

    Shortest Path LP Written Using General Min-Cost Flow Formulation, With Edge Capacities Being All 1

    Uploaded by

    Ralf Sander
    This document formulates the shortest path problem as a general minimum cost flow problem, with a network having nodes s, p, q, r, t and edges between them each having a capacity of 1. It shows the cost matrix cT, constraint matrix A, and initial values for the flow variable x and dual variable u.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as XLS, PDF, TXT or read online from Scribd

    Shortest Path LP Written Using General Min-Cost Flow Formulation, With Edge Capacities Being All 1

    Uploaded by

    Ralf Sander
    40 views3 pages
    This document formulates the shortest path problem as a general minimum cost flow problem, with a network having nodes s, p, q, r, t and edges between them each having a capacity of 1. It shows the cost matrix cT, constraint matrix A, and initial values for the flow variable x and dual variable u.

    Original Description:

    shortest path

    Original Title

    Shortest

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    XLS, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document formulates the shortest path problem as a general minimum cost flow problem, with a network having nodes s, p, q, r, t and edges between them each having a capacity of 1. It shows the cost matrix cT, constraint matrix A, and initial values for the flow variable x and dual variable u.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as XLS, PDF, TXT or read online from Scribd
    Download as xls, pdf, or txt
    40 views3 pages

    Shortest Path LP Written Using General Min-Cost Flow Formulation, With Edge Capacities Being All 1

    Uploaded by

    Ralf Sander
    This document formulates the shortest path problem as a general minimum cost flow problem, with a network having nodes s, p, q, r, t and edges between them each having a capacity of 1. It shows the cost matrix cT, constraint matrix A, and initial values for the flow variable x and dual variable u.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as XLS, PDF, TXT or read online from Scribd
    Download as xls, pdf, or txt
    You are on page 1of 3

    Shortest path LP written using general min-cost flow formulation, with edge capacities

    cT

    A
    s
    p
    q
    r
    t

    objective

    (s,p)
    4

    (p,s)
    2

    (s,q)
    3

    (q,s)
    4

    (p,t)
    6

    (s,p)
    1
    -1
    0
    0
    0

    (p,s)
    -1
    1
    0
    0
    0

    (s,q)
    1
    0
    -1
    0
    0

    (q,s)
    -1
    0
    1
    0
    0

    (p,t)
    0
    1
    0
    0
    -1

    n, with edge capacities being all 1.

    (q,r)
    2

    (r,t)
    1

    (q,r)
    0
    0
    1
    -1
    0

    (r,t)
    0
    0
    0
    1
    -1

    x
    (s,p)
    (p,s)
    (s,q)
    (q,s)
    (p,t)
    (q,r)
    (r,t)

    0
    0
    0
    0
    0
    0
    0

    u
    1
    1
    1
    1
    1
    1
    1

    Ax
    0
    0
    0
    0
    0

    NegD
    1
    0
    0
    0
    -1

    You might also like