(1) Find an optimal assignment of trucks to routes to minimize the total cost (using the Hungarian Method).BC6121510117169Truck / Route1234Step la: Row subtraction (show your steps, e.g., see cell 1A)Truck / RouteB1234A1011914Step 1b: Column subtraction.Truck / Route1234A10-6=4=====B=с=CStep 2: Testing for optimal solution (show your lines covering the zero entries).What is the minimum number of lines required to cover all zeros?D8141013D==D=

Answered: (1) Find an optimal assignment of…

Practical Management Science

6th Edition

ISBN:9781337406659

Author:WINSTON, Wayne L.

Publisher:WINSTON, Wayne L.

Chapter2: Introduction To Spreadsheet Modeling

Section: Chapter Questions

Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...

See similar textbooks

Related questions

Question

(1) Find an optimal assignment of trucks to routes to minimize the total cost (using the Hungarian Method).
B
C
6
12
15
10
11
7
16
9
Truck / Route
1
2
3
4
Step la: Row subtraction (show your steps, e.g., see cell 1A)
Truck / Route
B
1
2
3
4
A
10
11
9
14
Step 1b: Column subtraction.
Truck / Route
1
2
3
4
A
10-6=4
=
=
=
=
=
B
=
с
=
C
Step 2: Testing for optimal solution (show your lines covering the zero entries).
What is the minimum number of lines required to cover all zeros?
D
8
14
10
13
D
=
=
D
=

Expert Solution

Step 1

The Assignment Problem is a problem in the field of Operations Management which is defined as follows: "Given a set of jobs to be performed, determine the set of jobs that can be performed by one or more machines without violating any constraints."
The Hungarian method is a general technique for solving assignment problems. It was first proposed by the Hungarian mathematician George Dantzig in 1947.

In the problem of scheduling, it can be used to find the minimum cost sequence of jobs that must be assigned to machines so that no machine is idle at any time. The algorithm can also be used in other assignment problems.