Linear Programming Network Models

Instructors - . Krca and H. Sral

NETWORKFLOW PROBLEMS (MODELS)

- Transportation
- Transhipment
- Assignment
TRANSPORTATION PROBLEM
Building Brick company (BBC) has orders for 80 tons bricks at three
suburban locations next week as follows:
Northwood: 25 tons
Westwood: 45 tons
Eastwood: 10 tons
BBC has two plants, each can produce 50 tons/week

NW

P1
WW

EW

P2

Unit cost of shipment ($/ton):

Fall 2014 - Special LPs Chapter 4

Page 1

Linear Programming Network Models

Instructors - . Krca and H. Sral

From/to
P1
P2

NW
24
30

WW
30
40

EW
40
42

Let:
xij = amount of bricks shipped from plant i to customer j (i=1,2 ; j=1,2,3)

Model
Minimize Z= 24x11+30x12+40x13+30x21+40x22+42x23
S.t.
a) Supply:
P1:

x11+x12+x13 50

P2:

x21+x22+x23 50

b) Demand:
NW:

x11+x21 25

WW:

x12+x22 45

EW:

x13+x23 10

c) Nonnegativity: xij 0

Fall 2014 - Special LPs Chapter 4

Page 2

Linear Programming Network Models

Instructors - . Krca and H. Sral

Solution
From/to
P1
P2
Total

NW
5
20
25

WW
45
0
45

EW
0
10
10

Slack
0
20
20

Total
50
50

LP OPTIMUM FOUND AT STEP

4
OBJECTIVE FUNCTION VALUE
1)
2490.000
VARIABLE
VALUE
REDUCED COST
X11
5.000000
0.000000
X12
45.000000
0.000000
X13
0.000000
4.000000
X21
20.000000
0.000000
X22
0.000000
4.000000
X23
10.000000
0.000000
ROW
P1)
P2)
NW)
WW)
EW)

SLACK OR SURPLUS
0.000000
20.000000
0.000000
0.000000
0.000000

DUAL PRICES
6.000000
0.000000
-30.000000
-36.000000
-42.000000

NO. ITERATIONS=
4
RANGES IN WHICH THE BASIS IS UNCHANGED:
OBJ COEFFICIENT RANGES
VARIABLE
CURRENT
ALLOWABLE
ALLOWABLE
COEF
INCREASE
DECREASE
X11
24.000000
4.000000
4.000000
X12
30.000000
4.000000
36.000000
X13
40.000000
INFINITY
4.000000
X21
30.000000
4.000000
4.000000
X22
40.000000
INFINITY
4.000000
X23
42.000000
4.000000
42.000000
ROW
P1
P2
NW
WW
EW

CURRENT
RHS
50.000000
50.000000
25.000000
45.000000
10.000000

RIGHTHAND SIDE RANGES

ALLOWABLE
INCREASE
20.000000
INFINITY
20.000000
5.000000
20.000000

Fall 2014 - Special LPs Chapter 4

ALLOWABLE
DECREASE
5.000000
20.000000
20.000000
20.000000
10.000000

Page 3

Linear Programming Network Models

Instructors - . Krca and H. Sral

The Transportation Problem minimizes the total shipping cost of transporting

goods from m supply points to n destination points (demand points).
m: number of supply points (sources)
n: number of demand points
Si = number of units available at supply point i
Dj = number of units demanded at demand point j
cij = unit cost of shipment from supply point i to demand point j
xij = amount of shipment from spply point i to demand point j (i=1,2 ; j=1,2,3)

=
=1 =1

S.t.:

= 1, . . ,

=1

= 1, . . ,

=1

0 ,

Fall 2014 - Special LPs Chapter 4

Page 4

Linear Programming Network Models

Instructors - . Krca and H. Sral

For feasibility: Total supply Total demand

Balanced Transportation Problem: Total supply = Total demand
Special cases:
- Minimum shipping guaranties from i to j.
Xij Lij
- Maximum route capacity from i to j
Xij Uij

UNIMODULARITY PROPERTY
For the transportation problem if all RHS values (i.e. Si and Dj) are
INTEGERS, then all VARIABLES (xij) are INTEGERS for any
OPTIMAL solution.
Transportation Network (A Bipartite Network)
Supply

Demand
1

cij xij
Si

Fall 2014 - Special LPs Chapter 4

Dj

Page 5