Question

In a 3 x 3 transportation problem, let *x*_{ij}
be the amount shipped from source *i* to destination
*j*, and let *c*_{ij} be the corresponding
transportation cost per unit. The amounts of supply at sources 1,
2, and 3 are 15, 30, and 85 units, respectively, and the demands at
destinations 1, 2, and 3 are 20, 30, and 80 units, respectively.
Assume that the starting northwest-corner solution is optimal and
that the assosciated values of the multipliers are given as
*u*_{1} = -2, *u2* = 3, *u3* = 5, *v*_{1} =
2, *v _{3}* = 5, and

Answer #1

1. The transportation problem done in class is to find how many
generators should be shipped from each manufacturing facility to
each distribution center so that shipping cost is minimized. To
remind you, the LP is Min Transportation costs: 3x11 + 2 x12 + 7
x13 + 6 x14 + 7x21 + 5 x22 + 2 x23 + 3 x24 + 2x31 + 5 x32 + 4 x33 +
5 x34 s.t. Need to make sure demand at destination is...

3. The following transportation table represents the shipping
profits from shipping a commodity from three sources to three
destinations.
City 1
City 2
City 3
Supply
Plant 1
600
700
400
25
Plant 2
320
300
350
40
Plant 3
500
480
450
30
Demand
30
35
25O
The solution below represents a feasible transportation plan for
this problem
City 1
City 2
City 3
Plant 1
0
0
25
Plant 2
30
10
0
Plant 3
0
25...

Answer Questions 2 and 3 based on the following LP
problem.
Let P1 = number of Product 1 to be
produced
P2 =
number of Product 2 to be produced
P3 =
number of Product 3 to be produced
Maximize 100P1 + 120P2 +
90P3 Total
profit
Subject to
8P1 + 12P2 + 10P3 ≤
7280 Production budget
constraint
4P1 + 3P2 + 2P3 ≤ 1920 Labor
hours constraint
P1
> 200 Minimum
quantity needed...

ADVERTISEMENT

Get Answers For Free

Most questions answered within 1 hours.

ADVERTISEMENT

asked 37 minutes ago

asked 41 minutes ago

asked 41 minutes ago

asked 49 minutes ago

asked 49 minutes ago

asked 50 minutes ago

asked 57 minutes ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago