Question
Solve the following assignment problem for profit maximization:
| A | B | C | D | |
| I | 14 | 18 | 11 | 26 |
| III | 17 | 23 | 20 | 27 |
| III | 28 | 31 | 26 | 30 |
| IV | 23 | 3 | 25 | 28 |
Answer :
Word Count : 469
The assignment problem is typically solved using the Hungarian method (also known as the Kuhn-Munkres algorithm). This is a combinatorial optimization problem where the objective is to assign tasks to agents in such a way that the total profit (or cost) is maximized. Given the profit matrix: \[ \begin{array}{|c|c|c|c|c|} \hline & A & B & C & D \\ \hline I & 14 & 18 & 11 & 26 \\ III & 17 & 23 & 20 & 27 \\ III & 28 & 31 & 26 & 30 \\ IV & 23 ___ ____ ______ __________ _______ ________ ______.
___ _______ _______ _____ ___ ______ _______ _______ ______ _________ _____ ___.
___ ________ _______ _____ ________ _____ _________ _____ _____.
___ ___ ________ ____ ___ ___ _____ _______ ___ ________ _______.
____ _____ _____ __________ ________ _____ ______.
_____ ___ _________ _________ ______ _____ ___.
_________ __________ ______ _____ _________.
___ __________ ______ ____ _____ _________ __________ ______ ___ _________ ________.
_______ _______ _______ ____ ____ _________ __________ _________ ______.
_____ ____ _____ _____ _______ ____ __________ _________ _________.
______ __________ __________ _______ _________ __________ ______ _________ ____ _________.
______ ______ _______ ______ _______ ___ _____ _______ ______.
__________ ________ ________ ______ ______ __________ ____ ________ __________ ______ ________.
________ ________ ____ _____ ___ _____ ____ _______.
________ _________ _______ _______ _______ _______ _______ ___ ________.
_____ ____ _________ ___ ___ ____.
_____ _____ ____ _________ _____ ____ ___ ______ ________ ___ __________ ________.
___ __________ __________ ______ ____ _____.
_____ ____ _______ _____ _________ __________ _______ _________.
_________ _______ ___ ___ _________ ______ _____ ____ _____ __________ ________ __________.
_______ __________ ________ __________ __________ _________ ______ _________ _____ _______ _______ ________.
_________ _____ ______ ____ ______ ________ __________ __________.
__________ __________ ______ __________ ____ _______ _______.
________ _____ _________ ____ _________ _______ _____ __________ _____ _____.
________ ____ _______ _________ ____.
_____ __________ ______ _____ _________ _______ _______ ________ ____ _____.
___ _________ _____ _______ ______ __________ _________ _________ _____ ___.
__________ _____ _________ ___ ____ ____ ______.
______ __________ ______ ______ _______ _________.
________ _____ ____ ____ ___ __________ ________ ______ ______ _________.
___ ____ _____ ______ _________ ___ ___ _____ ______ _______ _________.
____ ________ _________ _______ ____.
___ _______ _________ ______ ______ __________ ______ _______ __________.
______ ________ ____ _________ ____ __________ __________ ____ _________.
___ _________ ____ _________ ________ _____ _________.
___ ____ __________ _____ _______ ___.
________ ________ _____ ______ ___ _________ ________ __________ ________ ____ _________.
__________ ______ ________ _________ _______ __________ ______ _________ __________ __________.
_____ _______ ____ ___ _______ _________ __________ ______ ________ __________.
______ _____ ___ _________ _____ ___.
________ _______ _______ ___ _______ ____ ___.
______ ________ ______ _____ __________ ____ __________ ______ ___ ____ ____.
_________ _____ __________ ____ ______ ___.
________ ________ ______ ____ _______.
Get Full Answer on WhatsApp
The assignment problem is typically solved using the Hungarian method (also known as the Kuhn-Munkres algorithm). This is a combinatorial optimization problem where the objective is to assign tasks to agents in such a way that the total profit (or cost) is maximized. Given the profit matrix: \[ \begin{array}{|c|c|c|c|c|} \hline & A & B & C & D \\ \hline I & 14 & 18 & 11 & 26 \\ III & 17 & 23 & 20 & 27 \\ III & 28 & 31 & 26 & 30 \\ IV & 23 ___ ____ ______ __________ _______ ________ ______.
___ _______ _______ _____ ___ ______ _______ _______ ______ _________ _____ ___.
___ ________ _______ _____ ________ _____ _________ _____ _____.
___ ___ ________ ____ ___ ___ _____ _______ ___ ________ _______.
____ _____ _____ __________ ________ _____ ______.
_____ ___ _________ _________ ______ _____ ___.
_________ __________ ______ _____ _________.
___ __________ ______ ____ _____ _________ __________ ______ ___ _________ ________.
_______ _______ _______ ____ ____ _________ __________ _________ ______.
_____ ____ _____ _____ _______ ____ __________ _________ _________.
______ __________ __________ _______ _________ __________ ______ _________ ____ _________.
______ ______ _______ ______ _______ ___ _____ _______ ______.
__________ ________ ________ ______ ______ __________ ____ ________ __________ ______ ________.
________ ________ ____ _____ ___ _____ ____ _______.
________ _________ _______ _______ _______ _______ _______ ___ ________.
_____ ____ _________ ___ ___ ____.
_____ _____ ____ _________ _____ ____ ___ ______ ________ ___ __________ ________.
___ __________ __________ ______ ____ _____.
_____ ____ _______ _____ _________ __________ _______ _________.
_________ _______ ___ ___ _________ ______ _____ ____ _____ __________ ________ __________.
_______ __________ ________ __________ __________ _________ ______ _________ _____ _______ _______ ________.
_________ _____ ______ ____ ______ ________ __________ __________.
__________ __________ ______ __________ ____ _______ _______.
________ _____ _________ ____ _________ _______ _____ __________ _____ _____.
________ ____ _______ _________ ____.
_____ __________ ______ _____ _________ _______ _______ ________ ____ _____.
___ _________ _____ _______ ______ __________ _________ _________ _____ ___.
__________ _____ _________ ___ ____ ____ ______.
______ __________ ______ ______ _______ _________.
________ _____ ____ ____ ___ __________ ________ ______ ______ _________.
___ ____ _____ ______ _________ ___ ___ _____ ______ _______ _________.
____ ________ _________ _______ ____.
___ _______ _________ ______ ______ __________ ______ _______ __________.
______ ________ ____ _________ ____ __________ __________ ____ _________.
___ _________ ____ _________ ________ _____ _________.
___ ____ __________ _____ _______ ___.
________ ________ _____ ______ ___ _________ ________ __________ ________ ____ _________.
__________ ______ ________ _________ _______ __________ ______ _________ __________ __________.
_____ _______ ____ ___ _______ _________ __________ ______ ________ __________.
______ _____ ___ _________ _____ ___.
________ _______ _______ ___ _______ ____ ___.
______ ________ ______ _____ __________ ____ __________ ______ ___ ____ ____.
_________ _____ __________ ____ ______ ___.
________ ________ ______ ____ _______.
Get Full Answer on WhatsApp
IGNOU NEWS
Assignment Submission Last Date Extended Till 30 June 2026 Click Here★★★IGNOU June 2026 TEE Date Sheet Released Click Here★★★