Linear Programming by Graphical Method
Simplex Method
Assignment Method
Transportation Method E. None of the above
Answer is Wrong!
Answer is Right!
The Hungarian method is a way of solving assignment problems in operations research. It is a network flow algorithm that can be used to find the optimal assignment of tasks to workers or resources. The Hungarian method is based on the idea of augmenting paths in a network. An augmenting path is a path in a network that starts and ends at different nodes, and all of the edges in the path have positive capacities. The Hungarian method can be used to find the maximum flow in a network, or to find the optimal assignment of tasks to workers or resources.
Linear programming is a mathematical method for solving problems that involve optimizing a linear function subject to
448 288 448s170.8 0 213.4-11.5c23.5-6.3 42-24.2 48.3-47.8 11.4-42.9 11.4-132.3 11.4-132.3s0-89.4-11.4-132.3zm-317.5 213.5V175.2l142.7 81.2-142.7 81.2z"/> Subscribe on YouTube