Question

iv) The Assignment problem is solved by

a) Simplex method b) Hungarian method c) Vector method d) Graphical method​

Answer 1

Answer:

a) Simplex method

Step-by-step explanation:

An assignment problem can be solved by Simplex method and Transportation method. The simplex method is a method for solving problems in linear programming.

hope it will help you ☺️

Answer 2

Answer:

The right answer is Option A : Simplex method.

Step-by-step explanation:

• Both the Simplex method and the Transportation method can be used to solve an assignment problem.
• The linear programming problem can be solved using the simplex method.
• The feasible set, which is a polytope, is tested at each new vertex using this technique, which was developed by George Dantzig in $1947$.
• At each new vertex, the objective function either becomes better or stays the same.
• The Transportation Method of linear programming is used to solve issues pertaining to the analysis of effective transportation routes, i.e., how effectively the product from various production sources is delivered to various destinations, such that the overall transportation expense is kept to a minimum.