Skip to content
Question 38 of 38
Q.

Find the optimal solution for the assignment problem with following cost matrix.

Salesmen \ Area1234
P1117816
Q97126
R13161512
S14101211
Tamil Nadu DgeTamil Nadu HSC (DGE) Commerce Board 2026Subjective· 3mImportance★★★★★
100% · 38/38 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 →

Hungarian method: after row and column reduction the zeros allow the assignment P ⁣− ⁣3, Q ⁣− ⁣4, R ⁣− ⁣1, S ⁣− ⁣2P\!-\!3,\ Q\!-\!4,\ R\!-\!1,\ S\!-\!2; minimum cost =37=37.

Step 1 — Row reduction (subtract each row's minimum: 8,6,12,108,6,12,10):

1234
P3908
Q3160
R1430
S4021

Step 2 — Column reduction (column 1 minimum is 11; other columns already have a zero):

1234
P2908
Q2160
R0430
S3021

Step 3 — Assign zeros so that each row and column has exactly one.

  • P has its only zero in column 3 → P → Area 3.
  • S has its only zero in column 2 → S → Area 2. …

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.