Operations Research Multiple Choice Questions and Answers for Practice

16. A basic solution which also satisfies the condition in which all basic variables are non.negative is called

1. Basic feasible solution
2. Feasible solution
3. Optimal solution
4. None of the above

17. A BFS of a LPP is said to be...............if at least one of the basic variable is zero

1. Degenerate
2. Non.degenerate
3. Infeasible
4. Unbounded

18. A feasible solution is called a basic feasible solution if the number of non.negative allocations is equal to

1. m.n+1
2. m.n.1
3. m+n.1
4. None of the above

19. A given TP is said to be unbalanced, if the total supply is not equal to the total

1. Optimization
2. Demand
3. Cost
4. None of the above

20. A minimization problem can be converted into a maximization problem by changing the sign of coefficients in the

1. Constraints
2. Objective Functions
3. Both A and B
4. None of the above

21. A non – degenerate basic feasible solution is the basic feasible solution which has exactly m positive Xi (i=1,2,…,m), i.e., none of the basic variable is

1. Infinity
2. One
3. Zero
4. X

22. A path formed by allowing horizontal and vertical lines and the entire corner cells of which are occupied is called a

1. Occupied path
2. Open path
3. Closed path
4. None of the above

23. A set of values X1, X2,…Xn which satisfies the constraints of the LPP is called

1. Solution
2. Variable
3. Linearity
4. None of the above

24. A solution may be extracted from a model either by

1. Conducting experiments on it
2. Mathematical analysis
3. Both A and B
4. Diversified Techniques

25. A...................models considers time as one of the important variable

1. Static Models
2. Dynamic Models
3. Both A and B
4. None of the above

26. A........has rows / column having non. basic cells for holding compensating (+) or (.) sign.

1. Cycle
2. Dead – end
3. Back track
4. None of the above

27. According to transportation problem number of basic cells will be exactly

1. m+n.0
2. n+m.1
3. m+n.1
4. None of the above

28. After determining every basic cell with in this cycle, adjustment is obtained as minimum value in basic cells . this is known as

1. Adjustment amount
2. aa
3. Both A and B
4. Alternatives

29. All the constraints are expressed as equations and the right hand side of each constraint and all variables are non.negative is called

1. Canonical variable
2. Canonical form
3. Canonical solution
4. Both A and B

30. All the parameters in the linear programming model are assumed to be

1. Variables
2. Constraints
3. Functions
4. None of the above