Examveda
Examveda

Assignment problem helps to find a maximum weight identical in nature in a weighted ____________.

A. Tripartite graph

B. Bipartite graph

C. Partite graph

D. None of the above

Answer: Option B

Solution(By Examveda Team)

Assignment problem helps to find a maximum weight identical in nature in a weighted Bipartite graph. The assignment problem is a well-known graph optimization problem defined on weighted-bipartite graphs. The objective of the standard assignment problem is to maximize the summation of the weights of the matched edges of the bipartite graph. In the standard assignment problem, any node in one partition can be matched with any node in the other partition without any restriction. In this paper, variations of the standard assignment problem are defined with matching constraints by introducing structures in the partitions of the bipartite graph, and by defining constraints on these structures.

This Question Belongs to Management >> Operations Research

Join The Discussion

Related Questions on Operations Research

The use of decision models.

A. Is possible when the variables value is known

B. Reduces the scope of judgement & intuition known with certainty in decision-making

C. Require the use of computer software

D. None of the above