I think it is point 3. Hope that helps
The assignment problem is some of the significant combinatorial
optimization difficulties in the division of operations research in mathematics.
It contains of looking for a supreme weight matching in a weighted bipartite
graph. The assignment problem constraint means that agent 3 can be assigned
to no more than two tasks.
Step-by-step explanation:
would you please attach the drawing?????
Answer:
The one on the bottom right
Step-by-step explanation:
In order for something to be a function it has to pass the Vertical Line Test. To do this you draw an imaginary vertical line down your graph. If the graph touches the line more than one it is not a function. This rules out all others except the bottom right graph.