An assignment problem can be solved by.

Answer: Option C

An assignment problem can be solved by Simplex method and Transportation method. The simplex method is a method for solving problems in linear programming. This method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible set (which is a polytope) in sequence so that at each new vertex the objective function improves or is unchanged. The Transportation Method of linear programming is applied to the problems related to the study of the efficient transportation routes i.e. how efficiently the product from different sources of production is transported to the different destinations, such as the total transportation cost is minimum.