QUIZ

NETWORK MODELS

A Broadband Provider is connecting eight communities with its fiber optic lines. Using the minimal
spanning tree technique, look for the most efficient manner to interconnect all nodes. Note: Proper A
Broadband Provider is connecting eight communities with its fiber optic lines. Using the minimal spanning
tree technique, look for the most efficient manner to interconnect all nodes. Note: Proper solution must
reflect the right sequence for choosing answer.

4
5
2
5 5
4
10
2 7
3
1
4
3
5 6
5
6 8
4 6

Solution Steps: (Please observe proper sequence in listing solution steps.)

Start Node End Node Distance Cum. Distance
1

The town of Aklerville has just experienced an extended period of below-normal temperatures, and the
Akerville Oil Company’s reserve of home-heating fuel has been reduced to critical levels. The general
manager of the oil company has contacted his supplier in another state and has requested that emergency
measures be taken to pipe as much oil as possible into Akerville over the next few days. The oil supplier
has a network of pipelines from its supply tanks as follows:

900
2
1000 5
500
400 1000
800 3
1 6
1000 700
600
4

Upon checking with each of the towns 2, 3, 4, and 5, the oil supplier finds that its fuel reserves are
sufficient to allow the company to concentrate solely upon the Akerville problem over the next few days.
The company can flow oil in either direction on the various legs of the pipeline network. What flow rate in
what direction should each branch carry in order to maximize the flow to Akerville?
A company wants to determine the optimal replacement policy for its photocopier. The company does not
keep photocopiers longer than 4 years. The company has estimated the annual costs for photocopiers
during each of the 4 years and developed the following network representation of the problem.

Write out the LP formulation for this problem.

+0 +0
Yr 2 & 3: 50,000
2 4
Yr 1: 26,000

-1

1 Yr 2: 25,000 Yr 3: 28,000 Yr 4: 17,000

Yr 1 & 2: 50,000 Yr 3 & 4: 40,000 5

3

+0 +1

Min or Max X12 X13 X23 X24 X34 X35 X45 RHS
Objective:
Node 1
Node 2
Node 3
Node 4
Node 5

Xij ≥ 0
Consider a distribution network with the below-stated costs, capacities, and requirements. Solve for the
optimal distribution scheme to minimize costs using the Vogel Approximation Method (VAM) and the
Modified Distribution Method (MODI).

Oppor.
k1= k2= k3= Cost
Dealer 1 Dealer 2 Dealer 3 SUPPLY
37 43 46
r1 = Plant 1 650
40 39 36
r2= Plant 2 400
37 44 44
r3= Plant 3 450

DEMAND 400 500 600

Oppor.
Cost

Oppor.
k1= k2= k3= Cost
Dealer 1 Dealer 2 Dealer 3 SUPPLY
37 43 46
r1 = Plant 1 650
40 39 36
r2= Plant 2 400
37 44 44
r3= Plant 3 450

DEMAND 400 500 600

Oppor.
Cost

Oppor.
k1= k2= k3= Cost
Dealer 1 Dealer 2 Dealer 3 SUPPLY
37 43 46
r1 = Plant 1 650
40 39 36
r2= Plant 2 400
37 44 44
r3= Plant 3 450

DEMAND 400 500 600

Oppor.
Cost