Optimal Assignment Problem: Solving with Hungarian Method
Explore the optimal assignment problem involving children, chores, machines, and duties. Learn how to solve it using the Hungarian Method with step-by-step guidance. Dive into cost elements, optimal solutions, and objective function values for improved understanding and application in assignment problem scenarios.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
Suppose that the situation discussed in the first example is extended to four children and four chores. Following table summarized the cost elements of the problem 0 2 0 3 3 0 1 2 5 3 7 3 2 2 3 0 P1=1 P2=7 P3=4 P4=5 q1=0 q2=0 q3=3 q4=0
Then x11, x23, x32, x44 =1 is optimal solution with optimal objective function value Z=21$. Clearly other variables will be equal to zero. Suppose that following table summarized the cost elements of the problem with four machines and four duties. Solve the problem by Hungarian Method.
