Scribd
Upload
50 views

08 Network Models

This document contains 5 network modeling assignments involving determining maximal flow or minimum distance in various networks represented by diagrams or tables. The assignments include: 1) Finding maximal flow from node 1 to 7 in a network diagram. 2) Modeling a film production and inventory problem as a transshipment problem. 3) Formulating an LP to find maximal flow from Node 1 to F in a railway network diagram. 4) Finding maximal flow of water from node 1 to 5 in a network represented by a table of pipe capacities. 5) Determining the minimum distance flowing from Node 1 through Node 7 and what that distance is in a network with distances between nodes given.

Uploaded by

John Carlo Amodia
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
50 views

08 Network Models

This document contains 5 network modeling assignments involving determining maximal flow or minimum distance in various networks represented by diagrams or tables. The assignments include: 1) Finding maximal flow from node 1 to 7 in a network diagram. 2) Modeling a film production and inventory problem as a transshipment problem. 3) Formulating an LP to find maximal flow from Node 1 to F in a railway network diagram. 4) Finding maximal flow of water from node 1 to 5 in a network represented by a table of pipe capacities. 5) Determining the minimum distance flowing from Node 1 through Node 7 and what that distance is in a network with distances between nodes given.

Uploaded by

John Carlo Amodia
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment (Network Models)

1. Find the maximal flow from node 1 to node 7 in the following network.

2. Kobak must schedule its production of camera film for the first four months of
the year. Film demand (in 1,000s of rolls) in January, February, March and April
is expected to be 300, 500, 650 and 400, respectively. Kobak's production
capacity is 500 thousand rolls of film per month. The film business is highly
competitive, so Kobak cannot afford to lose sales or keep its customers waiting.
Meeting month i 's demand with month i +1's production is unacceptable.

Film produced in month i can be used to meet demand in month i or can be


held in inventory to meet demand in month i +1 or month i +2 (but not later due
to the film's limited shelflife). There is no film in inventory at the start of January.

The film's production and delivery cost per thousand rolls will be $500 in
January and February. This cost will increase to $600 in March and April due
to a new labor contract. Any film put in inventory requires additional transport
costing $100 per thousand rolls. It costs $50 per thousand rolls to hold film in
inventory from one month to the next.

a. Modeling this problem as a transshipment problem, draw the network


representation.
b. Formulate and solve this problem as a linear program.

3. A network of railway lines connects the main lines entering and leaving a city.
Speed limits, track reconstruction, and train length restrictions lead to the flow
diagram below, where the numbers represent how many cars can pass per
hour. Formulate an LP to find the maximal flow in cars per hour from Node 1 to
Node F.
4. A water company is analyzing the flow of water through pipes in an office
building. The flow capacities are given in the table below. Flow is measured in
100 gallons/hour. What is the maximal flow of water from node 1 to node 5?

5. Given a network with the following distances:

From To
Node Node Distance
1 2 4
1 4 1
2 3 2
2 4 3
3 4 6
3 5 4
3 6 2
4 5 7
4 7 5
5 6 5
5 7 8
6 7 4

a. Determine which nodes should be connected to get the minimum


distance flowing from Node 1 through Node 7.
b. Determine the minimum distance.

You might also like