UNIT 1
Question 01
Operations Research is a
A. Scientific Method
B. Integral method
C. Trial and Error Method
D. Conventional Method
Question 02
A solution which optimizes the objective function is called
A Optimal solution
B Feasible solution
C Initial solution
D Infeasible solution
Question 03
A Feasible solution in LP means
A solution that satisfies all
A
the constraints
Any set of values for
B
variables
Variables that represent
C
decisions
A solution that does not
D
satisfy all the constraints
Question 04
A constraint of the type ≤ can be converted into an equation by adding a
______variable to the left side of the constraint
A Slack
B Surplus
C Artificial
D Decision
Question 05
When the number of unit vectors in a simplex table is equal to the number of
constraints, then the table is said to be in
A Canonical Form
B Primal Form
C Standard Form
D Dual Form
Question 06
Operations Research is concerned with the concept of
A Optimization
B Minimization
C Maximization
D Neither maximize or minimize
Question 07
We can solve a linear programming problem by simplex method if
There are any number of constraints and any number of
A
decision variables.
B Number of decision variables = Number of constraints.
Number of constraints is less than the number of decision
C
variables.
Number of constraints is greater than number of decision
D
variables.
Question 08
A basic solution to the system is called __________if one or more of the variables
vanish.
A Degenerate
B No feasible
C Non- Degenerate
D Multiple optimal
Question 09
Which of the following variable is subtracted from the left side of the constraint of the
type to be converted to an equation?
A Surplus
B Slack
C Artificial
D Real
Question 10
Decision variables are
the unknown that are to be determined by solving the
A model.
B the known values of the model.
variables not under the control of the decision maker.
C
the variables that we introduce to bring it to standard form
D
Question 11
Graphical method can be used to solve linear programming problems with
A Two variables
B Two constraints
C More than 2 variables
D More than 2 constraints
Question 12
In standard form, all constraints are expressed as
A equal to
B greater than or equal to
C less than or equal to
D not equal to
Question 13
Simplex methods is a technique of solving
Linear Programming
A
Problem
B Assignment problem
C Transportation problem
D Inventory Problems
Question 14
When the max value of Z occurs at the point of infinity then the LPP is said to have
A an unbounded solution
B an optimum solution
C no solution
D All of the above
Question 15
The cost coefficient of slack variable is
A Zero
B One
C > than one
D < than one
Question 16
The solution of the Linear programming problem in graphical solution lies in
A First quadrant
B Second quadrant
C Third quadrant
D Fourth quadrant
Question 17
The slack variables indicate
Shortage of resource
A
available
B Excess resource available
C Nil resources,
D Idle resource.
Question 18
The objective of Operations Research is:
Optimal utilization of
A
existing resources
B To derive formulas
To find new methods of
C
solving Problems
To utilize the services of
D
scientists
Question 19
O.R. came into existence during
A World War II
B India and Pakistan War
C World War I
D Iran war
Question 20
A feasible solution, which is also basic is called a
A Basic feasible solution
B Infeasible Solution
C Basic Solution
D None
[UNIT-II]
Question 21
The demand and the supply of the assignment problem is equal to
A 1
B 0
C -1
D 2
Question 22
The Transportation problem is said to be balanced if
A sum ai = sum bj
B sum ai < sum bj
C sum ai > sum b
D sum ai ,sum bj =0
Question 23
In transportation problem non-degeneracy occurs when
A Number of cells occupied equal to m + n – 1
B Number of cells occupied equal to m + n + 1
C Number of cells occupied equal to m + n + other cells occupied.
D Number of cells occupied < m + n – 1
Question 24
The objective of transportation problem is
To minimize the
A
transportation cost
To avoid shortages at
B
destinations
To avoid the stagnation at
C
origin.
D To transport large quantities
Question 25
When the number of allocated cells is less than m+n-1, the solution is said to be
A degenerate
B non degenerate
C Optimal
D Infeasible
Question 26
The method used to find the optimal solution for a transportation problem is
A MODI
B Matrix minimum
C North west corner
D VAM
Question 27
A basic feasible solution for a TP must have exactly ____non-negative allocations
A m+n-1
B m+n+1
C m+n
D m-n
Question 28
MODI method is used to find
A optimality
B basic feasible solution
C Degeneracy
D Non degeneracy
Question 29
Vogel’s Approximation method is otherwise called as
A Penalty method
B Modified method
C Alternative method
D Bisection method
Question 30
When the total supply is not equal to total demand the TP is said to be
A Unbalanced
B Balanced
C Degenerate
D non-degenerate
Question 31
There are ____ methods for finding the initial basic feasible solution for a TP
A 3
B 2
C 1
D 4
Question 32
The special structure of the assignment model allows the development of an
efficient solution technique called
A Hungarian method
B VAM method
C Transhipment method
D Simplex Method
Question 33
The objective of an Assignment problem is to ______ overall profit or
_______overall cost
A Maximize, Minimize
B Maximize, Maximize
C Minimize, Maximize
D Minimize, Minimize
Question 34
An assignment problem with 5 rows and 4 columns is called as
Unbalanced Assignment
A
Problem
Degenerate Assignment
B
Problem,
Balanced Assignment
C
Problem
Non- Degenerate
D
Assignment Problem
Question 35
The assignment schedule will be optimal if there is exactly ______assignment in each
row and each column
A One
B Three
C Zero
D Two
Question 36
When the given matrix is not a square Matrix, the assignment problem is said to be a
A Unbalanced AP
B Balanced TP
C Balanced AP
D Unbalanced TP
Question 37
The method used to find the optimal solution for an Assignment Problem is
A Hungarian
B Modi
C Vogel’s Approximation
D Least Cost Method
Question 38
In checking for optimality in an assignment problem, the number of lines used should
be:
A minimum
B maximum
C Equal
D Zero
Question 39
Assignment Problem is a special case of
A Transportation Problem
B Inventory Problem
C Queueing Problem
D Replacement Problem
Question 30
LCM is otherwise known as
A Matrix Minima method
B Stepping stone
C Row Minimum method
D Column Minimum method
[UNIT-III]
Question 41
The solution for 2 row game solved by graphical method is
A lower envelope upper point
B upper envelope lower point
C upper envelope upper point
D lower envelope lower point
Question 42
When maximin value = minimax value, the game is said to be
A strictly determinable
B Fair
C unsolvable game
D unfair
Question 43
A game is said to be fair if
maximin value = minimax
A
value=0
B value of the game is not zero
C maximin value is zero
maximin value ≠ minimax
D
value
Question 44
Games with saddle point are the games with
A pure strategy
B mixed strategy
C optimum strategy
D None of the above
Question 45
The course of action decided by a person in the games theory is known as
A strategy
B Game
C mixed strategy
D Value of the game
Question 46
In a game, mixed strategy is applicable when
A saddle point does not exist
B saddle point exist
C value of the game is zero
D Value of the game > 0
Question 47
A two-person zero-sum game means that the
the sum of losses to one player is
A
equal to the sum of gains to other
the sum of losses to one player is not
B
equal to the sum of gains to other
C no any player gains or losses
D No gain
Question 48
In a two person zero sum game
gain made by one equals the loss
A
incurred by another
gain made by one is lower than the
B
loss incurred by another
gain made by one is higher than the
C
loss incurred by another
D gain is made by two persons
Question 49
In a game, pure strategy is applicable when
A saddle point exists
B saddle point does not exist
C value of the game is zero
D Value of the game > 0
Question 50
Playing only one strategy throughout the game is called
A Pure strategy
B Mixed Strategy
C Dominance
D Fair game
Question 51
Game Theory models are classified by the
Number of players , Sum of all players and Number of
A
strategies
B Sum of all players
C Number of strategies
D Number of players
Question 52
What happens when maximin and minimax values of the game are same?
A Saddle point exists
B Solution is mixed
C No solution exists
D Outcome
Question 53
The size of the payoff matrix of a game can be reduced by using the principle of
A Dominance
B Rotation reduction
C Game inversion
D Game transpose
Question 54
In a pure strategy game
A Both players select their optimal strategy
B A particular strategy is selected by each player
C Any strategy may be selected arbitrary
D saddle point exist
Question 55
The single server queuing model is referred as
A M/M/1
B M/G/3
C M/M/C
D M/M/2
Question 56
SIRO stands for
A Service in random order
B Service in required order
C Service in time
D Service in reverse order
Question 57
The queue is also known as
A Waiting Line
B Channel
C Line
D Leaving
Question 58
Jumping from one queue to another is called
A Jockeying
B Reneging
C Balking
D Service
Question 59
Time taken by the server to serve a customer is called
A Service time
B Inter arrival time
C Waiting time
D Single or MultiServer
Question 60
An arriving unit that is waiting to be served is called
A a customer
B a server
C a player
D a waiter
[UNIT-IV]
Question 61
Stock of goods kept for future use, which has some Economic value iscalled
A Inventory
B Inventory Control
C Store
D holding cost
Question 62
The cost of holding an item in inventory for a specified time is
A Inventory carrying Cost
B Ordering Cost
C Shortage Cost
D Purchase cost
Question 63
Additional stock kept to protect against stock outs due to uncertainty indemand over
lead time is called
A Safety and Buffer Stock
B Buffer stock
C Safety stock
D Unsafety stock
Question 64
The optimal order quantity is also called as
EOQ and optimal order
A
quantity
B Economic Lot Size
C Optimal order quantity
D Economic Order Quantity
Question 65
When an item cannot be supplied on the customer’s demand, the cost incurred is
known as
A Shortage cost
B Holding cost
C Set up cost
D Purchase cost
Question 66
EOQ decreases when the cost of item
A Increases
B Decreases
C does not change
D equal to
Question 67
Time between ordering and actual receiving of goods is called
A Lead Time
B order cycle
C Stock holding time
D manufacturing time
Question 68
Interest on invested capital, depreciation, maintenance etc are examples of
A Holding cost
B Set up cost
C Shortage cost
D Purchase cost
Question 69
If the unit cost rises, then the optimal order Quantity
A Decreases
B Increases
C does not change
D equal to
Question 70
Formula for EOQ under purchasing model without shortages is given by
2 of Demand * ordering
A
cost / holding cost
√2 of holding cost * ordering
B
cost /Demand
√2 of demand* holding cost /
C
ordering cost
√2 of holding cost * shortage
D
cost /Demand
Question 71
One of the important basic objectives of Inventory management is
To employ the available capital efficiently so as to yield
A
maximum results,
B To go in person to the market and purchase the materials,
C To calculate EOQ for all materials in the organisation,
Once materials are issued to the departments, personally check
D
how they are used
Question 72
The best way of improving the productivity of capital is
Productivity of capital is to be increased through effective
A materials management.
B Effective labour control,
C To use good financial management,
D Purchase automatic machines,
Question 73
Materials management is a body of knowledge, which helps manager to
Increase the productivity of capital by
A
reducing the cost of material,
B Search for needed material,
C Study the properties of materials,
D Search for no need
Question 74
The stock of materials kept in the stores in anticipation of future demand is known
as:
A Inventory
B Stock of materials,
C Storage of materials,
D Raw materials
Question75
The stock of animals reared in anticipation of future demand is known as
A Live stock inventory,
B Animal inventory,
C Flesh inventory,
D Domestic inventory
Question 76
We can reduce the materials cost by
Using systematic inventory
A
control techniques,
B Using the cheap material,
Reducing the use of
C
materials,
Making hand to mouth
D
purchase,
Question 77
If shortage cost is infinity,
A Ordering cost is zero
No inventory carrying cost is
B
allowed,
C No shortages are allowed;
Purchase cost = Carrying
D
cost.
Question 78
The inventory maintained to meet unknown demand changes is known as
A Fluctuatory inventory.
B Pipeline inventory,
C Anticipatory inventory,
D De coupling inventory,
Question 79
Which of the following increases with quantity ordered per order?
A Carrying cost,
B Ordering cost,
C Purchase cost,
D Demand
Question 80
The lead-time is the time:
Between placing the order
A
and receiving the materials
B Of receiving materials,
Between receipt of material
C
and using materials,
To place orders for
D
materials,
[UNIT-V]
Question 81
A graphical representation of the activities of the project is called
A an arrow diagram
B an activity chart
C a graph
D A cycle
Question 82
The activities of the project that control the time needed to complete the entire project
are called
A critical activities
B preceding activities
C Non-critical activities
D succeeding activities
Question 83
A point in time that signifies the completion of some activities and the beginning of
others
A an event
B an arrow
C an activity
D A trial
Question 84
In an arrow diagram, an activity is represented by
A a node
B a triangle
C arrow
D a rectangle
Question 85
The earliest start and earliest finish times for each activity is obtained from
A Forward Pass calculations
B Backward Pass calculations
C Both Forward and Backward
neither Forward and
D
Backward
Question 86
In a network critical path is the
A longest path
B shortest path
C optimal path
D Normal path
Question 87
The amount of time by which an activity can be delayed without delaying the
project completion date is called
A total float
B free
C independent float
D interfering float
Question 88
A path from the first node to the last node comprising only of critical activities is
called
A critical path
B a shortest path
C optimal path
D Normal path
Question 89
The three time estimates are reduced into a single expected time using the formula
A te = (a+ 4m+ b) / 6
B te = (4a +m+b) / 6
C te = ( a+ m+4b) / 6
D te = (4 a+ m+4b) / 6
Question 90
CPM Networks are generally.
A Activity – oriented
B Event – oriented
C Time – oriented
D Depends on nothing
Question 91
In a network, events are represented by
A Circle
B Square
C Triangles
D Rectangle
Question 92
In a network, the finishing point of an activity is called the
A Head event
B Tail event
C Head – tail event
D Tail-Head event
Question 93
The standard normal variable Z is
A (x – μ) /
B ( x + x) /
C ( x – x) /
D (x + μ) /
Question 94
The term looping is concerned with
A Network
B PERT
C CPM
D Dummy
Question 95
Activities that must be completed immediately prior to the start of another activity are
called
A Predecessor activity
B Successor activity
C Dummy activity
D Null activity
Question 96
A delay in one activity makes a delay in the entire project then the activity is referred
to as
A Critical activity
B Dummy activity
C Delay activity
D Non critical activity
Question 97
Total float for critical activity is
A =0
B <0
C >0
D =1
Question 98
_______ is a task or work to be done in a project
Optimal utilization of
A
existing resources
B To derive formulas
To find new methods of
C
solving Problems
To utilize the services of
D
scientists
Question 99
PERT uses __________ time estimates
A 3
B 4
C 2
D 1
Question 100
What is the particular task performance in CPM known as?
A Activity
B Event
C Dummy
D Contract
