Group Assignment #9

1. A company imports goods at two ports: Philadelphia and New Orleans. Shipments of one product are made to
customers in Atlanta, Dallas, Columbus, and Boston. For the next planning period, the supplies at each port,
customer demands, and shipping costs per case from each port to each customer are as follows:

Develop a network representation of the distribution system (transportation problem).

Balanced Transportation Problem

Atlanta 1,400

2
Philadelphia 6
5,000
6
Dallas 3,200
2

Columbus 2,000
2
1
5
3,000 New Orleans 7

Boston 1,400

Supplies Demands
2. Consider the following network representation of a transportation problem:

The supplies, demands, and transportation costs per unit are shown on the network.
a. Develop a linear programming model for this problem; be sure to define the variables in your model.

Balanced Transportation Problem

Destination
Mode Des Moines Kansas City St. Louis Supply
Jefferson City 14 9 7 30
Omaha 8 10 5 20
Demand 25 15 10 50/50

Decision Variables:
Let xij = amount shipped from supply node i to demand node j

Objective Function:
Min Z: 14x11 + 9x12 + 7x13 + 8x21 + 10x22 + 5x23

Constraints:
Supply Constraints:
x11 + x12 + x13 ≤ 30
x21 + x22 + x23 ≤ 20

Demand Constraints:
x11 + x21 = 25
x12 + x22 = 15
x13 + x23 = 10

Non-negativity Constraints:
xij ≥ 0, i = 1, 2 and j = 1, 2, 3

b. Solve the linear program to determine the optimal solution.

Using the Method, the following optimal solution was obtained,

Destination
Mode Des Moines Kansas City St. Louis Supply
 Jefferson City 5 15 10 30
Omaha 20 20
Demand 25 15 10 50/50

Total Cost:
Z = 14(5) + 9(15) + 7(10) + 8(20) = 435

3. Scott and Associates, Inc., is an accounting firm that has three clients. Project leaders will be assigned to the
three clients. Based on the different backgrounds and experiences of the leaders, the various leader-client
assignments differ in terms of projected completion times. The possible assignments and the estimated
completion times in days are as follows:

a. Develop a network representation of this problem.

b. Formulate the problem as a linear problem.

Decision Variables:

10
Jackson 1
16

32

14
Project 22 2 Client
Ellis
Leaders 40

24
22
Smith 34 3
Let xij = 1 if project leader i is assigned to client j

0 otherwise

Objective Function:
Min Z: 10x11 + 16x12 + 32x13 + 14x21 + 22x22 + 40x23 + 22x31 + 24x32 + 34x33

Constraints:
Agent Constraints:
x11 + x12 + x13 ≤ 1
x21 + x22 + x23 ≤ 1

x31 + x32 + x33 ≤ 1

Client Constraints:
x11 + x21 + x31 = 1
x12 + x22 + x32 = 1
x13 + x23 + x33 = 1

Non-negativity Constraints:
xij ≥ 0 or 1, for all i and j