Decision Science MCQ PDF
Decision Science MCQ PDF
Decision Science MCQ PDF
com
Mo No-9665383478/7757034910
Decision Science (204)
Multiple Choice Questions
1. The field of management science
1. Concentrates on the on the use 3. is another name for decision
of quantitative methods to assists science and for operation
in decision making research
2. Approaches decision making with 4. each of the above is true
techniques based on the
scientific method
2. Identification and definition of a problem
1. Cannot be done until alternatives 3. Is the final step of problem
are proposed solving
2. Is the first step of decision 4. Requires consideration of
making multiple criteria
3. Decision alternatives
1. Should be identified before 3. Are evaluated as a part of the
decision criteria are problem definition stage
established 4. Are best generated by brain
2. Are limited to quantitative storming
solutions
4. Decision Criteria
1. are the choices faced by the 3. are the ways to evaluate the
decision maker choices faced by the decision
2. are the problems faced by the maker
decision maker 4. must be unique for the problem
5. In a multi criteria decision problem
1. it is impossible to select a single 3. successive decisions must be
decision alternative made over time
2. the decision maker must 4. each of the above is true
evaluate each alternative with
respect to each criterion
6. The quantitative analysis approach requires
1. the managers prior experience 3. mathematical expressions for
with similar problem the relationship
2. a relatively uncomplicated 4. each of the above is true
problem
7. Maximization or minimization of the quantity is the
1. a goal of management science 4. objective of linear
2. decision for decision analysis programming
3. constraint of operation research
Prof Rahul Ghosale [email protected]
Mo No-9665383478/7757034910
8. Decision variables
1. tells how much or how many of 2. represent the values of the
something to produce, invest, constraints
purchase ,hire 3. measure the objective function
4. must exist for each constraint
9. Which of the following is the valid objective function of LPP?
1. Maximize 5xy 3. Maximize 3xy+5xy
2. Minimize 4x+3y+3z 4. Minimize(x1+x2)/x3
12. Slack
1. is the difference between the left 3. is the amount by which the left
and right sides of the constraints side of the constraint is larger
2. is the amount by which the left than the right side
side of the constraint is 4. exists for each variable in a linear
smaller than the right side programming problem
13. To find the optimal solution to the LPP using the graphical method
1. find the feasible point that is the 3. find the feasible point that is
farthest away from the region closest to the origin
2. find the feasible point that is at 4. None of the alternative is
the highest location correct
14. Which of the following cases does not require reformulation of the problem in order
to obtain a solution?
1. Alternate optimality 4. Each case requires a
2. Infeasibility reformulation
3. Unsoundness
15. Whenever all constraints in the LPP are expressed as equalities, the linear program
is said to be written in
1. Standard form 3. Feasible form
2. Bounded form 4. Alternate form
Prof Rahul Ghosale [email protected]
Mo No-9665383478/7757034910
16. Problem solving encompasses
1. Identification of problem 3. Identification of problem and
2. Identification of problem and finding of objective function
the action to resolve it 4. All of above
28. …………………method solve the LPP in iteration to enhance the value of the
objective function
1. Complex 3. Corner point
2. Simplex 4. Iso profit
31. ……………is used to collect a set of experimental data and figure out to graph
1. LPP 3. Corner point model
2. Mathematical model 4. Operation research model
38. An assignment problem is a special form of transportation problem where all supply
and demand values equal
1. 0 3. 2
2. 1 4. 3
39. The transportation model relies on certain assumptions. They include all of the
following except
1. the items must be homogeneous 3. the shipping cost per unit is the
2. there is only one route being same
used between each origin and 4. the items must be large scale
destination 5. none of the above
40. Which of the following are supply points that a transportation model can analyze?
1. factories 3. departments
2. warehouses 4. all of the above
43. Before the analyst of the transportation model can begin, what data would they need
to collect?
1. A list of destinations 4. All of the above
2. Unit cost to ship 5. None of the above
3. A list of origins
49. 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 3. factor rating analysis
2. transportation model analysis 4. linear regression analysis
50. Except to be used to minimized the costs associated with distributing good,
transportation model can also be used in
1. production planning 4. comparison of location alternative
2. capacity planning 5. all of the above
3. transshipment problem
MCQs Part 2
3. Decision alternatives
a. Should be identified before c. Are evaluated as a part of the
decision criteria are established problem definition stage
b. Are limited to quantitative solutions d. Are best generated by brain storming
4. Decision Criteria
a. are the choices faced by the decision c. are the ways to evaluate the
maker choices faced by the decision maker
b. are the problems faced by the d. must be unique for the problem
decision maker
8. Decision variables
a. tells how much or how many of b. represent the values of the
something to produce, invest, constraints
purchase ,hire c. measure the objective function
d. must exist for each constraint
11. A solution that satisfies all the constraints of the LPP except the non-negativity
constraints is called
a. optimal c. infeasible
b. feasible d. semi-feasible
12. Slack
a. is the difference between the left and c. is the amount by which the left side of
right sides of the constraints the constraint is larger than the right
b. is the amount by which the left side
side of the constraint is smaller than d. exists for each variable in a linear
the right side programming problem
13. To find the optimal solution to the LPP using the graphical method
a. find the feasible point that is the c. find the feasible point that is closest to
farthest away from the region the origin
b. find the feasible point that is at the d. None of the alternative is correct
highest location
Prof Rahul Ghosale [email protected]
Mo No-9665383478/7757034910
14. Which of the following cases does not require reformulation of the problem in order
to obtain a solution?
a. Alternate optimality c. Unsoundness
b. Infeasibility d. Each case requires a reformulation
15. Whenever all constraints in the LPP are expressed as equalities, the linear program
is said to be written in
a. Standard form c. Feasible form
b. Bounded form d. Alternate form
19 A dummy job is an
a. Imaginary c. Rigid
b. Real d. Can’t say
31……………is used to collect a set of experimental data and figure out to graph
a. LPP c. Corner point model
b. Mathematical model d. Operation research model
Prof Rahul Ghosale [email protected]
Mo No-9665383478/7757034910
37. The linear programming model for a transportation problem has constraints for
supply at each ______ and _______ at each destination.
a. destination / source c. demand / source
b. source / destination d. source / demand
38. An assignment problem is a special form of transportation problem where all supply
and demand values equal
a. 0 c. 2
b. 1 d. 3
44. A physical model that does not have the same physical appearance as the object
being modeled is
a. an analog model. c. a mathematical model.
b. an iconic model. d. a qualitative model.
49. Which of the following special cases does not require reformulation of the
problem in order to obtain a solution?
a. alternate optimality c. unboundedness
b. infeasibility d. each case requires a reformulation.
51. 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. c. reduced cost.
b. surplus variable. d. upper limit.
53. In the simplex method, a tableau is optimal only if all the c j – zj values are
a. zero or negative. c. negative and nonzero.
b. zero. d. positive and nonzero.
58. The difference between the transportation and assignment problems is that
a. total supply must equal total demand c. each supply and demand value is 1
in the transportation problem in the assignment problem
b. the number of origins must equal the d. there are many differences between
number of destinations in the the transportation and assignment
transportation problem problems
64. The critical path is the __________ path through the network.
a. longest c. straightest
b. shortest d. none of the above
66. The transportation model relies on certain assumptions. They include all of the
following except
a. the items must be homogeneous c. the shipping cost per unit is the same
b. there is only one route being used d. the items must be large scale
between each origin and destination
67. Which of the following are supply points that a transportation model can analyze?
a. Factories c. departments
b. warehouses d. all of the above
70. Before the analyst of the transportation model can begin, what data would they need
to collect?
a. A list of destinations c. A list of origins
b. Unit cost to ship d. All of the above
76. 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 d. linear regression analysis
b. transportation model analysis e. MODI analysis
c. factor rating analysis
77. Except to be used to minimized the costs associated with distributing good,
transportation model can also be used in
a. production planning d. comparison of location alternative
b. capacity planning e. all of the above
c. transshipment problem
Prof Rahul Ghosale [email protected]
Mo No-9665383478/7757034910