21. Choose a wrong statement about Linear programming models:

1. Linear Objective functions need to be optimised.
2. A set of linear constraints.
3. An alternative optimal solution is not possible.
4. Variables that are all restricted to nonnegative values.

22. Which describes a solution to a transportation problem having fewer m+n1 cells than the number of allocated routes in a transportation table?

1. Optimal solution.
2. Initial feasible solution.
3. Minimum cost solution.
4. Degenerate solution.

23. An optimal assignment plan is obtained from an assignment matrix once the minimum number of straight lines needed to cover all the zeros equals to

1. the number of agents 1.
2. the number of agents.
3. the number of agents + 1.
4. the number of agents + number of tasks.

24. In decision-making process, identifying and defining a problem is

1. the final step in the decision-making process.
2. To propose of all viable alternatives.
3. considered multiple criteria.
4. the first step in the decision-making process.

25. The most accurate statement describing a decision tree is it

1. presents all decision alternatives first and follows them with all states of nature.
2. presents all states of nature first and follows them with all decision alternatives.
3. alternates the decision alternatives and states of nature.
4. arranges decision alternatives and states of nature in their natural chronological order.