Вы находитесь на странице: 1из 18

Prof Rahul Ghosale Email-rahulghosale@yahoo.

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-rahulghosale@yahoo.com
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

10. Which of the following statement is not true?


1. feasible solution satisfies all the 3. an infeasible solution violates
constraints all constraints
2. an optimal solution satisfies all 4. a feasible solution point does not
the constraints have to lie on the boundary of the
feasible region
11. A solution that satisfies all the constraints of the LPP except the non negativity
constraints is called
1. optimal 3. infeasible
2. feasible 4. semi-feasible

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-rahulghosale@yahoo.com
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

17. Long form of LPP is


1. Linear programming problem 3. Linear programming parameters
2. Linear Problem parameters 4. None of above

18. Assignment model can be applied in


1. Decision making 3. Manufacturing Industry
2. Problem solving 4. Only in service sector

19. A dummy job is an


1. Imaginary 3. Rigid
2. Real 4. Can’t say

20. In transportation problem following are always transported


1. Consignments 3. Demand
2. Goods 4. Supply

21. Initial basic solution from VAM IS


1. Least 3. Can’t say
2. Maximum 4. None of above

22. Demand variation occurs because of change in


1. Customer preference 3. Market condition
2. Competitors entry 4. None of above

23. Following represents the aim or goal of the system


1. Decision variable 3. Constraints
2. Objective function 4. None of above

24. In real life supply & demand requirement will be rarely


1. Equal 3. Stable
2. Unequal 4. None of above

25. Lpp is widely used ………………modelling technique


1. Mathematical 3. Graphical
2. Statistical 4. None of above

26. LP Consists of linear objectives &……………….


1. Linear variables 3. Linear functions
2. Linear constraints 4. None of above
Prof Rahul Ghosale Email-rahulghosale@yahoo.com
Mo No-9665383478/7757034910

27. .………………… represent the aim of the system.


1. Constraints 3. Objective functions
2. Decision variable 4. Cann’t say

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

29. …………….is special type of linear programming


1. Transportation problem 3. Can’t say
2. Assignment 4. Queuing

30. …………… model helps to manager to take decision


1. Transportation 3. LPP
2. Assignment 4. All above

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

32. Initial basic solution can be obtained by modified distribution method


1. True 3. Cannot say
2. False 4. Data is not sufficient

33. Least cost method is a best method to find basic solution


1. True 3. Cannot say
2. False 4. Data is not sufficient

34. …………. Method is more accurate


1. North west corner 3. VAM
2. Least cost 4. None of above

35. In a balanced transportation model where supply equals demand,


1. all constraints are equalities 3. all constraints are inequalities
2. none of the constraints are 4. none of the constraints are
equalities inequalities

36. In a transportation problem, items are allocated from sources to destinations


1. at a maximum cost 3. at a minimum profit
2. at a minimum cost 4. at a minimum revenue
Prof Rahul Ghosale Email-rahulghosale@yahoo.com
Mo No-9665383478/7757034910
37. The assignment model is a special case of the ________ model.
1. maximum-flow 3. shortest-route
2. transportation 4. none of the above

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

41. The basis for the transportation model is


1. a way to provide a map for 3. so delivery drivers know where to
people to see results go
2. a method to arrive at the 4. a form of accounting
lowest total shipping cost

42. The following transportation model is a programming model:


1. analytical 4. rotating
2. non-linear 5. variable
3. linear

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

44. What does the transportation problem involve finding:


1. highest cost-plan 4. farthest destinations
2. lowest cost-plan 5. none if the above
3. closest destinations

45. Transportation problems be solved


1. manually 4. with software packages
2. with a table 5. all of the above
3. with excel
Prof Rahul Ghosale Email-rahulghosale@yahoo.com
Mo No-9665383478/7757034910
46. The objective function of the transportation model is to
1. reduce shipping costs 3. maximize costs
2. decrease shipping distance 4. minimize costs

47. Goods are not sent from


1. warehouses 3. grocery stores
2. factories 4. department stores

48. Goods are received at all of the following except


1. docks 3. factories
2. departments 4. warehouses

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

51. Which one of the following is a linear programming model ?


1. Cost-volume analysis 3. Factor rating analysis
2. Transportation model analysis 4. Linear regression analysis

52. Destination points are


1. points that receive goods from 2. points where goods are sent from
factories, warehouses, and factories, warehouses, and
departments departments
3. supply points
4. selling points

53. Transportation problems can be solved manually in a straightforward manner except


for
1. medium problems 3. large problems
2. very small, but time consuming 4. all of the above
problems 5. none of the above

MCQs Part 2

1. The field of management science


Prof Rahul Ghosale Email-rahulghosale@yahoo.com
Mo No-9665383478/7757034910
a. Concentrates on the on the use of c. is another name for decision science
quantitative methods to assists in and for operation research
decision making d. each of the above is true
b. Approaches decision making with
techniques based on the scientific
method

2. Identification and definition of a problem


a. Cannot be done until alternatives are c. Is the final step of problem solving
proposed
d. Requires consideration of multiple
b. Is the first step of decision making criteria

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

5. In a multi criteria decision problem


a. it is impossible to select a single c. successive decisions must be made
decision alternative over time
b. the decision maker must evaluate d. each of the above is true
each alternative with respect to each
criterion

6. The quantitative analysis approach requires


a. the managers prior experience with c. mathematical expressions for the
similar problem relationship
b. a relatively uncomplicated problem d. each of the above is true
Prof Rahul Ghosale Email-rahulghosale@yahoo.com
Mo No-9665383478/7757034910

7. Maximization or minimization of the quantity is the


a. a goal of management science c. constraint of operation research
b. decision for decision analysis d. objective of linear programming

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

9. Which of the following is the valid objective function of LPP?


a. Maximize 5xy c. Maximize 3xy+5xy
b. Minimize 4x+3y+3z d. Minimize(x1+x2)/x3

10. Which of the following statement is not true?


a. feasible solution satisfies all the c. an infeasible solution violates all
constraints constraints
b. an optimal solution satisfies all the d. a feasible solution point does not
constraints have to lie on the boundary of the
feasible region

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-rahulghosale@yahoo.com
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

16. Problem solving encompasses


a. Identification of problem c. Identification of problem and finding of
b. Identification of problem and the objective function
action to resolve it d. All of above

17. Long form of LPP is


a. Linear programming problem c. Linear programming parameters
b. Linear Problem parameters d. None of above

18. Assignment model can be applied in


a. Decision making c. Manufacturing Industry
b. Problem solving d. Only in service sector

19 A dummy job is an
a. Imaginary c. Rigid
b. Real d. Can’t say

20. In transportation problem following are always transported


a. Consignments c. Demand
b. Goods d. Supply

21. Initial basic solution from VAM IS


a. Least c. Can’t say
b. Maximum d. None of above

22. Demand variation occurs because of change in


a. Customer preference c. Market condition
b. Competitors entry d. None of above
Prof Rahul Ghosale Email-rahulghosale@yahoo.com
Mo No-9665383478/7757034910

23. Following represents the aim or goal of the system


a. Decision variable c. Constraints
b. Objective function d. None of above

24. In real life supply & demand requirement will be rarely


a. Equal c. Stable
b. Unequal d. None of above

25. LPP is widely used ………………modeling technique


a. Mathematical c. Graphical
b. Statistical d. None of above

26. LPP Consists of linear objectives &……………….


a. Linear variables c. Linear functions
b. Linear constraints d. None of above

27.………………… represents the aim of the system.


a. Constraints c. Objective functions
b. Decision variable d. Can’t say

28.…………………method solve the LPP in iteration to enhance the value of the


objective function
a. Complex c. Corner point
b. Simplex d. none of above

29…………….is special type of linear programming


a. Transportation problem c. Can’t say
b. Assignment d. Queuing

30…………… model helps to manager to take decision


a. Transportation c. LPP
b. Assignment d. All above

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-rahulghosale@yahoo.com
Mo No-9665383478/7757034910

32. Initial basic solution can be obtained by modified distribution method


a. True c. Cannot say
b. False d. Data is not sufficient

33. Least cost method is a best method to find basic solution


a. True c. Cannot say
b. False d. Data is not sufficient

34. In a balanced transportation model where supply equals demand,


a. all constraints are equalities d. none of the constraints are
b. none of the constraints are equalities inequalities
c. all constraints are inequalities

35. In a transportation problem, items are allocated from sources to destinations


a. at a maximum cost c. at a minimum profit
b. at a minimum cost d. at minimum revenue

36. The assignment model is a special case of the ________ model.


a. maximum-flow c. shortest-routed.
b. transportation d. none of the above

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

39. Initial basic solution can be obtained by modified distribution method


a. True c. Cannot say
b. False d. Data is not sufficient

40. Least cost method is a best method to find basic solution


a. True c. Cannot say
b. False d. Data is not sufficient
Prof Rahul Ghosale Email-rahulghosale@yahoo.com
Mo No-9665383478/7757034910
41. The field of management science
a. concentrates on the use of c. is another name for decision science
quantitative methods to assist in and for operations research.
decision making. d. each of the above is true.
b. approaches decision making
rationally, with techniques based on the
scientific method.

42. Identification and definition of a problem


a. cannot be done until alternatives are c. is the final step of problem solving.
proposed.
d. requires consideration of multiple
b. is the first step of decision making. criteria.

43. The quantitative analysis approach requires


a. the manager’s prior experience with a c. mathematical expressions for the
similar problem. relationships.
b. a relatively uncomplicated problem. d. each of the above is true.

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.

45.Management science and operations research both involve


a. qualitative managerial skills. c. operational management skills.
b. quantitative approaches to d. scientific research as opposed to
decision making. applications.

46. George Dantzig is important in the history of management science because he


developed
a. the scientific management revolution. c. the simplex method for linear
b. World War II operations research programming.
teams. d. powerful digital computers.

47 .A model that uses a system of symbols to represent a problem is called


a. mathematical. c. analog.
b. iconic. d. constrained.
Prof Rahul Ghosale Email-rahulghosale@yahoo.com
Mo No-9665383478/7757034910
48. Slack
a. is the difference between the left and c. is the amount by which the left side of
right sides of a constraint. a > constraint is larger than the right
b. is the amount by which the left side.
side of a < constraint is smaller than d. exists for each variable in a linear
the right side. programming problem.

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.

50. The range of feasibility measures


a. the right-hand-side values for which c. the right-hand-side values for
the objective function value will not which the dual prices will not change.
change. d. each of the above is true.
b. the right-hand-side values for which
the values of the decision variables will
not change.

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.

52. The values in the cj - zj , or net evaluation, row indicate


a. the value of the objective function. c. the net change in the value of the
b. the decrease in value of the objective objective function that will result if
function that will result if one unit of the one unit of the variable corresponding
variable corresponding to the jth column to the jth column of the A matrix is
of the A matrix is brought into the basis. brought into the basis.
d. the values of the decision variables.

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.

54. For the basic feasible solution to remain optimal


a. all cj - zj values must remain £ 0. c. the value of the objective function
b. no objective function coefficients are must not change.
allowed to change. d. each of the above is true.
Prof Rahul Ghosale Email-rahulghosale@yahoo.com
Mo No-9665383478/7757034910

55. The dual variable represents


a. the marginal value of the c. the artificial variable
constraint d. the technical coefficient of the
b. the right-hand-side value of the constraint
constraint

56. The parts of a network that represent the origins are


a. the axes c. the nodes
b. the flow d. the arrows

57. The number of units shipped from origin i to destination j is represented by


a. xij. c. cij.
b. xji. d. cji.

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

59. In an assignment problem,


a. one agent can do parts of several c. each agent is assigned to its own best
tasks. task.
b. one task can be done by several d. None of the alternatives is correct.
agents.

60. Arcs in a transshipment problem


a. must connect every node to a c. indicate the direction of the flow.
transshipment node. d. All of the alternatives are correct
b. represent the cost of shipments.

61. To use the Hungarian method, a profit-maximization assignment problem requires


a. converting all profits to d. finding the maximum number of lines
opportunity losses. to cover all the zeros in the reduced
b. a dummy agent or task. matrix.
c. matrix expansion.
Prof Rahul Ghosale Email-rahulghosale@yahoo.com
Mo No-9665383478/7757034910
62. The critical path
a. is any path that goes from the starting c. is the shortest path.
node to the completion node. d. is the longest path.
b. is a combination of all paths.

63. When activity times are uncertain,


a. assume they are normally distributed. c. use the most likely time.
b. calculate the expected time, using d. calculate the expected time, using (a
(a + 4m + b)/6. + m + b)/3.

64. The critical path is the __________ path through the network.
a. longest c. straightest
b. shortest d. none of the above

65. In a CPM/PERT network the critical path is the


a. lowest path through the network c. shortest path through the network
b. highest path through the network d. longest path through the network

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

68. The basis for the transportation model is


a. a way to provide a map for people to total shipping cost
see results c. so delivery drivers know where to go
b. a method to arrive at the lowest d. a form of accounting

69. The following transportation model is b. non-linear


a programming model: c. linear
a. analytical d. rotating
Prof Rahul Ghosale Email-rahulghosale@yahoo.com
Mo No-9665383478/7757034910

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

71. What does the transportation problem involve finding:


a. highest cost-plan c. closest destinations
b. lowest cost-plan d. farthest destinations

72. Transportation problems be solved


a. manually d. with software packages
b. with a table e. all of the above
c. with excel

73. The objective function of the transportation model is to


a. reduce shipping costs d. minimize costs
b. decrease shipping distance e. none of the above
c. maximize costs

74. Goods are not sent from


a. warehouses d. department stores
b. factories e. goods are sent from all of these
c. grocery stores locations

75. Goods are received at all of the following except


a. docks d. warehouses
b. departments e. all of the above
c. factories

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-rahulghosale@yahoo.com
Mo No-9665383478/7757034910

78. Which one of the following is a linear programming model ?


a. Cost-volume analysis d. linear regression analysis
b. Transportation model analysis e. MODI analysis
c. Factor rating analysis

79. Destination points are


a. points that receive goods from factories, warehouses, and departments
factories, warehouses, and c. supply points
departments d. selling points
b. points where goods are sent from e. none of the above

80. Transportation problems can be solved manually in a straightforward manner except


for
a. medium problems c. large problems
b. very small, but time consuming d. all of the above
problems e. none of the above

81. The transportation model is a


a. linear model d. both a and c
b. quadratic model e. none of the above
c. model with two variables

82. The transportation model is used to determine


a. what type of transportation to use destinations to minimize total
(boat, truck, train or plane) to transport shipping costs
goods, while minimizing costs d. how to best package goods so that
b. what day of the week goods should they wouldn't break while transporting
be transportation on to minimize costs them
c. how to distribute goods from e. none of the above
multiple origins to multiple

83. What assumption is used in the transportation model?:


a. The items to be shipped are of transportation being used between
heterogeneous. each origin and each destination.
b. Shipping cost per unit is the different d. The items to be shipped are the
regardless of the number of units same regardless of their source or
shipped. destination.
c. There is more than one route or mode e. None of the above

84. Which of the following is needed for a transportation model?


a. A list of origins and each one's c. The unit cost of shipping items from
capacity or supply quantity per period each origin to each destination
b. A list of destinations and each one's d. All of the above
demand per period e. Only A and B
Prof Rahul Ghosale Email-rahulghosale@yahoo.com
Mo No-9665383478/7757034910

85. The transportation model is a linear __ model.


a. Solution d. Shipping
b. Programming e. Distribution
c. Data

Оценить