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 & ________ _____ __________ ________ ____ _____ _______ _____ ___ _________.
__________ ____ _________ _______ __________ ___.
_______ ______ ____ _____ _______ _____ _________ ___ ____.
__________ ____ _________ ____ ___ __________.
_____ _____ ________ ___ __________ ______ _________ _________ _________ _______.
_______ ____ ______ __________ _________.
________ _________ ______ ____ _______ ___ ________.
_________ ___ _________ _______ _________ __________.
______ ________ _____ ___ _____ __________.
______ ________ _____ _________ ___ ________ ____.
_________ ______ _________ _____ ____ ___ _________ __________ __________ _______.
____ _____ __________ ___ ________ ____ ____ ________ _________.
________ ________ ______ ____ _____ _____ ____ ______ ________ _______.
_________ _______ _______ _______ ______ __________ _______ _____ __________ ___ ____ ________.
________ __________ ____ ________ ____ _____.
________ _______ ___ ____ _________ _____ _________ ______ ________ ______ _____.
__________ __________ ________ _______ ________ ________ _________.
_______ ___ __________ ____ ______ ___ ____.
_________ _____ ____ ____ ______.
_______ ______ _______ ________ __________ ________ __________ ________ ________ _____ _____ ____.
__________ _________ __________ _____ __________ ________.
___ _______ ___ _________ ________ ___ _________ _____.
_________ ____ ______ ______ _______.
_________ ______ _______ ____ _________ _______ _____ __________.
______ ______ ___ _____ ______.
____ _________ ______ _______ _____.
_____ ___ _________ _______ ______.
_____ __________ __________ _________ _______ _______ ___.
___ __________ ______ ________ ____ ___ ______ ___ _________ ___.
_________ ___ __________ ___ _______ _________ ______ __________ ___ _______ ______ ___.
__________ ______ _________ __________ ________ _________ ______ ___ ______ ________ _______ ________.
_______ ______ _____ ______ _______ _________ _________ _________ _____ __________ __________ ___.
_________ ____ ____ ___ _____ _______.
__________ ________ _________ _________ _______ _______.
_____ ________ ____ __________ _______.
_____ _______ __________ _________ _________ _______ ______ ____ _______ ________.
_________ ___ _______ _______ _________ _______ _______ ________.
_________ ___ _______ _________ ___ _________ ________ ______.
______ ____ _______ _________ ____ ______ _______ ___ ______ ________ ______.
________ ________ ____ ________ ________ __________ _________.
________ _____ __________ __________ _____ ______ __________.
_________ _______ ______ ______ ____ _______ ____ ______.
__________ __________ __________ ________ ______ ___ _______ __________.
_____ ______ __________ _________ _________ ________ _______ ________.
________ __________ ___ __________ _______.
________ _____ _________ ____ _______ _____.
______ __________ ___ ________ ____ ________ ________ ________ ____ __________.
________ _____ _____ ____ _________ _________ _________.
_________ _______ _________ ______ _____ ______ _______ _________ _______ ___ __________ _____.
__________ ______ __________.
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 & ________ _____ __________ ________ ____ _____ _______ _____ ___ _________.
__________ ____ _________ _______ __________ ___.
_______ ______ ____ _____ _______ _____ _________ ___ ____.
__________ ____ _________ ____ ___ __________.
_____ _____ ________ ___ __________ ______ _________ _________ _________ _______.
_______ ____ ______ __________ _________.
________ _________ ______ ____ _______ ___ ________.
_________ ___ _________ _______ _________ __________.
______ ________ _____ ___ _____ __________.
______ ________ _____ _________ ___ ________ ____.
_________ ______ _________ _____ ____ ___ _________ __________ __________ _______.
____ _____ __________ ___ ________ ____ ____ ________ _________.
________ ________ ______ ____ _____ _____ ____ ______ ________ _______.
_________ _______ _______ _______ ______ __________ _______ _____ __________ ___ ____ ________.
________ __________ ____ ________ ____ _____.
________ _______ ___ ____ _________ _____ _________ ______ ________ ______ _____.
__________ __________ ________ _______ ________ ________ _________.
_______ ___ __________ ____ ______ ___ ____.
_________ _____ ____ ____ ______.
_______ ______ _______ ________ __________ ________ __________ ________ ________ _____ _____ ____.
__________ _________ __________ _____ __________ ________.
___ _______ ___ _________ ________ ___ _________ _____.
_________ ____ ______ ______ _______.
_________ ______ _______ ____ _________ _______ _____ __________.
______ ______ ___ _____ ______.
____ _________ ______ _______ _____.
_____ ___ _________ _______ ______.
_____ __________ __________ _________ _______ _______ ___.
___ __________ ______ ________ ____ ___ ______ ___ _________ ___.
_________ ___ __________ ___ _______ _________ ______ __________ ___ _______ ______ ___.
__________ ______ _________ __________ ________ _________ ______ ___ ______ ________ _______ ________.
_______ ______ _____ ______ _______ _________ _________ _________ _____ __________ __________ ___.
_________ ____ ____ ___ _____ _______.
__________ ________ _________ _________ _______ _______.
_____ ________ ____ __________ _______.
_____ _______ __________ _________ _________ _______ ______ ____ _______ ________.
_________ ___ _______ _______ _________ _______ _______ ________.
_________ ___ _______ _________ ___ _________ ________ ______.
______ ____ _______ _________ ____ ______ _______ ___ ______ ________ ______.
________ ________ ____ ________ ________ __________ _________.
________ _____ __________ __________ _____ ______ __________.
_________ _______ ______ ______ ____ _______ ____ ______.
__________ __________ __________ ________ ______ ___ _______ __________.
_____ ______ __________ _________ _________ ________ _______ ________.
________ __________ ___ __________ _______.
________ _____ _________ ____ _______ _____.
______ __________ ___ ________ ____ ________ ________ ________ ____ __________.
________ _____ _____ ____ _________ _________ _________.
_________ _______ _________ ______ _____ ______ _______ _________ _______ ___ __________ _____.
__________ ______ __________.
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★★★