Professional Documents
Culture Documents
3. Decision alternatives
4. Decision Criteria
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
1. Maximize 5xy
2. Minimize 4x+3y+3z
3. Maximize 3xy+5xy
4. Minimize(x1+x2)/x3
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
1. Decision making
2. Problem solving
3. Manufacturing Industry
4. Only in service sector
1. Imaginary
2. Real
3. Rigid
4. Cant say
1. Consignments
2. Goods
3. Demand
4. Supply
1. Least
2. Maximum
3. Cant 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
24. In real life supply & demand requirement will be rarely
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. 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
1. Transportation problem
2. Assignment
3. Cannt say
4. Queuing
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
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
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. 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
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
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
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
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
MCQs Part 2
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
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
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
19 A dummy job is an
a. Imaginary
b. Real
c. Rigid
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
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
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
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.
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.
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.
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.
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.
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
64. The critical path is the __________ path through the network.
a. longest
b. shortest
c. straightest
d. 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
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
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
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