31. Allocation Models are

- Iconic models
- Analogue Models
- Symbolic Models
- None of the above

32. Allocation problems can be solved by

- Linear Programming Technique
- Non â€“ Linear Programming Technique
- Both A and B
- None of the above

33. An assumption that implies that finite numbers of choices are available to a decision â€“ maker and the decision variables do not assume negative values is known as

- Certainty
- Continuity
- Finite choices
- None of the above

34. An objective function is maximized when it is a..........function

- Passive
- Profit
- Cost
- None of the above

35. An optimal solution is the..........stage of a solution obtained by improving the initial solution

- Third
- First
- Second
- Final

36. An optimization model

- Mathematically provides the best decision
- Provides decision within its limited context
- Helps in evaluating various alternatives constantly
- All of the above

37. An optimum solution is considered the.............among feasible solutions.

- Worst
- Best
- Ineffective
- None of the above

38. Any column or raw of a simplex table is called a

- Vector
- Key column
- Key Raw
- None of the above

39. Any feasible solution to a transportation problem containing m origins and n destinations is said to be

- Independent
- Degenerate
- Non.degenerate
- Both A and B

40. Any feasible solution which optimizes (minimizes or maximizes) the objective function of the LPP is called its

- Optimal solution
- Non.basic variables
- Solution
- Basic feasible solution

MCQ Multiple Choice Questions and Answers on Operations Research

Operations Research Trivia Questions and Answers PDF

Operations Research Question and Answer

USA - United States of America Canada United Kingdom Australia New Zealand South America Brazil Portugal Netherland South Africa Ethiopia Zambia Singapore Malaysia India China UAE - Saudi Arabia Qatar Oman Kuwait Bahrain Dubai Israil England Scotland Norway Ireland Denmark France Spain Poland and many more....