MCQs Part 1

1. The field of management science

1. Concentrates on the on the use of quantitative methods to assists in decision making

2. Approaches decision making with techniques based on the scientific method
3. is another name for decision science and for operation research
4. each of the above is true

2. Identification and definition of a problem

1. Can not be done until alternatives are proposed

2. Is the first step of decision making
3. Is the final step of problem solving
4. Requires consideration of multiple criteria

3. Decision alternatives

1. Should be identified before decision criteria are established

2. Are limited to quantitative solutions
3. Are evaluated as a part of the problem definition stage
4. Are best generated by brain storming

4. Decision Criteria

1. are the choices faced by the decision maker

2. are the problems faced by the decision maker
3. are the ways to evaluate the choices faced by the decision maker
4. must be unique for the problem

5. In a multi criteria decision problem

1. it is impossible to select a single decision alternative

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

6. The quantitative analysis approach requires

1. the managers prior experience with similar problem

2. a relatively uncomplicated problem
3. mathematical expressions for the relationship
4. each of the above is true

7. maximization or minimization of the quantity is the

1. a goal of management science

2. decision for decision analysis
3. constraint of operation research
4. objective of linear programming

8. Decision variables

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

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

1. Maximize 5xy
2. Minimize 4x+3y+3z
3. Maximize 3xy+5xy
4. Minimize(x1+x2)/x3

10. Which of the following statement is not true?

1. feasible solution satisfies all the constraints

2. an optimal solution satisfies all the constraints
3. an infeasible solution violates all constraints
4. a feasible solution point does not 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
2. feasible
3. infeasible
4. semi-feasible

12. 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

13. 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

14. 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

15. 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
16. Problem solving encompasses

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

17. Long form of LPP is

1. Linear programming problem

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

18. Assignment model can be applied in

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

19. A dummy job is an

1. Imaginary
2. Real
3. Rigid
4. Cant say

20. In transportation problem following are always transported

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

21. Initial basic solution from VAM IS

1. Least
2. Maximum
3. Cant say
4. None of above

22. Demand variation occurs because of change in

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

23. Following represents the aim or goal of the system

1. Decision variable
2. Objective function
3. Constraints
4. None of above
24. In real life supply & demand requirement will be rarely

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

25. Lpp is widely used modelling technique

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

26. LP Consists of linear objectives &.

1. Linear variables
2. Linear constraints
3. Linear functions
4. None of above

27. . represents the aim of the system.

1. Constraints
2. Decision variable
3. Objective functions
4. Cannt say

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

1. Complex
2. Simplex
3. Corner point
4. Iso profit

29. .is special type of linear programming

1. Transportation problem
2. Assignment
3. Cannt say
4. Queuing

30. model helps to manager to take decision

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

31. 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
32. Initial basic solution can be obtained by modified distribution method

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

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

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

34. . Method is more accurate

1. North west corner

2. Least cost
3. VAM
4. None of above

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

1. all constraints are equalities

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

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

1. at a maximum cost
2. at a minimum cost
3. at a minimum profit
4. at a minimum revenue

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

1. maximum-flow
2. transportation
3. shortest-route
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
2. 1
3. 2
4. 3

39. The transportation model relies on certain assumptions. They include all of the following except

1. the items must be homogeneous

2. there is only one route being used between each origin and destination
3. the shipping cost per unit is the same
4. the items must be large scale
40Which 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

41. The basis for the transportation model is

1. a way to provide a map for people to see results

2. a method to arrive at the lowest total shipping cost
3. so delivery drivers know where to go
4. a form of accounting
5. to provide data for use in other areas

42. The following transportation model is a programming model:

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

43. 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
5. None of the above

44. What does the transportation problem involve finding:

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

45. Transportation problems be solved

1. manually
2. with a table
3. with excel
4. with software packages
5. all of the above

46. The objective function of the transportation model is to

1. reduce shipping costs

2. decrease shipping distance
3. maximize costs
4. minimize costs
47. Goods are not sent from

1. warehouses
2. factories
3. grocery stores
4. department stores
5. goods are sent from all of these locations

48. Goods are received at all of the following except

1. docks
2. departments
3. factories
4. warehouses
5. all of the above

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
2. transportation model analysis
3. factor rating analysis
4. linear regression analysis
5. MODI analysis

50. Except to be used to minimized the costs associated with distributing good, transportation model can
also be used in

1. production planning
2. capacity planning
3. transshipment problem
4. comparison of location alternative
5. all of the above

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

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

52. Destination points are

1. points that receive goods from factories, warehouses, and departments

2. points where goods are sent from factories, warehouses, and departments
3. supply points
4. selling points
5. none of the above
53. Transportation problems can be solved manually in a straightforward manner except for

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

MCQs Part 2

1. The field of management science

a. Concentrates on the on the use of quantitative methods to assists in decision making
b. Approaches decision making with techniques based on the scientific method
c. is another name for decision science and for operation research
d. each of the above is true

2. Identification and definition of a problem

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

3. 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

4. Decision Criteria
a. are the choices faced by the decision maker
b. are the problems faced by the decision maker
c. are the ways to evaluate the choices faced by the decision maker
d. must be unique for the problem

5. In a multi criteria decision problem

a. it is impossible to select a single decision alternative
b. the decision maker must evaluate each alternative with respect to each criterion
c. successive decisions must be made over time
d. each of the above is true
6. The quantitative analysis approach requires
a. the managers prior experience with similar problem
b. a relatively uncomplicated problem
c. mathematical expressions for the relationship
d. each of the above is true

7. Maximization or minimization of the quantity is the

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

8. Decision variables
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

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

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

10. Which of the following statement is not true?

a. feasible solution satisfies all the constraints
b. an optimal solution satisfies all the constraints
c. an infeasible solution violates all constraints
d. a feasible solution point does not 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
b. feasible
c. infeasible
d. semi-feasible
12. 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

13. 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

14. 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

15. 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

16. Problem solving encompasses

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

17. Long form of LPP is

a. Linear programming problem
b. Linear Problem parameters
c. Linear programming parameters
d. None of above
18. Assignment model can be applied in
a. Decision making
b. Problem solving
c. Manufacturing Industry
d. Only in service sector

19 A dummy job is an
a. Imaginary
b. Real
c. Rigid
d. Cant say

20. In transportation problem following are always transported

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

21. Initial basic solution from VAM IS

a. Least
b. Maximum
c. Cant say
d. None of above

22. Demand variation occurs because of change in

a. Customer preference
b. Competitors entry
c. Market condition
d. None of above

23. Following represents the aim or goal of the system

a. Decision variable
b. Objective function
c. Constraints
d. None of above
24. In real life supply & demand requirement will be rarely
a. Equal
b. Unequal
c. Stable
d. None of above

25. LPP is widely used modeling technique

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

26. LPP Consists of linear objectives &.

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

27. represents the aim of the system.

a. Constraints
b. Decision variable
c. Objective functions
d. Cant say

28.method solve the LPP in iteration to enhance the value of the objective function
a. Complex
b. Simplex
c. Corner point
d. none of above

29.is special type of linear programming

a. Transportation problem
b. Assignment
c. Cant say
d. Queuing
30 model helps to manager to take decision
a. Transportation
b. Assignment
c. LPP
d. All above

31is used to collect a set of experimental data and figure out to graph
a. LPP
b. Mathematical model
c. Corner point model
d. Operation research model

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

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

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

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

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

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

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

a. at a maximum cost
b. at a minimum cost
c. at a minimum profit
d. at minimum revenue
36. The assignment model is a special case of the ________ model.
a. maximum-flow
b. transportation
c. shortest-routed
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
b. source / destination
c. demand / source
d. source / demand

38. An assignment problem is a special form of transportation problem where all supply and demand
values equal
a. 0
b. 1
c. 2
d. 3

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

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

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

a. True
b. False
c. Cannot say
d. Data is not sufficient
e. None of above

41. The field of management science

a. concentrates on the use of quantitative methods to assist in decision making.
b. approaches decision making rationally, with techniques based on the scientific method.
c. is another name for decision science and for operations research.
d. each of the above is true.

42. Identification and definition of a problem

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

43. The quantitative analysis approach requires

a. the managers prior experience with a similar problem.
b. a relatively uncomplicated problem.
c. mathematical expressions for the relationships.
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.
b. an iconic model.
c. a mathematical model.
d. a qualitative model.

45. Management science and operations research both involve

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

46. George Dantzig is important in the history of management science because he developed
a. the scientific management revolution.
b. World War II operations research teams.
c. the simplex method for linear programming.
d. powerful digital computers.

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

a. mathematical.
b. iconic.
c. analog.
d. constrained.
48. 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.

49. 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.

50. The range of feasibility measures

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

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.
b. surplus variable.
c. reduced cost.
d. upper limit.

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

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

53. 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.

54. For the basic feasible solution to remain optimal

a. all cj - zj values must remain 0.
b. no objective function coefficients are allowed to change.
c. the value of the objective function must not change.
d. each of the above is true.

55. The dual variable represents

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

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

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

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

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

58. The difference between the transportation and assignment problems is that
a. total supply must equal total demand in the transportation problem
b. the number of origins must equal the number of destinations in the transportation problem
c. each supply and demand value is 1 in the assignment problem
d. there are many differences between the transportation and assignment problems

59. In an assignment problem,

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

60. Arcs in a transshipment problem

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

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

a. converting all profits to opportunity losses.
b. a dummy agent or task.
c. matrix expansion.
d. finding the maximum number of lines to cover all the zeros in the reduced matrix.

62. The critical path

a. is any path that goes from the starting node to the completion node.
b. is a combination of all paths.
c. is the shortest path.
d. is the longest path.

63. When activity times are uncertain,

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

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

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

a. lowest path through the network
b. highest path through the network
c. shortest 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
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
e. none of the above

67. 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

68. The basis for the transportation model is

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

69. The following transportation model is a programming model:

a. analytical
b. non-linear
c. linear
d. rotating
e. variable

70. 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

71. What does the transportation problem involve finding:

a. highest cost-plan
b. lowest cost-plan
c. closest destinations
d. farthest destinations
e. none if the above

72. Transportation problems be solved

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

73. The objective function of the transportation model is to

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

74. Goods are not sent from

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

75. Goods are received at all of the following except

a. docks
b. departments
c. factories
d. warehouses
e. 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
b. transportation model analysis
c. factor rating analysis
d. linear regression analysis
e. MODI analysis

77. Except to be used to minimized the costs associated with distributing good, transportation model can
also be used in
a. production planning
b. capacity planning
c. transshipment problem
d. comparison of location alternative
e. all of the above

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

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

79. Destination points are

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

80. Transportation problems can be solved manually in a straightforward manner except for
a. medium problems
b. very small, but time consuming problems
c. large problems
d. all of the above
e. none of the above

81. The transportation model is a

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

82. The transportation model is used to determine

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

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

a. The items to be shipped are heterogeneous.
b. Shipping cost per unit is the different regardless of the number of units shipped.
c. There is more than one route or mode of transportation being used between each origin and each
destination.
d. The items to be shipped are the same regardless of their source or destination.
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 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

85. The transportation model is a linear __ model.

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