We read your photo as:

We want to calculate the optimum element of transportation from the transaction above.

Mathematics

ScanSolve AI Answer

Answer

12200\text{12200}

Step-by-step solution

6 steps

Based on the image provided, the transportation problem has the following details:

  • Costs (CijC_{ij}):
    • Row 1: 4, 1, 2, 6
    • Row 2: 8, 8, 3, 2
    • Row 3: 5, 9, 8, 7
  • Demand (DjD_j):
    • D1=1300D_1 = 1300
    • D2=1000D_2 = 1000
    • D3=1000D_3 = 1000
    • D4=900D_4 = 900
    • Total Demand = 1300+1000+1000+900=42001300 + 1000 + 1000 + 900 = 4200
  • Supply (SiS_i):
    • S1=1600S_1 = 1600
    • S2=1200S_2 = 1200
    • S3=1400S_3 = 1400
    • Total Supply = 1600+1200+1400=42001600 + 1200 + 1400 = 4200

Since Total Supply = Total Demand, the problem is balanced.

The transportation table is:

From/ToD1(1300)D2(1000)D3(1000)D4(900)Supply(Si)S141261600S288321200S359871400Demand(Dj)1300100010009004200\begin{array}{|c|c|c|c|c|c|} \hline \text{From/To} & D_1 (1300) & D_2 (1000) & D_3 (1000) & D_4 (900) & \text{Supply} (S_i) \\ \hline S_1 & 4 & 1 & 2 & 6 & 1600 \\ S_2 & 8 & 8 & 3 & 2 & 1200 \\ S_3 & 5 & 9 & 8 & 7 & 1400 \\ \hline \text{Demand} (D_j) & 1300 & 1000 & 1000 & 900 & 4200 \\ \hline \end{array}

We will now apply the Vogel's Approximation Method (VAM).

  1. Calculate initial penalties and make the first allocation.

    Calculate the difference between the two lowest costs for each row and column.

    • Row Penalties: S1:(2−1)=1S_1: (2-1)=1, S2:(3−2)=1S_2: (3-2)=1, S3:(7−5)=2S_3: (7-5)=2
    • Column Penalties: D1:(5−4)=1D_1: (5-4)=1, D2:(8−1)=7D_2: (8-1)=7, D3:(3−2)=1D_3: (3-2)=1, D4:(6−2)=4D_4: (6-2)=4

    The highest penalty is 7 (Column D2D_2). The minimum cost in D2D_2 is C12=1C_{12}=1.
    Allocate min⁡(S1,D2)=min⁡(1600,1000)=1000\min(S_1, D_2) = \min(1600, 1000) = 1000 units to cell (S1,D2)(S_1, D_2).
    Update: S1=1600−1000=600S_1 = 1600 - 1000 = 600, D2=1000−1000=0D_2 = 1000 - 1000 = 0. Column D2D_2 is satisfied.

  2. Recalculate penalties and make the second allocation.

    • Row Penalties: S1:(4−2)=2S_1: (4-2)=2, S2:(3−2)=1S_2: (3-2)=1, S3:(7−5)=2S_3: (7-5)=2
    • Column Penalties: D1:(5−4)=1D_1: (5-4)=1, D3:(3−2)=1D_3: (3-2)=1, D4:(6−2)=4D_4: (6-2)=4

    The highest penalty is 4 (Column D4D_4). The minimum cost in D4D_4 is C24=2C_{24}=2.
    Allocate min⁡(S2,D4)=min⁡(1200,900)=900\min(S_2, D_4) = \min(1200, 900) = 900 units to cell (S2,D4)(S_2, D_4).
    Update: S2=1200−900=300S_2 = 1200 - 900 = 300, D4=900−900=0D_4 = 900 - 900 = 0. Column D4D_4 is satisfied.

  3. Recalculate penalties and make the third allocation.

    • Row Penalties: S1:(4−2)=2S_1: (4-2)=2, S2:(8−3)=5S_2: (8-3)=5, S3:(8−5)=3S_3: (8-5)=3
    • Column Penalties: D1:(5−4)=1D_1: (5-4)=1, D3:(3−2)=1D_3: (3-2)=1

    The highest penalty is 5 (Row S2S_2). The minimum cost in S2S_2 is C23=3C_{23}=3.
    Allocate min⁡(S2,D3)=min⁡(300,1000)=300\min(S_2, D_3) = \min(300, 1000) = 300 units to cell (S2,D3)(S_2, D_3).
    Update: S2=300−300=0S_2 = 300 - 300 = 0, D3=1000−300=700D_3 = 1000 - 300 = 700. Row S2S_2 is satisfied.

  4. Recalculate penalties and make the fourth allocation.

    • Row Penalties: S1:(4−2)=2S_1: (4-2)=2, S3:(8−5)=3S_3: (8-5)=3
    • Column Penalties: D1:(5−4)=1D_1: (5-4)=1, D3:(8−2)=6D_3: (8-2)=6

    The highest penalty is 6 (Column D3D_3). The minimum cost in D3D_3 is C13=2C_{13}=2.
    Allocate min⁡(S1,D3)=min⁡(600,700)=600\min(S_1, D_3) = \min(600, 700) = 600 units to cell (S1,D3)(S_1, D_3).
    Update: S1=600−600=0S_1 = 600 - 600 = 0, D3=700−600=100D_3 = 700 - 600 = 100. Row S1S_1 is satisfied.

  5. Make the final allocations.

    Only row S3S_3 and columns D1D_1, D3D_3 remain.
    Allocate min⁡(S3,D1)=min⁡(1400,1300)=1300\min(S_3, D_1) = \min(1400, 1300) = 1300 units to cell (S3,D1)(S_3, D_1).
    Update: S3=1400−1300=100S_3 = 1400 - 1300 = 100, D1=1300−1300=0D_1 = 1300 - 1300 = 0.
    Allocate min⁡(S3,D3)=min⁡(100,100)=100\min(S_3, D_3) = \min(100, 100) = 100 units to cell (S3,D3)(S_3, D_3).
    Update: S3=100−100=0S_3 = 100 - 100 = 0, D3=100−100=0D_3 = 100 - 100 = 0.
    All supply and demand are met.

  6. Calculate the total transportation cost.

    The allocations are:

    • X12=1000X_{12} = 1000 units at cost C12=1C_{12}=1
    • X24=900X_{24} = 900 units at cost C24=2C_{24}=2
    • X23=300X_{23} = 300 units at cost C23=3C_{23}=3
    • X13=600X_{13} = 600 units at cost C13=2C_{13}=2
    • X31=1300X_{31} = 1300 units at cost C31=5C_{31}=5
    • X33=100X_{33} = 100 units at cost C33=8C_{33}=8

    Total Cost = (1000×1)+(900×2)+(300×3)+(600×2)+(1300×5)+(100×8)(1000 \times 1) + (900 \times 2) + (300 \times 3) + (600 \times 2) + (1300 \times 5) + (100 \times 8)
    Total Cost = 1000+1800+900+1200+6500+8001000 + 1800 + 900 + 1200 + 6500 + 800
    Total Cost = 12200

Was this helpful?

Try one yourself

A new problem that tests the same skill.

Still stuck on this one?

Ask a follow-up, and the answer starts from this question.

Got a different question?Ask your own question
Handwritten step-by-step solution preview

Handwritten Step-by-Step Solution

Get this as a handwritten image on WhatsApp — like a tutor wrote it for you.

Try on WhatsApp