0 11 9691 10:42 s Research in Logistics Fall 2017 orHW2FALL a Assignment 2, Due
ID: 368745 • Letter: 0
Question
0 11 9691 10:42 s Research in Logistics Fall 2017 orHW2FALL a Assignment 2, Due date: 11/27/2017 (Monday, November 27h) at 11:00AM. of Intc - - labus:Assignments must be submitted on lectures course website (there will be separate assignment item for each homework), ema ubmiss accepted. After 15 minutes of deadline 11:15 AM or later), the assignment will be marked as late and late assignments will get the half of its actual grade. Assignments that are turned in after the due date (say, one day after due date) will not be graded (student gets zero). Please note that lectures system records your submission date/time details Each homework must be individual work unless specifically stated and turned in as a group assignment. You are encouraged to talk to one another about your assignments, however, all assignments must be done by the student(s) whose name is (are) on it! You must not share your solution with other students Work on the following problems (total of 3) 1. Solve the following assignment problem using Hungarian Method and show the optimal solution 130 pts): 13 142313 32152 4337 To get full credit you must show all steps of the algorithm. 1/2 Operations Research in Logistics Fall 2017Explanation / Answer
This is the original cost matrix:
Subtract row minima
We subtract the row minimum from each row:
Subtract column minima
We subtract the column minimum from each column:
Cover all zeros with a minimum number of lines
There are 6 lines required to cover all zeros:
The optimal assignment
Because there are 6 lines required, the zeros cover an optimal assignment:
This corresponds to the following optimal assignment in the original cost matrix:
The optimal value equals 12.
8 12 8 11 2 14 1 1 10 6 9 14 13 14 2 3 13 6 13 2 5 15 2 5 1 1 7 10 3 1 4 3 3 7 6 9Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.