ch3
1. When formulating a linear programming model on a spreadsheet, the decisions to be made are located in
the data cells.
True False
2. When formulating a linear programming model on a spreadsheet, the constraints are located (in part) in
the output cells.
True False
3. When formulating a linear programming model on a spreadsheet, the measure of performance is located
in the target cell.
True False
4. A mathematical model will be an exact representation of the real problem.
True False
5. Approximations and simplifying assumptions generally are required to have a workable model.
True False
6. Linear programming does not permit fractional solutions.
True False
7. When formulating a linear programming problem on a spreadsheet, data cells will show the levels of
activities for the decisions being made.
True False
8. A key assumption of linear programming is that the equation for each of the output cells, including the
target cell, can be expressed as a SUMPRODUCT (or SUM) function.
True False
9. Resource-allocation problems are linear programming problems involving the allocation of limited
resources to activities.
True False
10. Strict inequalities (i.e., < or >) are not permitted in linear programming formulations.
True False
11. When studying a resource-allocation problem, it is necessary to determine the contribution per unit of
each activity to the overall measure of performance.
True False
12. It is usually quite simple to obtain estimates of parameters in a linear programming problem.
True False
13. The target cell is a special kind of output cell.
True False
14. Financial planning is one of the most important areas of application for cost-benefit-tradeoff
problems.
True False
15. A resource constraint refers to any functional constraint with a ≥ sign in a linear programming model.
True False
16. In the algebraic form of a resource constraint, the coefficient of each decision variable is the resource
usage per unit of the corresponding activity.
True False
This study source was downloaded by 100000840946462 from CourseHero.com on 02-15-2022 20:58:49 GMT -06:00
https://www.coursehero.com/file/10446463/ch3/
, 17. Cost-benefit-tradeoff problems are linear programming problems involving the allocation of limited
resources to activities.
True False
18. For cost-benefit-tradeoff problems, minimum acceptable levels for each kind of benefit are prescribed
and the objective is to achieve all these benefits with minimum cost.
True False
19. A benefit constraint refers to a functional constraint with a ≥ sign in a linear programming model.
True False
20. In most cases, the minimum acceptable level for a cost-benefit-tradeoff problem is set by how much
money is available.
True False
21. It is the nature of the application that determines the classification of the resulting linear programming
formulation.
True False
22. It is the nature of the restrictions imposed on the decisions regarding the mix of activity levels that
determines the classification of the resulting linear programming formulation.
True False
23. It is fairly common to have both resource constraints and benefit constraints in the same formulation.
True False
24. Choosing the best tradeoff between cost and benefits is a managerial judgement decision.
True False
25. Having one requirement for each location is a characteristic common to all transportation problems.
True False
26. Fixed-requirement constraints in a linear programming model are functional constraints that use an equal
sign.
True False
27. The capacity row in a distribution-network formulation shows the maximum number of units than can be
shipped through the network.
True False
28. Once a linear programming problem has been formulated, it is rare to make major adjustments to it.
True False
29. A mixed linear programming problem will always contain some of each of the three types of constraints
in it.
True False
30. Blending problems are a special type of mixed linear programming problems.
True False
31. Model formulation should precede problem formulation.
True False
32. When dealing with huge real problems, there is no such thing as the perfectly correct linear programming
model for the problem.
True False
33. Transportation problems are concerned with distributing commodities from sources to destinations in
such a way as to minimize the total distribution cost.
True False
This study source was downloaded by 100000840946462 from CourseHero.com on 02-15-2022 20:58:49 GMT -06:00
https://www.coursehero.com/file/10446463/ch3/
1. When formulating a linear programming model on a spreadsheet, the decisions to be made are located in
the data cells.
True False
2. When formulating a linear programming model on a spreadsheet, the constraints are located (in part) in
the output cells.
True False
3. When formulating a linear programming model on a spreadsheet, the measure of performance is located
in the target cell.
True False
4. A mathematical model will be an exact representation of the real problem.
True False
5. Approximations and simplifying assumptions generally are required to have a workable model.
True False
6. Linear programming does not permit fractional solutions.
True False
7. When formulating a linear programming problem on a spreadsheet, data cells will show the levels of
activities for the decisions being made.
True False
8. A key assumption of linear programming is that the equation for each of the output cells, including the
target cell, can be expressed as a SUMPRODUCT (or SUM) function.
True False
9. Resource-allocation problems are linear programming problems involving the allocation of limited
resources to activities.
True False
10. Strict inequalities (i.e., < or >) are not permitted in linear programming formulations.
True False
11. When studying a resource-allocation problem, it is necessary to determine the contribution per unit of
each activity to the overall measure of performance.
True False
12. It is usually quite simple to obtain estimates of parameters in a linear programming problem.
True False
13. The target cell is a special kind of output cell.
True False
14. Financial planning is one of the most important areas of application for cost-benefit-tradeoff
problems.
True False
15. A resource constraint refers to any functional constraint with a ≥ sign in a linear programming model.
True False
16. In the algebraic form of a resource constraint, the coefficient of each decision variable is the resource
usage per unit of the corresponding activity.
True False
This study source was downloaded by 100000840946462 from CourseHero.com on 02-15-2022 20:58:49 GMT -06:00
https://www.coursehero.com/file/10446463/ch3/
, 17. Cost-benefit-tradeoff problems are linear programming problems involving the allocation of limited
resources to activities.
True False
18. For cost-benefit-tradeoff problems, minimum acceptable levels for each kind of benefit are prescribed
and the objective is to achieve all these benefits with minimum cost.
True False
19. A benefit constraint refers to a functional constraint with a ≥ sign in a linear programming model.
True False
20. In most cases, the minimum acceptable level for a cost-benefit-tradeoff problem is set by how much
money is available.
True False
21. It is the nature of the application that determines the classification of the resulting linear programming
formulation.
True False
22. It is the nature of the restrictions imposed on the decisions regarding the mix of activity levels that
determines the classification of the resulting linear programming formulation.
True False
23. It is fairly common to have both resource constraints and benefit constraints in the same formulation.
True False
24. Choosing the best tradeoff between cost and benefits is a managerial judgement decision.
True False
25. Having one requirement for each location is a characteristic common to all transportation problems.
True False
26. Fixed-requirement constraints in a linear programming model are functional constraints that use an equal
sign.
True False
27. The capacity row in a distribution-network formulation shows the maximum number of units than can be
shipped through the network.
True False
28. Once a linear programming problem has been formulated, it is rare to make major adjustments to it.
True False
29. A mixed linear programming problem will always contain some of each of the three types of constraints
in it.
True False
30. Blending problems are a special type of mixed linear programming problems.
True False
31. Model formulation should precede problem formulation.
True False
32. When dealing with huge real problems, there is no such thing as the perfectly correct linear programming
model for the problem.
True False
33. Transportation problems are concerned with distributing commodities from sources to destinations in
such a way as to minimize the total distribution cost.
True False
This study source was downloaded by 100000840946462 from CourseHero.com on 02-15-2022 20:58:49 GMT -06:00
https://www.coursehero.com/file/10446463/ch3/
