Skip to content
Question 44 of 44
Q.
  1. Solve the equations x+2y+z=7x + 2y + z = 7, 2x−y+2z=42x - y + 2z = 4, x+y−2z=−1x + y - 2z = -1 by using Cramer's rule. OR
  2. Determine an initial basic feasible solution to the following transportation problem by using Vogel's Approximation Method (VAM).
Source \ DestinationD1D_1D2D_2D3D_3Supply
S1S_198525
S2S_268435
S3S_376940
Requirement302545
Puducherry TnboardTamil Nadu HSC (DGE) Commerce Board 2026Subjective· 5mImportance★★★★★
100% · 44/44 Questions
🔒 Locked · start free trial →

You're viewing a preview — the full solution, concept, methods & PYQ mapping are locked.

Start your 14-day free trial to unlock the full solution →

(a) Δ=15, Δx=15, Δy=30, Δz=30⇒x=1,y=2,z=2\Delta=15,\ \Delta_x=15,\ \Delta_y=30,\ \Delta_z=30\Rightarrow x=1,y=2,z=2. (b) VAM gives an IBFS with total cost 550\mathbf{550}.

Part (a) — Cramer's rule

x+2y+z=7,2x−y+2z=4,x+y−2z=−1.x+2y+z=7,\quad 2x-y+2z=4,\quad x+y-2z=-1.

Step 1 — Main determinant:

Δ=∣1212−1211−2∣=1(2−2)−2(−4−2)+1(2+1)=0+12+3=15.\Delta=\begin{vmatrix}1 & 2 & 1\\ 2 & -1 & 2\\ 1 & 1 & -2\end{vmatrix}=1(2-2)-2(-4-2)+1(2+1)=0+12+3=15.

Step 2 — Replace columns by the constants [7,4,−1][7,4,-1]:

Δx=∣7214−12−11−2∣=7(0)−2(−6)+1(3)=15,\Delta_x=\begin{vmatrix}7 & 2 & 1\\ 4 & -1 & 2\\ -1 & 1 & -2\end{vmatrix}=7(0)-2(-6)+1(3)=15,

Δy=∣1712421−1−2∣=1(−6)−7(−6)+1(−6)=30,\Delta_y=\begin{vmatrix}1 & 7 & 1\\ 2 & 4 & 2\\ 1 & -1 & -2\end{vmatrix}=1(-6)-7(-6)+1(-6)=30,

Δz=∣1272−1411−1∣=1(−3)−2(−6)+7(3)=30.\Delta_z=\begin{vmatrix}1 & 2 & 7\\ 2 & -1 & 4\\ 1 & 1 & -1\end{vmatrix}=1(-3)-2(-6)+7(3)=30.

Step 3 — Solve:

x=ΔxΔ=1515=1,y=3015=2,z=3015=2.x=\frac{\Delta_x}{\Delta}=\frac{15}{15}=1,\quad y=\frac{30}{15}=2,\quad z=\frac{30}{15}=2.

(Check: 1+2(2)+2=71+2(2)+2=7 ✓.)

Part (b) — Vogel's Approximation Method (VAM)

Supply =25+35+40=100==25+35+40=100= demand 30+25+4530+25+45 (balanced).

Iteration 1 — penalties (difference of two least costs): rows S1=3,S2=2,S3=1S_1{=}3,S_2{=}2,S_3{=}1; cols D1=1,D2=2,D3=1D_1{=}1,D_2{=}2,D_3{=}1. Largest =3=3 at S1S_1; least cost 55 in D3D_3 → allocate min⁡(25,45)=25\min(25,45)=25 to S1D3S_1D_3. S1S_1 exhausted; D3D_3 left =20=20.

Iteration 2 — remaining rows S2,S3S_2,S_3: column D3D_3 penalty =9−4=5=9-4=5 (largest); least cost 44 at S2D3S_2D_3 → allocate min⁡(35,20)=20\min(35,20)=20. D3D_3 exhausted; S2S_2 left =15=15.

…

Unlock everything free for 14 days

  • Full step-by-step solutions
  • Concept-first explanations
  • Methods, shortcuts & mistakes
  • PYQ mapping + timed mock tests

Full access for 14 days. No credit card required.