Part A: (I) I Transportation technique method Machines

Mugs 4000 A 2000 B 3000 C 3000 1.2 1.4 1.1 1.3 1.3 1.0

Products
Cups 2400 1.1 1.5 1.3 Bowls 1000

Machines
Mugs 4000 A 2000 B 3000 C 3000 600 1.2 1.4 1.1 1.3 1.3 1.0 Cups 2400

Products
Bowls 1000 1.1 1.5 1.3 0 0 0 Dummy 600

2400

Machines
Mugs 4000 A 2000 1000 B 3000 C 3000 600 1.2 1.4 1.1 1.3 1.3 1.0 Cups 2400

Products
Bowls 1000 1.1 1000 1.5 1.3 Dummy 600 0 0 0

2400

Machines
A 1000 0 B 3000 600 C 600 0 Mugs 4000 1.2 1000 1.4 2400 1.1 600 Cups 2400 1.3 1.3 1.0

Products
Bowls 1000 1.1 1000 1.5 1.3 Dummy 600 0 0 0 600

2400

Movement D (C) + R (Cups) D (A) + R (Bowls) D (C) + R (Mugs) D (A) + R (Mugs) D (B) + R (Mugs) D (B) + R (Dummy) Total

No. of Units 2400 1000 600 1000 2400 600 8000

Rate 1.0 1.1 1.1 1.2 1.4 0

Cost 2400 1100 660 1200 3360 0 8720

Actual Costs (in US$) D (C) + R (Cups) = 1.0 D (A) + R (Bowls) = 1.1 D (C) + R (Mugs) = 1.1 D (A) + R (Mugs) = 1.2 D (B) + R (Mugs) = 1.4 D (B) + R (Dummy) = 0
Shadow Costs (in US$) D (A) + R (Cups) = 0+1.1 = 1.1 D (B) + R (Cups) = 0.2+1.1 = 1.3 D (B) + R (Bowls) = 0.2+1.1 = 1.3 D (C) + R (Bowls) = -0.1 + 1.1 = 1.0 D (A) + R (Dummy) = 0 + (-0.2) = (-0.2) D (C) + R (Dummy) = (-0.1) + (-0.2) = (-0.3)

If D (A) = 0, then R (Mugs) = 1.2-0 = 1.2 R (Bowls) = 1.1 D(C) = -0.1 D (B) = 0.2 R (Cups) = 1.1 R (Dummy) = -0.2

Actual Costs D (A) + R (Cups) D (B) + R (Cups) D (B) + R (Bowls) D (C) + R (Bowls) D (A) + R (Dummy) D (C) + R (Dummy) 1.3 1.3 1.5 1.3 0.0 0.0

Shadow Costs 1.1 1.3 1.3 1.0 (-0.2) (-0.3)

Variance 0.2 0.0 1.2 0.3 0.2 0.3

Step 1: Identifying the least cost of each row.

Product Machine
A B C Mugs 1.20 1.40 1.10 Cups 1.30 1.30 1.00 Bowls 1.10 1.50 1.30

Step 2: Row reduction.

Product Machine
A B C Mugs 0.10 0.10 0.10 Cups 0.20 0 0 Bowls 0 0.20 0.30

Step 3: Column reduction.

Product Machine
A B C Mugs 0 0 0 Cups 0.20 0 0 Bowls 0 0.20 0.30

Step 4: Identifying the optimal allocation. Machine A B C Allocation Mugs*/Bowls Mugs/Cups Mugs/Cups

According to the above allocation there will be only 1 changeover which is likely to occur in machine A. In machine - A bowls production can be fulfilled according to the demand of 1000 units. Cups production also can be fulfilled completely in the machine B which is the requirement of 2400 units. Finally mugs can be fulfilled in machine C the total capacity of 3000 units that machine can produce and rest can be catered through machine A. It is only 1000 units.

Optimal Solution Products Machines Mugs 1.20 A 1000 1.40 B 3000 1.10 C 1.00 2400 1.30 1.30 Cups 1.30 Bowls 1.10 1000 1.50 600 0.00 3000 0.00 3000 Dummy 0.00 2000 Supply

Demand

4000

2400

1000

600

8000

Objective Function Z = 600X1 + 400X2 o X1 = Matara o X2 = Chilaw

Constraints 1500X1 + 1500X2 20000 3000X1 + 1000X2 40000 2000X1 + 5000X2 44000

Optimal Total Cost Solution = 600$*(12) + 400$*(4) = 7200$ + 1600$ = 8800$ Note: 1500X1 + 1500X2 20000 constraint is known as the Redundant Constraint.

Non- unique practical solution to a transportation problem that contains less than (m+n-1) non negative distributions in independent locations. In support of (mxn) transportation problem practical resolution is called degenerative if; I. II. Total number of allocations is unequal. When allocations arent at independent positions.

At this point, by independent position it means that it is always impractical to outline a closed loop by combining these allocations by a sequence of level and upright lines from one allocated cell to another.

Explain above abc answer below.

In the direction of resolving imbalanced transportation algorithm, it can be balanced by adding an untrue supply joint or an untrue demand joint to balance the problem before beginning the algorithm.

Beginning are normally listed beside the left side of the table with supply amounts listed beside the right side of the table, and Demands are usually listed next to the top of the table with demand amounts listed by the side of the bottom side of the table.

Each unit transportation costs are given in small boxes at the top of each cell in the rectangular matrix, where a zero unit cost is used for an unshipped units column and either a zero unit cost or a penalty unit cost is used for a shortage row.

To determine degeneracy a zero allocation is distributed to one of the unused squares.

Although there is a great deal of flexibility in choosing the unused square for the zero, the general procedure, when using the North-West Corner Rule, is to allot it to a square in such a way that it upholds an continuous sequence of squares.

Nevertheless, where the Vogel's method is used, the zero distribution is carried in a smallest cost amount independent cell. An independent cell in this situation strive that a cell which will not show the way to a closed-path on such distribution.