Professional Documents
Culture Documents
Decision Sciences MCQ by Prof. Sujeet Tambe: Multiple Choice Questions Decision Science
Decision Sciences MCQ by Prof. Sujeet Tambe: Multiple Choice Questions Decision Science
Decision Sciences MCQ by Prof. Sujeet Tambe: Multiple Choice Questions Decision Science
Sujeet Tambe
4. A model is
a. An essence of reality
b. An approximation
c. An idealization
d. All of the above
9. An optimization model
a. Provides the best decision
b. Provides decision within its limited context
c. Helps in evaluating various alternatives
d. All of the above
21. The best use of linear programming technique is to find an optimal use of
a. Money
b. Manpower
c. Machine
d. All of the above
28. Which of the following statements is true with respect to the optimal
solution of an LP problem
a. Every LP problem has an optimal solution
b. Optimal solution of an LP problem always occurs at an extreme point
c. At optimal solution all resources are completely used
Decision Science MCQ by Prof. Sujeet Tambe Page 5
Decision Sciences MCQ by Prof. Sujeet Tambe
30. If an iso-profit line yielding the optimal solution coincides with a constaint
line, then
a. The solution is unbounded
b. The solution is infeasible
c. The constraint which coincides is redundant
d. None of the above
31. While plotting constraints on a graph paper, terminal points on both the
axes are connected by a straight line because
a. The resources are limited in supply
b. The objective function as a linear function
c. The constraints are linear equations or inequalities
d. All of the above
33. If two constraints do not intersect in the positive quadrant of the graph,
then
a. The problem is infeasible
b. The solution is unbounded
c. One of the constraints is redundant
d. None of the above
36. While solving a LP model graphically, the area bounded by the constraints
is called
a. Feasible region
b. Infeasible region
c. Unbounded solution
d. None of the above
45. One disadvantage of using North-West Corner rule to find initial solution
to the transportation problem is that
a. It is complicated to use
b. It does not take into account cost of transportation
c. It leads to a degenerate initial solution
d. All of the above
46. The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’
columns (destination) is feasible if number of positive allocations are
a. m+n
b. m*n
c. m+n-1
d. m+n+1
47. If an opportunity cost value is used for an unused cell to test optimality, it
should be
a. Equal to zero
b. Most negative number
c. Most positive number
d. Any value
48. During an iteration while moving from one solution to the next,
degeneracy may occur when
a. The closed path indicates a diagonal move
b. Two or more occupied cells are on the closed path but neither of them represents
a corner of the path.
c. Two or more occupied cells on the closed path with minus sign are tied for
lowest circled value
d. Either of the above
50. The smallest quantity is chosen at the corners of the closed path with
negative sign to be assigned at unused cell because
a. It improve the total cost
b. It does not disturb rim conditions
c. It ensure feasible solution
d. All of the above
52. Which of the following methods is used to verify the optimality of the
current solution of the transportation problem
a. Least cost method
b. Vogel’s approximation method
c. Modified distribution method
d. All of the above
55. An optimal assignment requires that the maximum number of lines that
can be drawn through squares with zero opportunity cost be equal to the
number of
a. Rows or columns b. Rows & columns
c. Rows + columns – 1 d. None of the above
62. For a salesman who has to visit n cities which of the following are the ways
of his tour plan
a. n!
b. (n+1)!
c. (n-1)!
d. n
66. To proceed with the MODI algorithm for solving an assignment problem,
the number of dummy allocations need to be added are
a. n b. 2n
c. n-1 d. 2n-1
Decision Science MCQ by Prof. Sujeet Tambe Page 12
Decision Sciences MCQ by Prof. Sujeet Tambe
67. 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 LP problem
d. Both a & b
69. Customer behavior in which the customer moves from one queue to
another in a multiple channel situation is
a. Balking
b. Reneging
c. Jockeying
d. Altering
74. Which of the cost estimates & performance measures are not used for
economic analysis of a queuing system
a. Cost per server per unit of time
b. Cost per unit of time for a customer waiting in the system
c. Average number of customers in the system
d. Average waiting time of customers in the system
83. If a matrix of transition probability is of the order n*n, then the number of
equilibrium equations would be
a. n
b. n-1
c. n+1
d. None of the above
88. The transition matrix elements remain positive from one point to the next.
This property is known as:
a. Steady-state property
b. Equilibrium property
c. Regular property
d. All of the above
90. Which of the following is not one of the assumptions of Markov analysis:
a. There are a limited number of possible states
b. A future state can be predicted from the preceding one
c. There are limited number of future periods
d. All of the above
93. Which of the following is not the special purpose simulation language
a. BASIC
b. GPSS
c. GASP
d. SIMSCRIPT
96. Analytical results are taken into consideration before a simulation study so
as to
a. Identify suitable values of the system parameters
b. Determine the optimal decision
c. Identify suitable values of decision variables for the specific choices of
system parameters
d. All of the above
97. Biased random sampling is made from among alternatives which have
a. Equal probability
b. Unequal probability
c. Probability which do not sum to 1
d. None of the above
2. the decision maker must evaluate each alternative with respect to each
criterion
3. successive decisions must be made over time
4. each of the above is true
1. tells how much or how many of something to produce, invest, purchase ,hire
2. represent the values of the constraints
3. measure the objective function
4. must exist for each constraint
1. Maximize 5xy
2. Minimize 4x+3y+3z
3. Maximize 3xy+5xy
4. Minimize(x1+x2)/x3
116. A solution that satisfies all the constraints of the LPP except the non
negativity constraints is called
1. optimal
2. feasible
3. infeasible
4. semi-feasible
117. Slack
1. is the difference between the left and right sides of the constraints
2. is the amount by which the left side of the constraint is smaller than the right
side
3. is the amount by which the left side of the constraint is larger than the right side
4. exists for each variable in a linear programming problem
118. To find the optimal solution to the LPP using the graphical method
1. find the feasible point that is the farthest away from the region
2. find the feasible point that is at the highest location
3. find the feasible point that is closest to the origin
4. None of the alternative is correct
119. Which of the following cases does not require reformulation of the
problem in order to obtain a solution?
1. Alternate optimality
2. Infeasibility
3. Unboundness
4. Each case requires a reformulation
120. Whenever all constraints in the LPP are expressed as equalities, the
linear program is said to be written in
1. Standard form
2. Bounded form
3. Feasible form
4. Alternate form
1. Identification of problem
2. Identification of problem and the action to resolve it
3. Identification of problem and finding of objective function
4. All of above
1. Decision making
2. Problem solving
3. Manufacturing Industry
4. Only in service sector
1. Imaginary
2. Real
3. Rigid
4. Can’t say
1. Consignments
2. Goods
3. Demand
4. Supply
1. Least
2. Maximum
3. Can’t say
4. None of above
1. Customer preference
2. Competitors entry
3. Market condition
4. None of above
1. Decision variable
2. Objective function
3. Constraints
4. None of above
1. Equal
2. Unequal
3. Stable
4. None of above
1. Mathematical
2. Statistical
3. Graphical
4. None of above
1. Linear variables
2. Linear constraints
3. Linear functions
4. None of above
1. Constraints
2. Decision variable
3. Objective functions
4. Cann’t say
1. Complex
2. Simplex
3. Corner point
4. Iso profit
1. Transportation problem
2. Assignment
3. Cann’t say
4. Queuing
1. Transportation
2. Assignment
3. LPP
4. All above
136. ……………is used to collect a set of experimental data and figure out to
graph
1. LPP
2. Mathematical model
3. Corner point model
4. Operation research model
1. True
2. False
3. Cannot say
4. Data is not sufficient
1. True
2. False
3. Cannot say
4. Data is not sufficient
1. at a maximum cost
2. at a minimum cost
3. at a minimum profit
4. at a minimum revenue
1. maximum-flow
2. transportation
3. shortest-route
4. none of the above
1. 0
2. 1
3. 2
4. 3
144. The transportation model relies on certain assumptions. They include all
of the following except
145.Which of the following are supply points that a transportation model can
analyze?
1. factories
2. warehouses
3. departments
4. all of the above
5. none of the above
1. analytical
2. non-linear
3. linear
4. rotating
5. variable
148. Before the analyst of the transportation model can begin, what data
would they need to collect?
1. A list of destinations
2. Unit cost to ship
3. A list of origins
4. All of the above
1. highest cost-plan
2. lowest cost-plan
3. closest destinations
4. farthest destinations
5. none if the above
1. manually
2. with a table
3. with excel
4. with software packages
5. all of the above
1. warehouses
2. factories
3. grocery stores
4. department stores
5. goods are sent from all of these locations
1. docks
2. departments
3. factories
4. warehouses
5. all of the above
154. The method for finding the lowest-cost plan for distributing stocks of
goods or supplies from multiple origins to multiple destinations that demand
the goods is
1. cost-volume analysis
2. transportation model analysis
3. factor rating analysis
4. linear regression analysis
5. MODI analysis
1. production planning
2. capacity planning
3. transshipment problem
4. comparison of location alternative
5. all of the above
1. Cost-volume analysis
2. Transportation model analysis
3. Factor rating analysis
4. Linear regression analysis
5. MODI analysis
1. medium problems
2. very small, but time consuming problems
3. large problems
4. all of the above
5. none of the above
161.Decision alternatives
a. Should be identified before decision criteria are established
b. Are limited to quantitative solutions
c. Are evaluated as a part of the problem definition stage
d. Are best generated by brain storming
a. tells how much or how many of something to produce, invest, purchase ,hire
b. represent the values of the constraints
c. measure the objective function
d. must exist for each constraint
a. Maximize 5xy
b. Minimize 4x+3y+3z
c. Maximize 3xy+5xy
d. Minimize(x1+x2)/x3
169. A solution that satisfies all the constraints of the LPP except the non-
negativity constraints is called
a. optimal
b. feasible
c. infeasible
d. semi-feasible
170. Slack
a. is the difference between the left and right sides of the constraints
b. is the amount by which the left side of the constraint is smaller than the
right side
c. is the amount by which the left side of the constraint is larger than the right side
d. exists for each variable in a linear programming problem
171. To find the optimal solution to the LPP using the graphical method
a. find the feasible point that is the farthest away from the region
b. find the feasible point that is at the highest location
c. find the feasible point that is closest to the origin
d. None of the alternative is correct
172. Which of the following cases does not require reformulation of the problem
in order to obtain a solution?
a. Alternate optimality
b. Infeasibility
c. Unsoundness
d. Each case requires a reformulation
173. Whenever all constraints in the LPP are expressed as equalities, the linear
program is said to be written in
a. Standard form
b. Bounded form
c. Feasible form
d. Alternate form
a. Identification of problem
b. Identification of problem and the action to resolve it
c. Identification of problem and finding of objective function
d. All of above
a. Decision making
b. Problem solving
c. Manufacturing Industry
d. Only in service sector
a. Least
b. Maximum
c. Can’t say
d. None of above
a. Customer preference
b. Competitors entry
c. Market condition
d. None of above
a. Decision variable
b. Objective function
c. Constraints
d. None of above
a. Equal
b. Unequal
c. Stable
d. None of above
a. Linear variables
b. Linear constraints
c. Linear functions
d. None of above
a. Constraints
b. Decision variable
c. Objective functions
d. Can’t say
a. Complex
b. Simplex
c. Corner point
d. none of above
c. Can’t say
d. Queuing
a. LPP
b. Mathematical model
c. Corner point model
d. Operation research model
a. True
b. False
c. Cannot say
d. Data is not sufficient
a. True
b. False
c. Cannot say
d. Data is not sufficient
Decision Science MCQ by Prof. Sujeet Tambe Page 37
Decision Sciences MCQ by Prof. Sujeet Tambe
a. maximum-flow
b. transportation
c. shortest-routed.
d. none of the above
a. destination / source
b. source / destination
c. demand / source
d. source / demand
a. 0
b. 1
c. 2
d. 3
201. A physical model that does not have the same physical appearance as the
object being modeled is
a. an analog model.
b. an iconic model.
c. a mathematical model.
d. a qualitative model.
205. Slack
a. is the difference between the left and right sides of a constraint.
b. is the amount by which the left side of a < constraint is smaller than the
right side.
c. is the amount by which the left side of a > constraint is larger than the right side.
d. exists for each variable in a linear programming problem.
206.Which of the following special cases does not require reformulation of the
problem in order to obtain a solution?
a. alternate optimality
b. infeasibility
c. unboundedness
d. each case requires a reformulation.
208. The amount that the objective function coefficient of a decision variable
would have to improve before that variable would have a positive value in the
solution is the
a. dual price.
b. surplus variable.
c. reduced cost.
d. upper limit.
210. In the simplex method, a tableau is optimal only if all the cj – zj values are
a. zero or negative.
b. zero.
c. negative and nonzero.
d. positive and nonzero.
221. The critical path is the __________ path through the network.
a. longest
b. shortest
c. straightest
d. none of the above
223. The transportation model relies on certain assumptions. They include all
of the following except
a. the items must be homogeneous
b. there is only one route being used between each origin and destination
c. the shipping cost per unit is the same
d. the items must be large scale
224. Which of the following are supply points that a transportation model can
analyze?
a. Factories
b. warehouses
c. departments
d. all of the above
e. none of the above
227. Before the analyst of the transportation model can begin, what data
would they need to collect?
a. A list of destinations
b. Unit cost to ship
c. A list of origins
d. All of the above
e. None of the above
a. highest cost-plan
b. lowest cost-plan
c. closest destinations
d. farthest destinations
e. none if the above
233. The method for finding the lowest-cost plan for distributing stocks of
goods or supplies from multiple origins to multiple destinations that demand
the goods is
a. cost-volume analysis
b. transportation model analysis
c. factor rating analysis
d. linear regression analysis
e. MODI analysis
a. medium problems
b. very small, but time consuming problems
c. large problems
d. all of the above
e. none of the above
a. linear model
b. quadratic model
c. model with two variables
d. both a and c
e. none of the above
a. what type of transportation to use (boat, truck, train or plane) to transport goods,
while minimizing costs
b. what day of the week goods should be transportation on to minimize costs
c. how to distribute goods from multiple origins to multiple destinations to
minimize total shipping costs
d. how to best package goods so that they wouldn't break while transporting them
e. none of the above
a. A list of origins and each one's capacity or supply quantity per period
b. A list of destinations and each one's demand per period
c. The unit cost of shipping items from each origin to each destination
d. All of the above
e. Only A and B
a. Solution
b. Programming
c. Data
d. Shipping
e. Distribution