0% found this document useful (0 votes)
40 views4 pages

Shortest Path Problem: Constraints

The document describes a shortest path problem to minimize the total cost of routes between nodes. It lists the costs of different paths between nodes and constraints for each node. The objective is to determine the values of decision variables X that represent flows along each path to minimize the total cost while satisfying the node constraints.

Uploaded by

Ed
Copyright
© © All Rights Reserved
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
Download as xls, pdf, or txt
0% found this document useful (0 votes)
40 views4 pages

Shortest Path Problem: Constraints

The document describes a shortest path problem to minimize the total cost of routes between nodes. It lists the costs of different paths between nodes and constraints for each node. The objective is to determine the values of decision variables X that represent flows along each path to minimize the total cost while satisfying the node constraints.

Uploaded by

Ed
Copyright
© © All Rights Reserved
Available Formats
Download as XLS, PDF, TXT or read online on Scribd
Download as xls, pdf, or txt
Download as xls, pdf, or txt
You are on page 1/ 4

Shortest Path Problem

X12 X13 X21 X23 X24 X25 X31 X32 X35 X42 X45
cars flowing
through path
100 200 100 50 200 100 200 50 40 200 150
Constraints:
Node 1 -1 -1 1 1
Node 2 1 -1 -1 -1 -1 1 1
Node 3 1 1 -1 -1 -1
Node 4 1 -1 -1
Node 5 1 1 1
Node 6

Decision variables
Objective function
Left-hand-side of constraints

LHS Left-hand-side
RHS Right-hand-side
X46 X52 X53 X54 X56 X64 X65

100 100 40 150 100 100 100 0 <-- Objective

0.0 = -1
1 0.0 = 0
1 0.0 = 0
-1 1 1 0.0 = 0
-1 -1 -1 -1 1 0.0 = 0
1 1 -1 -1 0.0 = 1
LHS Sign RHS
Shortest Path Problem

X12 X13 X21 X23 X24 X25 X31 X32 X35 X42 X45
cars flowing
through path 1.0 0.0 0.0 1.0 0.0 0.0 0.0 0.0 1.0 0.0 0.0
100 200 100 50 200 100 200 50 40 200 150
Constraints:
Node 1 -1 -1 1 1
Node 2 1 -1 -1 -1 -1 1 1
Node 3 1 1 -1 -1 -1
Node 4 1 -1 -1
Node 5 1 1 1
Node 6

Decision variables
Objective function
Left-hand-side of constraints

LHS Left-hand-side
RHS Right-hand-side
X46 X52 X53 X54 X56 X64 X65

0.0 0.0 0.0 0.0 1.0 0.0 0.0


100 100 40 150 100 100 100 290 <-- Objective

-1.0 = -1
1 0.0 = 0
1 0.0 = 0
-1 1 1 0.0 = 0
-1 -1 -1 -1 1 0.0 = 0
1 1 -1 -1 1.0 = 1
LHS Sign RHS

You might also like