Scribd
Upload
46 views13 pages

Network Optimization - Part 2

The document discusses linear programming formulations for solving the shortest path problem between two nodes in a network. It describes how the linear programming model works, including defining decision variables to represent flow on each link and constraints to enforce flow conservation at each node. An example problem is presented showing the linear programming model written out for finding the shortest path between two specific nodes in a sample network.

Uploaded by

Hanna Schumann
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
46 views13 pages

Network Optimization - Part 2

The document discusses linear programming formulations for solving the shortest path problem between two nodes in a network. It describes how the linear programming model works, including defining decision variables to represent flow on each link and constraints to enforce flow conservation at each node. An example problem is presented showing the linear programming model written out for finding the shortest path between two specific nodes in a sample network.

Uploaded by

Hanna Schumann
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 13

Linear Programming Formulation of the Shortest-Path Problem

• The model is general: it can be used to find the shortest route between any two nodes
in the network.

• We wish to determine the shortest route between any two nodes s and t in an n-node
network.

• The LP assumes that one unit of flow enters the network at node s and leaves at
node t.

Decision
Variables:

1
Linear Programming Formulation of the Shortest-Path Problem

• Objective function

• Constraints:
The conservation-of-flow equation at each node:

Total input flow = Total output flow

For a given node j:

2
Linear Programming Formulation of the Shortest-Path Problem

Example 2: Write the LP model for the shortest path problem in Example 1
with s=1 and t=2.

3
Linear Programming Formulation of the Shortest-Path Problem

LP model for Example 1:

X12 X13 X23 X34 X35 X42 X45 RHS


Min Z = 100 30 20 10 60 15 50
Node 1 1 1 = 1 s

Node 2 -1 1 -1 = -1 t

Node 3 -1 -1 1 1 = 0
Node 4 -1 1 1 = 0
Node 5 -1 -1 = 0

Note: Column xij has exactly one “1” in row i and one “-1” in row j

A typical property of a network LP.

4
Linear Programming Formulation of the Shortest-Path Problem

Solver application for Seervada Park Problem:

Notice that in the LP model, the constraints of the problem are of the general form:

Net output flow- Net input flow = 0

5
Linear Programming Formulation of the Shortest-Path Problem

6
The Minimum Spanning Tree Problem

Connected network:
• Every pair of nodes in the network has at least one path between
them.

Tree (spanning tree):


• Connected network with no cycles.

7
Minimum Spanning Tree Problem

• Illustrations of the spanning tree concept for the Seervada Park problem

8
Minimum Spanning Tree Problem

Given: nodes of a network, potential links, and positive length of


each link if it is inserted into the network.

• Design the network by inserting links.


• A path must exist between every pair of nodes.

Problem: minimize total length of links inserted into the


network.
• Network of n nodes requires only n−1 links.
• Choose the links to form a spanning tree.

9
Minimum Spanning Tree Problem

An algorithm for the Minimum Spanning Tree Problem

1. Select any node arbitrarily, and then connect it (add a link) to the nearest distinct
node.

2. Identify the unconnected node that is closest to a connected node, and then
connect these two nodes (add a link between them). Repeat this step until all
nodes are connected.

3. Tie breaking: Ties for the nearest distinct node (step 1) or the closest unconnected
node (step 2) may be broken arbitrarily, and the algorithm will still yield an
optimal solution.

• Such ties signal that there may be (but need not be) multiple optimal

solutions.

10
Minimum Spanning Tree Problem for Seervada Park

• A second problem for the Seervada Park is that telephone lines must be installed
under the roads to establish telephone communication among all the stations
(including the park entrance). Because the installation is both expensive and
disruptive to the natural environment, lines will be installed under just enough roads
to provide some connection between every pair of stations.

• Where the lines should be laid to accomplish this with a minimum total number
of miles of line installed.

11
Minimum Spanning Tree Problem for Seervada Park

• The solution is the minimal spanning tree for the Seervada Park road system

12
Minimum Spanning Tree Problem-Applications

Minimum Spanning Tree Problem is typically used in Network Design.


 objective is to design the most appropriate network for the given
application rather than analyzing an already designed network.

Some Applications:

• Design of telecommunication networks (fiber-optic networks,


computer networks, telephone networks, cable television networks,
etc.)

• Design of a lightly used transportation network to minimize the total


cost of providing the links (rail lines, roads, etc.)

• Design of a network of high-voltage electrical power transmission lines

• Design of a network of pipelines to connect a number of locations


13

You might also like