“MCQ on Operation research”

1. Operation research approach is

A) Multi-disciplinary B) Artificial C) Intuitive D) All of the above

2. Operation research analysis does not

A) Predict future operation B) Build more than one model

C) Collect the relevant data D) Recommended decision and accept

3. Mathematical model of Linear Programming is important because

A) It helps in converting the verbal description and numerical data

into mathematical expression

B) decision makers prefer to work with formal models.

C) it captures the relevant relationship among decision factors.

D) it enables the use of algebraic techniques.

4. A constraint in an LP model restricts

A) value of the objective function B) value of the decision variable

C) Use of the available recourses D) all of the above

5. In graphical method of linear programming problem if the ios-cost line

coincide with a side of region of basic feasible solutions we get

A) Unique optimum solution B) unbounded optimum solution

C) no feasible solution D) Infinite number of optimum solutions

6. A feasible solution of LPP

A) Must satisfy all the constraints simultaneously

B) Need not satisfy all the constraints, only some of them

 C) Must be a corner point of the feasible region

D) all of the above

7. The objective function for a L.P model is 3𝑥1 + 2𝑥2, if 𝑥1 = 20 and 𝑥2 = 30,

what is the value of the objective function?

A) 0 B) 50 C) 60 D) 120

8. Maximization of objective function in LPP means

A) Value occurs at allowable set decision

B) highest value is chosen among allowable decision

C) none of the above

D) all of the above

9. Alternative solution exist in a linear programming problem when

A) one of the constraint is redundant

B) objective function is parallel to one of the constraints

C) two constraints are parallel

D) all of the above

10. The linear function of the variables which is to be maximize or minimize

is called

A) Constraints B) Objective function C) Decision variable D)

None of the above

11.A physical model is an example of

A) An iconic model B) An analogue model

C) A verbal model D) A mathematical model

12.A model is

B) An essence of reality B) An approximation C) An idealization D)

All of the above
 13. The first step in formulating a linear programming problem is

A) Identify any upper or lower bound on the decision variables

B) State the constraints as linear combinations of the decision variables

C) Understand the problem

D) Identify the decision variables

14. Constraints in an LP model represents

A) Limititations B) Requirements

C) balancing, limitations and requirements D) all of above

15. The best use of linear programming is to find optimal use of

A) money B) Manpower C) Machine D) All the above

16. Which of the following is assumption of an LP model

A) divisibility B) proportionality C) additivity

D) all of the above

17. Before formulating a formal LP model, it is better to

A) Express each constraints in words B) Express the objective function in

wordsC) verbally identify decision variables D) all of the above

18. Non-negative condition in an LP model implies

A) a positive coefficient of variables in objective function

B) a positive coefficient of variables in any constraint
C )non-negative value of resource
D) none of the above

19. For the constraint of a linear optimizing function z=x1+x2 given by

x1+x2≤1, 3x1+x2≥3 and x1, x2≥0
A) There are two feasible regions
B) There are infinite feasible regions
C) There is no feasible region
D) None of these
20. Which of the following is not a vertex of the positive region bounded by
the inequalities?
 2x+3y≤6, 5x+3y≤15 and x, y≥0
A) (0,2) B (0,0) C) (3,0) D None of the above
21. The intermediate solutions of constraints must be checked by substituting
them back into
A) Objective function B)
Constraint equations C) Not required D)
None of the above
22. A basic solution is called non-degenerate, if
A. All the basic variables are zero B. None of the basic variables is zero
C. At least one of the basic variables is zero D. None of these
23. If the number of available constraints is 3 and the number of parameters to
be optimized is 4, then
A. The objective function can be optimized
B. The constraints are short in number
C. The solution is problem oriented
D. None of these
24. The graph of x≤2 and y≥2 will be situated in the
A. First and second quadrant B. Second and third quadrant
C. First and third quadrant D. Third and fourth quadrant
25. The feasible solution of a L.P.P. belongs to
 A. First and second quadrant
B. First and third quadrant
C. Second quadrant
D. Only in the first quadrant
26. ) The true statement for the graph of inequations 3x+2y≤6 and 6x+4y≥20 , is
A. Both graphs are disjoint
B. Both do not contain origin
C. Both contain point (1, 1)
D. None of these
27. The value of objective function is maximum under linear constraints
A. At the center of feasible region B. At (0,0)
C. At any vertex of feasible region D. The vertex which is at maximum
distance from (0, 0)
28. The region represented by 2x+3y−5≤0 and 4x−3y+2≤0 , is
A. Not in first quadrant B. Unbounded in first quadrant
C. Bounded in first quadrant D. None of these
29. Objective function of a L.P.P. is
A. A constraint B. A function to be optimized
C. A relation between the variables D. None of these

30. The optimal value of the objective function is attained at the points
A. Given by intersection of inequations with axes only
B. Given by intersection of inequations with x-axis only
C. Given by corner points of the feasible region
D. None of these
31. If the constraints in a linear programming problem are changed
A. The problem is to be re-evaluated
B. Solution is not defined
C. The objective function has to be modified
D. The change in constraints is ignored.
39. Which of the terms is not used in a linear programming problem
A. Slack variables B. Objective function C. Concave region D. Feasible
solution
42. In. L.P.P----
A. objective function is linear
B. constraints are linear
C. Both objective function and constraints are linear
D. None of the above
43. Constraints means----
A. limitations are expressed in mathematical equalities ( or
inequalities)
B. Assumption
C. goal is to be achieved
D. None of the above.
44. In XY-plane, X and Y values are in first quadrant is always----
A. Both are positive B. Both are Negative
C. X is positive and Y is negative D. X is Negative and Y is positive
45. The region which satisfies all the constrains of the L.P.P. is called as----
A. phisible region B. Feasible region
C. convex region D. Concave region
46.In .L.P.P., while drawing the graph, on the X-axis Y values always-----
A. 0 B.1 C. 2 D. None of the above
47. In .L.P.P., while drawing the graph, on the Y-axis X values always-----
A. 0 B.1 C. 2 D. None of the above
48.The set of decision variable which satisfies all the constraints of the
LPP is called as-----
A. Solution B. Basic Solution C. Feasible solution D. None of the above
49. A solution which satisfies non-negative conditions also is called as-----
A. Solution B. Basic Solution C. Feasible solution D. None of the above
50. A solution which optimizes the objective function is called as ------
A. Solution B. Basic Solution C. Feasible solution D. Optimal solution

1. Operations research is the application of methods to arrive at the optimal

Solutions to the problems.
A. economical
B. scientific
C. a and b both
D. artistic

2. In operations research, the------------------------------are prepared for situations.

A. mathematical models
B. physical models diagrammatic
C. diagrammatic models

3. Operations management can be defined as the application of -----------------------------------

-------to a problem within a system to yield the optimal solution.
A. Suitable manpower
B. mathematical techniques, models, and tools
C. Financial operations

4. Operations research is based upon collected information, knowledge and advanced study
of various factors impacting a particular operation. This leads to more informed -----------

.
A. Management processes
B. Decision making
C. Procedures

5. OR can evaluate only the effects of .

A. Personnel factors.
B. Financial factors
C. Numeric and quantifiable factors.

True-False
6. By constructing models, the problems in libraries increase and cannot be solved.
A. True
B. False
7. Operations Research started just before World War II in Britain with the establishment of
teams of scientists to study the strategic and tactical problems involved in military
operations.
A. True
 B. False
8. OR can be applied only to those aspects of libraries where mathematical models can be
prepared.
A. True
B. False
9. The main limitation of operations research is that it often ignores the human element in
the production process.
A. True
B. False

10. Which of the following is not the phase of OR methodology?

A. Formulating a problem
B. Constructing a model
C. Establishing controls
D. Controlling the environment

11. The objective function and constraints are functions of two types of variables,
variables and variables.
A. Positive and negative
B. Controllable and uncontrollable
C. Strong and weak
D. None of the above

12. Operations research was known as an ability to win a war without really going in to
A. Battle field
B. Fighting
C. The opponent
D. Both A and B

13. Who defined OR as scientific method of providing execuitive departments with a

quantitative basis for decisions regarding the operations under their control?
A. Morse and Kimball (1946)
B. P.M.S. Blackett (1948)
C. E.L. Arnoff and M.J. Netzorg
D. None of the above

14. OR has a characteristics that it is done by a team of

A. Scientists
B. Mathematicians
C. Academics
D. All of the above
15. Hungarian Method is used to solve
A. A transportation problem
B. A travelling salesman problem
C. A LP problem
D. Both a & b

16. A solution can be extracted from a model either by

A. Conducting experiments on it
B. Mathematical analysis
C. Both A and B
D. Diversified Techniques

17. OR uses models to help the management to determine its

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

18. What have been constructed from OR problems an methods for solving the models that
are available in many cases?
A. Scientific Models
B. Algorithms
C. Mathematical Models
D. None of the above

19. Which technique is used in finding a solution for optimizing a given objective, such as
profit maximization or cost reduction under certain constraints?
A. Quailing Theory
B. Waiting Line
C. Both A and B
D. Linear Programming

20. What enables us to determine the earliest and latest times for each of the events and
activities and thereby helps in the identification of the critical path?
A. Programme Evaluation
B. Review Technique (PERT)
C. Both A and B
D. Deployment of resources

21. OR techniques help the directing authority in optimum allocation of various limited
resources like
A. Men and Machine
B. Money
 C. Material and Time
D. All of the above

22. The Operations research technique which helps in minimizing total waiting and service
costs is
A. Queuing Theory
B. Decision Theory
C. Both A and B
D. None of the above

UNIT II
LINEAR PROGRAMMING PROBLEMS

23. What is the objective function in linear programming problems?

A. A constraint for available resource
B. An objective for research and development of a company
C. A linear function in an optimization problem
D. A set of non-negativity conditions

24. Which statement characterizes standard form of a linear programming problem?

A. Constraints are given by inequalities of any type
B. Constraints are given by a set of linear equations
C. Constraints are given only by inequalities of >= type
D. Constraints are given only by inequalities of <= type

25. Feasible solution satisfies

A. Only constraints
B. only non-negative restriction
C. [a] and [b] both
D. [a],[b] and Optimum solution

26. In Degenerate solution value of objective function .

A. increases infinitely
B. basic variables are nonzero
C. decreases infinitely
D. One or more basic variables are zero

27. Minimize Z =
A. –maximize(Z)
B. -maximize(-Z)
C. maximize(-Z)
D. none of the above
28. In graphical method the restriction on number of constraint is .
A. 2
B. not more than 3
C. 3
D. none of the above

29. In graphical representation the bounded region is known as region.

A. Solution
B. basic solution
C. feasible solution
D. optimal

30. Graphical optimal value for Z can be obtained from

A. Corner points of feasible region
B. Both a and c
C. corner points of the solution region
D. none of the above

31. In LPP the condition to be satisfied is

A. Constraints have to be linear
B. Objective function has to be linear
C. none of the above
D. both a and b

State True or False:

32. Objective function in Linear Programming problems has always finite value at the
optimal solution-TRUE
33. A finite optimal solution can be not unique- FALSE
34. Feasible regions are classified into bounded, unbounded, empty and multiple: TRUE
35. Corner points of a feasible region are located at the intersections of the region and
coordinate axes: TRUE

36. Identify the type of the feasible region given by the set of inequalities
x - y <= 1
x - y >= 2
where both x and y are positive.
A. A triangle
B. A rectangle
C. An unbounded region
D. An empty region

37. Consider the given vectors: a(2,0), b(0,2), c(1,1), and d(0,3). Which of the following
vectors are linearly independent?
 A. a, b, and c are independent
B. a, b, and d are independent
C. a and c are independent
D. b and d are independent

38. Consider the linear equation

2 x1 + 3 x2 - 4 x3 + 5 x4 = 10
How many basic and non-basic variables are defined by this equation?
A. One variable is basic, three variables are non-basic
B. Two variables are basic, two variables are non-basic
C. Three variables are basic, one variable is non-basic
D. All four variables are basic

39. The objective function for a minimization problem is given by

z = 2 x1 - 5 x2 + 3 x3
The hyperplane for the objective function cuts a bounded feasible region
in the space (x1,x2,x3). Find the direction vector d, where a finite optimal
solution can be reached.
A. d(2,-5,3)
B. d(-2,5,-3)
C. d(2,5,3)
D. d(-2,-5,-3)

40. The feasible region of a linear programming problem has four extreme points: A(0,0),
B(1,1), C(0,1), and D(1,0). Identify an optimal solution for minimization problem with
the objective function z = 2 x - 2 y
A. A unique solution at C
B. A unique solutions at D
C. An alternative solution at a line segment between A and B
D. An unbounded solution

41. Degeneracy occurs when

A. Basic variables are positive but some of non-basic variables have negative values
B. The basic matrix is singular, it has no inverse
C. Some of basic variables have zero values
D. Some of non-basic variables have zero values

42. Linear programming is a

(a) Constrained optimization technique
(b) Technique for economic allocation of limited resources.
(c) Mathematical techniques
(d) All of the above

43. Constraints in an LP model represents

(a) Limitation
(b) Requirements
(c) Balancing limitations and requirements
(d) All of the above

44. The distinguished feature of an LP model is

(a) Relationship among all variable is linear
(b) It has single objective function and constraints
(c) Value of decision variables is non-negative
(d) All of the above

45. Alternative solution exist of an LP model when

(a) One of the constraints is redundant
(b) Objective function equation is parallel to one of the
(c) Two constrains are parallel
(d) All of the above

46. In the optimal simplex table,

Cj -Zj value indicates
(a) Unbounded solution
(b) Cycling
(c) Alternative solution
(d) None of these

47. For a maximization problem, objective function coefficient for an artificial variable is
(a) + M
(b) -M
(c) Zero
(d) None of these

48. If an optimal solution is degenerate, then

(a) There are alternative optimal solution
(b) The solution is infeasible
(c) The solution is use to the decision maker
(d) None of these

49. The degeneracy in the transportation problem indicates that

(a) Dummy allocation needs to be added
(b) The problem has no feasible solution
(c) The multiple optimal solution exists.
(d) (a) and (b) only

50. When the total supply is not equal to total demand in a transportation problem then it is
called
(a) Balanced
(b) Unbalanced
(e) Degenerate
(d) None of these

51. The solution to a transportation problem with m-rows and n-columns is feasible if number of
positive allocations are
(a) m + n
(b) m *n
(c) m+n-l
(d) m+n+l