contestada

the following matrix shows relative costs for various job-machine combinations. assume there must be one-to-one matching between jobs and machines. which set of pairs constitutes the minimum-cost solution using the assignment method? machine a b c job 1 $ 6 0 0 2 0 3 4 3 0 1 2 multiple choice 1-a, 2-c, 3-b 1-a, 2-b, 3-c 1-b, 2-c, 3-a 1-b, 2-a, 3-c 1-c, 2-a, 3-b

Respuesta :

2-a, 3-b set of pairs constitutes the minimum-cost solution using the assignment method. Such assignment problems can also be resolved using the Hungarian Method.

Because it is simple to obtain an equivalent minimization problem by translating each matrix value to an opportunity loss. The conversion is assignment by subtraction of the highest element from all the elements of the provided matrix. Finding a matching of a specific size in a weighted bipartite graph where the sum of the edge weights is minimal is the goal of the assignment issue. The problem is known as a balanced assignment if the numbers of agents and tasks are equal. If not, it is referred to as an uneven assignment.

To learn more about minimization, click here.

https://brainly.com/question/13014022

#SPJ4