Questions Bank

1) A feasible solution to an LP problem-----.

A. must satisfy all the constraints. B. must be a corner point of the feasible region.

C. need not satisfy all the constraints. D. must optimize the objective function.

2) Which is true about the optimal solution of an LP problem?

A. Every LP problem has an optimal solution. B. Optimal solution always occurs at an extreme point.

C. All resources must be completely used. D. No multiple optimal solutions occur simultaneously.

3) ________ can be expressed in the form of inequalities or equations.

A. Constraints. B. Objective Functions.

C. Both A and B. D. None of the above.

4) An optimization model________

A. Mathematically provides the best decision. B. Provides decision within its limited context.

C. Helps in evaluating various alternatives. D. All of the above.

5) To obtain an initial solution of a transportation problem, _______

A. Vogel method must be used. B. Balance conditions should be satisfied.

C. Solution should not be degenerate. D. All of the above.

6) If there is no non-negative value in the ratio column, while solving with SIMPLEX, the solution is ___

A. Feasible. B. Bounded. C. Unbounded. D. Optimal.

7) In the SIMPLEX algorithm, the objective function row is always expressed in terms of the___variables.

A. Non-basic. B. Basic. C. Degenerate. D. Feasible.

8) Linear programming problems usually aim to maximize or minimize the ______________.

9) When using the SIMPLEX algorithm, the ______variable is the one with the most negative value in the
objective function raw.

A. Entering. B. Leaving. C. Basic. D. Non-basic.

10) In the SIMPLEX table, the minimum positive value at the ratio column determines the_____ variable.

A. Entering. B. Leaving. C. Basic. D. Non-basic.

11) If there is no negative value in the objective function row, while using SIMPLEX, the solution is ___

A. Feasible. B. Bounded. C. Unbounded. D. Optimal.

12) ___ variables are added to (<) inequality constraints in the SIMPLEX algorithm.

A. Artificial. B. Slack. C. Entering. D. Both A and B.

13) ___ variables are added to equality constraints in the SIMPLEX algorithm.

A. Artificial. B. Slack. C. Entering. D. Both A and B.

14) ___ variables are added to (>) inequality constraints in the SIMPLEX algorithm.

A. Artificial. B. Slack. C. Entering. D. Both A and B.

15) The SIMPLEX algorithm forces all _______ variables to become non basic, by the last iteration.

A. Artificial. B. Slack. C. Entering. D. Both A and B.

16) In a transportation problem with (m) sources and (n) destinations, the occupied cells number should
equal_____ before running optimality tests.

A. m + n. B. m - n. C. m + n - 1. D. m + n + 1.

17) _____ price is used to determine indicates the rate at which the objective function would change by
slightly changing a certain constraint.

A. Surplus. B. Shadow. C. Opportunity. D. Both A and B.

A. Surplus. B. Dual. C. Opportunity. D. Both A and B.

19) If the shadow price of a certain source equals zero, it is sometimes called_______ goods.

A. Free. B. Scarce. C. Opportunity. D. Both A and B.

20) To resolve degeneracy in transportation problems, a zero is allocated in the smallest value ________
cell.

A. Dependent. B. Occupied. C. Independent. D. Unoccupied.

21) Hungarian Method can be used to solve

A. A transportation problem B. An assignment problem.

C. An LP problem. D. Both a & b.

22) To check if the solution is optimal in transportation problem, ______________ method is used.

A. SIMPLEX. B. Modi. C. Stepping-stone. D. Big-M.

23) To get a more optimal solution in transportation problem, ______________ method is used.

A. SIMPLEX. B. Modi. C. Stepping-stone. D. Big-M.

24) Assignment model is a special case of a transportation problem in which all sources and all demands
are equal to ____.
A. 0. B. 1. C. 5. D. 10.
25) Assignment solving matrix should be_____.
A. inverse. B. linear. C. square. D. transpose.
26) The first step for solving assignment matrix is___.
A. balancing the matrix. B. row reduction. C. column reduction. D. optimality test.
27) An assignment is achieved, when the minimum number of lines covering all the matrix zeroes is >= the
number of _____.
A. rows. B. diagonals. C. cells. D. elements.
28) Unacceptable or impossible assignments can be removed by putting___ in their cost cell

A. 0. B. X. C. Big-M. D. empty.
 29) To convert an assignment maximization problem into minimization, --- all elements -- the highest one.

A. add/to. B. subtract/from. C. multiply/by. D. divide/by.

30) Using traditional transportation models to solve assignment problems may get too many --- values.

A. optimal. B. wrong. C. imaginary. D. degenerate.

31) The expected time to finish each activity, can be calculated from the relation ---------
O+ML+P O+2∗ML+P O+3∗ML+P O+4∗ML+P
A. . B. . C. . D. .
3 4 5 6

32) An activity’s slack = Late finish ------ Early finish.

A. (+). B. (-). C. (*). D. (/).

33) The variance for each activity can be calculated from the relation --------.

P-O 2 P-O P-O 2 P-O

34) In game theory, the players are assumed to be------.

A. rational. B. irrational. C. neutral. D. passive.

35) In game theory, the players actions are called------.

A. plans. B. plays. C. strategies. D. reasons.

36) If the value of the game equals zero, the game is-----.

A. biased. B. fair. C. unfair. D. unreal.

37) In game theory, the expected payoff is known as ‘------ of the game’.

A. Value. B. Price. C. Cost. D. Expenses.

38) In game theory, players strategies could be pure or ------.

A. mixed. B. contaminated. C. impure. D. popular.