Question

Label each of the following statements as True or False

5) In the dual simplex method, if none of the constraint coefficients associated with the leaving variable equation are negative, the LP problem has no feasible solution.

6) In the transportation simplex method, the chain reaction method for determining the leaving variable is basically different from applying the feasibility condition by the
minimum ratio test in the simplex method.

7) A minimum spanning tree of a network may include loops.

8) A sufficient condition for a minimum cost flow problem to have any feasible solutions is that total supplies are equal to total demands

Answer 1

ANSWER:

5)

In the dual simplex method, if none of the constraint coefficients associated with the leaving variable equation are negative, the LP problem has no feasible solution. FALSE

$\small \rightarrow$ If all the constraint coefficients associated with the leaving variable are postive, then there is a feasible solution

6)

In the transportation simplex method, the chain reaction method for determining the leaving variable is basically different from applying the feasibility condition by the minimum ratio test in the simplex method. TRUE

7)

A minimum spanning tree of a network may include loops. FALSE

$\small \rightarrow$ A spanning tree is acyclic, i.e. it does not have any nodes which will loop back to itself.

8)

A sufficient condition for a minimum cost flow problem to have any feasible solution is that total supplies are equal to total demands. TRUE

$\small \rightarrow$ Although this assumption appears unrealistic in practice, it will simplify theoritical development for finding a feasible solution.

If you have any doubts please comment and please don't dislike.

PLEASE GIVE ME A LIKE. ITS VERY IMPORTANT FOR ME.