Operations Research MCQs Quiz Multiple Choice Questions & Answers

1. Operations Research (OR), which is a very powerful tool for

1. Research
2. Decision – Making
3. Operations
4. None of the above

2. Who coined the term Operations Research?

1. J.F. McCloskey
2. F.N. Trefethen
3. P.F. Adams
4. Both A and B

3. An objective function which states the determinants of the quantity to be either maximized or minimized is called

1. Feasible function
2. Optimal function
3. Criterion function
4. None of the above

4. .........................is another method to solve a given LPP involving some artificial variable ?

1. Big M method
2. Method of penalties
3. Two.phase simplex method
4. None of the above

5. .........................which is a subclass of a linear programming problem (LPP)

1. Programming problem
2. Transportation problem
3. Computer problem
4. Both are incorrect

6. .................assumption means the prior knowledge of all the coefficients in the objective function, the coefficients of the constraints and the resource values.

1. Proportionality
2. Certainty
3. Finite choices
4. Continuity

7. ................are the representation of reality

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

8. ................models are obtained by enlarging or reducing the size of the item

1. Iconic Models
2. Analogue Models
3. Symbolic Models
4. None of the above

9. ...............are called mathematical models

1. Iconic Models
2. Analogue Models
3. Symbolic Models
4. None of the above

10. ...............models assumes that the values of the variables do not change with time during a particular period

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

11. ...............models involves the allocation of resources to activities in such a manner that some measure of effectiveness is optimized.

1. Sequencing
2. Allocation Models
3. Queuing Theory
4. Decision Theory

12. ..............are expressed is n the form of inequities or equations

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

13. .............may be defined as a method of determining an optimum programme inter dependent activities in view of available resources

1. Goal Programming
2. Linear Programming
3. Decision Making
4. None of the above

14. .............refers to the combination of one or more inputs to produce a particular output.

1. Solution
2. variable
3. Process
4. None of the above

15. ............is one of the fundamental combinatorial optimization problems.

1. Assignment problem
2. Transportation problem
3. Optimization Problem
4. None of the above

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

31. Allocation Models are

1. Iconic models
2. Analogue Models
3. Symbolic Models
4. None of the above

32. Allocation problems can be solved by

1. Linear Programming Technique
2. Non – Linear Programming Technique
3. Both A and B
4. 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

1. Certainty
2. Continuity
3. Finite choices
4. None of the above

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

1. Passive
2. Profit
3. Cost
4. None of the above

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

1. Third
2. First
3. Second
4. Final

36. An optimization model

1. Mathematically provides the best decision
2. Provides decision within its limited context
3. Helps in evaluating various alternatives constantly
4. All of the above

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

1. Worst
2. Best
3. Ineffective
4. None of the above

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

1. Vector
2. Key column
3. Key Raw
4. None of the above

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

1. Independent
2. Degenerate
3. Non.degenerate
4. Both A and B

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

1. Optimal solution
2. Non.basic variables
3. Solution
4. Basic feasible solution

41. Any set of non.negative allocations (Xij>0) which satisfies the raw and column sum (rim requirement )is called a

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

42. Any solution to a LPP which satisfies the non. negativity restrictions of the LPP is called its

1. Unbounded solution
2. Optimal solution
3. Feasible solution
4. Both A and B

43. As for maximization in assignment problem, the objective is to maximize the

1. Profit
2. optimization
3. cost
4. None of the above

44. Assignment problem helps to find a maximum weight identical in nature in a weighted

1. Tripartite graph
2. Bipartite graph
3. Partite graph
4. None of the above

45. Basic cells indicate positive values and non. basic cells have..........value for flow

1. Negative
2. Positive
3. One
4. zero

46. Before starting to solve the problem, it should be balanced. If not then make it balanced by..........column incase demand is less than supply or by adding.........................raw incase supply is less than the demand

1. O,D
2. m,n
3. Horizontal, Vertical
4. Unshipped supply, Shortage

47. Currently, LPP is used in solving a wide range of practical

1. Business problems
2. Agricultural problems
3. Manufacturing problems
4. None of the above

48. Decision variables are

1. Controllable
2. Uncontrollable
3. Parameters
4. None of the above

49. Dual of the dual is

1. Primal
2. Dual
3. Alternative
4. None of the above

50. Every LPP is associated with another LPP is called

1. Primal
2. Dual
3. Non.linear programming
4. None of the above