A minimum-cost flow problem is a special type of:A) linear programming problem.B) transportation problem.C) spanning tree problem.D) transshipment problem.E) maximum flow problem.

For a minimum-cost flow problem to have a feasible solution, which of the following mustbe true?A) There is the same number of supply nodes and demand nodes.B) There is only one supply node and one demand node.C) There is an equal amount of supply and demand.D) The supply and demand must be integers.E) The transshipment nodes must be able to absorb flow.

Which of the following is not an assumption of a minimum-cost flow problem?A) At least one of the nodes is a supply node.B) There is an equal number of supply and demand nodes.C) Flow through an arc is only allowed in the direction indicated by the arrowhead.D) The cost of the flow through each arc is proportional to the amount of that flow.E) The objective is either to minimize the total cost or to maximize the total profit.

Which of the following will have negative net flow in a minimum-cost flow problem?A) Supply nodesB) Transshipment nodesC) Demand nodesD) Arc capacitiesE) None of the choices is correct.

The Least Cost Method is another method used to obtain the initial feasible solution for the transportation problem. Here, the allocation begins with the cell which has the minimum cost. The lower cost cells are chosen over the higher-cost cells with the objective to have the least cost of transportation.a.Trueb.Falsec.Can't sayd.None of these

The Hungarian method of obtaining optimal solution is used in the case of:       Transportation problem       Simplex Problem       assignment problem       All the above