250+ Management Science Solved MCQs

101.

.................... defined Operations Research as “the art of winning wars without actually fighting.”

A. H M Wagner
B. H A Taha
C. T L Saaty
D. Arthur Clark
Answer» D. Arthur Clark
102.

Operations Research is a very powerful tool for ........................

A. Operations
B. Research
C. Decision making
D. None of these
Answer» C. Decision making
103.

Who defined Operations Research as scientific approach to problem solving for executive management.

A. E L Arnoff
B. H M Wagner
C. Churchman
D. None of these
Answer» B. H M Wagner
104.

The term “Operations Research” was coined in the year ...................

A. 1930
B. 1940
C. 1950
D. 1960
Answer» B. 1940
105.

The innovative science of Operations Research was discovered during ......................

A. Civil war
B. World war I
C. World war II
D. Industrial Revolution
Answer» C. World war II
106.

Operations Research has the characteristic that it is done by a team of .....................

A. Scientists
B. Mathematicians
C. Academicians
D. Politicians
Answer» A. Scientists
107.

Operations Research emphasises on the overall approach to the system. This characteristic of Operations Research is often referred to as .................................

A. System orientation
B. System approach
C. Inter-disciplinary
D. Team approach
Answer» D. Team approach
108.

Operations Research cannot give perfect .................. to the problem.

A. Answers
B. Solutions
C. Both a and b
D. Decisions
Answer» C. Both a and b
109.

............................ models involve the allocation of resources to activities in such a way that some measure of effectiveness is optimised.

A. Sequencing
B. Allocation
C. Queuing theory
D. Decision theory
Answer» B. Allocation
110.

In .................. models, everything is defined and the results are certain.

A. Probabilistic
B. Deterministic
C. Both a and b
D. None of these
Answer» B. Deterministic
111.

......................... models involve more risks and uncertainties.

A. Probabilistic
B. Deterministic
C. Both a and b
D. None of these
Answer» A. Probabilistic
112.

.......................... models are obtained by enlarging or reducing the size of the items.

A. Iconic models
B. Analogue models
C. Symbolic models
D. None of these
Answer» A. Iconic models
113.

The word .................. may be defined as some actions that we apply to some problems or hypothesis.

A. Research
B. Operations
C. Both a and b
D. None of these
Answer» B. Operations
114.

......................are representations of reality.

A. Phases
B. Models
C. Both a and b
D. None of these
Answer» B. Models
115.

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

A. Iconic models
B. Symbolic models
C. Analogue models
D. None of these
Answer» B. Symbolic models
116.

Probabilistic models are also called ...........................

A. Deterministic models
B. Dynamic models
C. Stochastic models
D. None of these
Answer» C. Stochastic models
117.

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

A. Dynamic
B. Static
C. Both a and b
D. None of these
Answer» B. Static
118.

.......................models consider time as one of the important variable.

A. Dynamic
B. Static
C. Botha and b
D. None of these
Answer» A. Dynamic
119.

........................may be defined as a method of determining an optimal program of interdependent activities in view of available resources.

A. Goal programming
B. Linear programming
C. Decision making
D. None of these
Answer» B. Linear programming
120.

..................... are expressed in the form of equations

A. Objectives
B. Constraints
C. Both a and b
D. None of these
Answer» B. Constraints
121.

If there are more than one optimal solutions for the decision variables, the solution is ...........

A. Infeasible
B. Unbounded
C. Alternative
D. None of these
Answer» C. Alternative
122.

Dual of the dual s a ..........................

A. Dual
B. Primal
C. Alternative
D. None of these
Answer» B. Primal
123.

The quantitative approach to decision analysis is a ..........................

A. Logical approach
B. Rational approach
C. Scientific approach
D. All of the above
Answer» C. Scientific approach
124.

A model is a ...........................

A. An essence of reality
B. An approximation
C. An idealisation
D. All of the above
Answer» D. All of the above
125.

The dummy source/destination in a transportation problem is added to ........................

A. Satisfy rim constraints
B. Prevent solution from becoming degenerate
C. Ensure total cost does not exceed a limit
D. None of the above
Answer» A. Satisfy rim constraints
126.

The solution to a transportation problem with ‘m’ rows and ‘n’ columns is feasible if the number of positive allocations are:

A. m + n
B. m x n
C. m +n – 1
D. m +n + 1
Answer» C. m +n – 1
127.

The method used for solving an assignment problem is:

A. Reduced matrix method
B. MODI method
C. Hungarian method
D. None of these
Answer» C. Hungarian method
128.

An assignment problem can be solved by .........................

A. Simplex method
B. Transportation method
C. Both a and b
D. None of these
Answer» C. Both a and b
129.

For salesman who has to visit ‘n’ cities, which of the following are the ways of his tour plans:

A. n !
B. (n+1) !
C. (n-1) !
D. n
Answer» C. (n-1) !
130.

The assignment problem is:

A. Requires that only one activity be assigned to each resource
B. Is a special case of transportation problem
C. Can be used to maximise resource
D. All the above
Answer» D. All the above
131.

The Hungarian method for solving an assignment problem can also be used to solve:

A. A transportation problem
B. A travelling salesman problem
C. A linear programming problem
D. Both a and b
Answer» B. A travelling salesman problem
132.

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

A. Variables
B. Constraints
C. Functions
D. None of these
Answer» B. Constraints
133.

Graphic method can be applied to solve a liner programming problem when there are only ........................... variables

A. A one
B. Two
C. Three
D. More than three
Answer» B. Two
134.

If the feasible region of a linear programming problem is empty, the solution is ....................

A. Unbounded
B. Infeasible
C. Infeasible
D. Alternative
Answer» B. Infeasible
135.

The variables whose coefficient vectors are unit vectors, are called ......................

A. Unit variables
B. Basic variables
C. Non-basic variables
D. None of these
Answer» B. Basic variables
136.

Any column or row of a simplex table is known as .........................

A. Key column
B. Key row
C. Vector
D. None of these
Answer» C. Vector
137.

.................... is considered as the pioneer of Linear Programming Technique.

A. Churchman
B. D W Miller
C. James Lundy
D. George B Dantzig
Answer» D. George B Dantzig
138.

A minimisation problem can be connected into maximisation problem by changing the signs of coefficients in the ...........................

A. Constraints
B. Objectives
C. Both a and b
D. None of these
Answer» B. Objectives
139.

In an LPP, if the solution of a variable can be made infinitely large without violating the constraints, then the solution is ..............................

A. Infeasible
B. Alternative
C. Unbounded
D. Unique
Answer» C. Unbounded
140.

In maximisation cases, ....................... are assigned to the artificial variables as their coefficients in the objective function.

A. + m
B. – m
C. 0
D. None of these
Answer» A. + m
141.

In simplex method, we add .......................... in the case of constraints with sign “=”

A. Surplus variable
B. Artificial variable
C. Slack variable
D. None of these
Answer» B. Artificial variable
142.

In simplex method, ........................ should be selected when there is tie between slack/surplus variable and decision variable.

A. Slack variable
B. Decision variable
C. Surplus variable
D. None of these
Answer» B. Decision variable
143.

When at least one of the basic variables is zero, then the basic feasible solution to a Linear Programming Problem is said to be ..............................

A. Infeasible
B. Unbounded
C. Degenerate
D. Non-degenerate
Answer» C. Degenerate
144.

In Linear Programming Problem, degeneracy occurs in ................. stages.

A. One
B. Two
C. Three
D. Four
Answer» B. Two
145.

Every Linear Programming Problem is related to another Linear Programming Problem, called ..........................

A. Primal
B. Dual
C. Non-linear Programming
D. None of these
Answer» B. Dual
146.

In a maximisation assignment problem, the objective is to maximise .............................

A. Profit
B. Cost
C. Optimisation
D. None of these
Answer» A. Profit
147.

Operations Research does not give perfect solution to a problem, but it helps to improve the ......................... of the solution.

A. Quality
B. Clarity
C. Look
D. None of these
Answer» A. Quality
148.

Operations Research makes a ...................... attack on complex problems to arrive at optimal solution.

A. Scientific
B. Systematic
C. Both a and b
D. None of these
Answer» C. Both a and b
149.

Operations Research uses models to help the management in determining its .................... scientifically.

A. Policies
B. Actions
C. Both a and b
D. None of these
Answer» C. Both a and b
150.

Operations Research is a ................................

A. Science
B. Art
C. Both a and b
D. None of these
Answer» C. Both a and b
151.

......................... deals with making sound decisions under conditions of certainty, risk and uncertainty.

A. Game theory
B. Network analysis
C. Decision theory
D. None of these
Answer» C. Decision theory
152.

....................... deals with the concepts such as critical path, float, events, etc.

A. Game theory
B. Decision theory
C. Queuing theory
D. Network analysis
Answer» D. Network analysis
153.

............................... is used to imitate an operation prior to actual performance.

A. Inventory control
B. Simulation
C. Game theory
D. Integrated Production Model
Answer» B. Simulation
154.

............................... is concerned with determination of the most economic replacement policy.

A. Probabilistic programming
B. Linear programming
C. Search theory
D. Replacement theory
Answer» D. Replacement theory
155.

The O R technique which helps in minimising total waiting and service cost is:

A. Game theory
B. Queuing theory
C. Both a and b
D. Decision theory
Answer» B. Queuing theory
156.

Linear Programming technique is a:

A. Constrained optimisation technique
B. Technique for economic allocation of resources
C. Mathematical technique
D. All of the above
Answer» D. All of the above
157.

A constraint in a Linear Programming Model restricts:

A. Value of objective function
B. Value of decision variable
C. Use of available resources
D. All of the above
Answer» D. All of the above
158.

Before formulating a formal L P model, it is better to:

A. Verbally identify decision variables
B. Express the objective function in words
C. Express each constraint in words
D. All of the above
Answer» D. All of the above
159.

Linear Programming Technique helps to find an optimal use of:

A. Machine
B. Money
C. Manpower
D. All of the above
Answer» D. All of the above
160.

Which of the followings is an assumption of Linear Programming Technique?

A. Divisibility
B. Additivity
C. Proportionality
D. All of the above
Answer» D. All of the above
161.

Which of the following is true with regard to a Linear Programming Model?

A. No guarantee to get integer valued solution
B. The relationship among decision variables is liner
C. Both a and b
D. None of the these
Answer» D. None of the these
162.

The graphical method if LPP uses:

A. Linear equations
B. Constraint equations
C. Objective function
D. All of the above
Answer» D. All of the above
163.

Constraints in an LPP are treated as active, if they:

A. Do not consume all the available resources at optimality
B. Represent optimal solution
C. Both a and b
D. None of these
Answer» B. Represent optimal solution
164.

While solving a LPP graphically, the area bounded by constraints is called .................

A. Feasible region
B. Infeasible region
C. Unbounded region
D. None of these
Answer» A. Feasible region
165.

While solving an LPP, infeasibility may be removed by:

A. Removing a variable
B. Removing a constraint
C. Adding a variable
D. Adding a constraint
Answer» B. Removing a constraint
166.

........................variables are fictitious and cannot have any physical meaning.

A. Slack variables
B. Surplus variables
C. Artificial variables
D. Decision variables
Answer» C. Artificial variables
167.

An optimal solution is considered as the ................... among the feasible solutions.

A. Worst
B. Best
C. Ineffective
D. None of these
Answer» B. Best
168.

........................... method is used to solve an assignment problem.

A. American method
B. Hungarian method
C. German method
D. British method
Answer» B. Hungarian method
169.

The allocated cells in the transportation table are called ..............................

A. Occupied cells
B. Empty cells
C. Unoccupied cells
D. None of these
Answer» A. Occupied cells
170.

In transportation Problems, VAM stands for .........................

A. Value Addition Method
B. Vogel’s Approximation Method
C. Virgenean Approximation Method
D. None of these
Answer» B. Vogel’s Approximation Method
171.

Initial feasible solution to a transportation Problem can be found out by .........................

A. VAM
B. MODI Method
C. Both a and b
D. None of these
Answer» A. VAM
172.

........................ is applied to determine optimal solution.

A. NWCR
B. VAM
C. MODI Method
D. None of these
Answer» C. MODI Method
173.

A Transportation Problem is said to be unbalanced when total supply is not equal to ............

A. Total cost
B. Total demand
C. Both a and b
D. None of these
Answer» B. Total demand
174.

For a minimisation Transportation Problem, the objective is to minimise:

A. Profit
B. Cost
C. Solution
D. None of these
Answer» B. Cost
175.

....................... is an important Operations Research Technique to analyse the queuing behaviour.

A. Game theory
B. Waiting line theory
C. Decision theory
D. Simulation
Answer» B. Waiting line theory
176.

An organisation chart is an example of ...........................

A. Iconic model
B. Mathematical model
C. Analogue model
D. None of these
Answer» C. Analogue model
177.

........................ model is a map which indicates roads, highways, towns and inter-relationships

A. Iconic model
B. Analogue model
C. Mathematical model
D. None of these
Answer» B. Analogue model
178.

Operations Research techniques help to find ................... solution.

A. Feasible solution
B. Infeasible solution
C. Optimal solution
D. None of these
Answer» C. Optimal solution
179.

Operations Research Techniques involves ..................... approach.

A. Team approach
B. Critical approach
C. Individual approach
D. None of these
Answer» C. Individual approach
180.

A LPP model doesnot contain:

A. Decision
B. Constraints
C. Feasible solution
D. Spread Sheet
Answer» D. Spread Sheet
181.

Straight lines shown in a linear programming graph indicates ...........................

A. Objective function
B. Constraints
C. Points
D. All of the above
Answer» B. Constraints
182.

Non-negativity constraints are written as ......................

A. Equality
B. Non-equality
C. Greater than or equal to
D. Less than or equal to
Answer» C. Greater than or equal to
183.

PERT stand for:

A. Performance Evaluation Review Technique
B. Programme Evaluation Review Technique
C. Programme Evaluation Research Technique
D. None of these
Answer» B. Programme Evaluation Review Technique
184.

An activity which must be completed before commencement of one or more other activities is called.................................

A. Successor activity
B. Predecessor activity
C. Dummy activity
D. None of these
Answer» B. Predecessor activity
185.

In network diagram, events are commonly represented by .........................

A. Arrows
B. Nodes
C. Triangles
D. None of these
Answer» B. Nodes
186.

......................... is activity oriented network diagram.

A. CPM
B. PERT
C. Histogram
D. Ogive
Answer» A. CPM
187.

................... is an event oriented network diagram.

A. CPM
B. PERT
C. Histogram
D. Ogive
Answer» B. PERT
188.

An activity which does not consume either resource or time is called .............................

A. Predecessor activity
B. Successor activity
C. Dummy activity
D. Terminal activity
Answer» C. Dummy activity
189.

......................... is a series of activities related to a project.

A. Network
B. Transportation Model
C. Assignment model
D. None of these
Answer» A. Network
190.

An event which represents the beginning of more than one activity is a :

A. Merge event
B. Net event
C. Burst event
D. None of these
Answer» C. Burst event
191.

Activities lying on critical path are called ............................

A. Critical activities
B. Non-critical activities
C. Dummy activities
D. None of these
Answer» A. Critical activities
192.

Activities that cannot be started until one or more of the other activities are completed, are called..........................................

A. Dummy activities
B. Initial activities
C. Successor activities
D. Predecessor activities
Answer» C. Successor activities
193.

............................ is the sequence of activities which determines the total project duration.

A. Critical path
B. Network
C. Non-critical activities
D. None of these
Answer» A. Critical path
194.

PERT emphasises on ...........................

A. Activity
B. Time
C. Cost
D. None of these
Answer» B. Time
195.

..................... is the duration by which an activity can be delayed without delaying the completion of the project.

A. Earliest Start Time
B. Earliest Finish Time
C. Latest Start Time
D. Latest Finish Time
Answer» C. Latest Start Time
196.

The EST + activity duration = ..............................

A. Earliest Finish Time
B. Latest Start Time
C. Latest Finish Time
D. None of these
Answer» A. Earliest Finish Time
197.

............................ is the latest time by which an activity can be finished without delaying the completion of the project.

A. LST
B. LFT
C. EFT
D. EST
Answer» B. LFT
198.

......................... is a scheme or design of something intended to do.

A. Network
B. Float
C. Project
D. Program
Answer» A. Network
199.

In a network diagram, activity is denoted by ............................

A. Node
B. Arrow
C. Triangle
D. None of these
Answer» B. Arrow
200.

.......................... is the duration by which an activity can be delayed without delaying the project.

A. Slack
B. Total float
C. Both a and b
D. None of these
Answer» B. Total float
Tags
Question and answers in Management Science, Management Science multiple choice questions and answers, Management Science Important MCQs, Solved MCQs for Management Science, Management Science MCQs with answers PDF download