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/
34. Transportation problems always involve shipping goods from one location to another. True False 35. The requirements assumption states that each source has a fixed supply of units, where the entire supply must be distributed to the destinations and that each destination has a fixed demand for units, where the entire demand must be received from the sources. True False 36. A transportation problem requires a unit cost for every source-destination combination. True False 37. An assignment problem is a special type of transportation problem. True False 38. Generally, assignment problems match people to an equal number of tasks at a minimum cost. True False 39. Which of the following are categories of linear programming problems? A. Resource-allocation problems. B. Cost-benefit-tradeoff problems. C. Distribution-network problems. D. All of these. E. None of these. 40. A linear programming model contains which of the following components? A. Data. B. Decisions. C. Constraints. D. Measure of performance. E. All of these. 41. In linear programming formulations, it is possible to have the following types of constraints: A. ≤. B. >. C. =. D. a and c only. E. All of these. 42. Resource-allocation problems have the following type of constraints: A. ≥. B. ≤. C. =. D. <. E. None of these. 43. When formulating a linear programming problem on a spreadsheet, which of the following is true? A. Parameters are called data cells. B. Decision variables are called changing cells. C. Right hand sides are part of the constraints. D. The objective function is called the target cell. E. All of these.
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/
44. Where are data cells located? A. B2:D2. B. B2:D2, B4:D7, and G5:G7. C. B10:D10. D. E5:E7. E. G10. 45. Where are the changing cells located? A. B2:D2. B. B2:D2, B4:D7, and G5:G7. C. B10:D10. D. E5:E7. E. G10. 46. Where is the target cell located? A. B2:D2. B. B2:D2, B4:D7, and G5:G7. C. B10:D10. D. E5:E7. E. G10. 47. Where are the output cells located? A. B2:D2. B. B2:D2, B4:D7, and G5:G7. C. B10:D10. D. E5:E7. E. G10. 48. Cost-benefit tradeoff problems have the following type of constraints: A. ≥. B. ≤. C. =. D. <. E. None of these. 49. Transportation problems have the following type of constraints: A. ≥. B. ≤. C. =. D. <. E. None of these. 50. Mixed problems may have the following type of constraints: A. ≥. B. ≤. C. =. D. All of these. E. None of these. 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/
51. A linear programming problem where the objective is to find the best mix of ingredients for a product to meet certain specifications is called: A. a resource-allocation problem. B. a blending problem. C. a cost-benefit tradeoff problem. D. a mixture problem. E. None of these. 52. Using techniques to test the initial versions of a model to identify errors and omissions is called: A. model validation. B. model enrichment. C. model enhancement. D. model debugging. E. None of these. 53. Starting with a simple version of a model and adding to it until it reflects the real problem is called: A. model validation. B. model enrichment. C. model enhancement. D. model elaboration. E. None of these. 54. The transportation model method for evaluating location alternatives minimizes: A. the number of sources. B. the number of destinations. C. total supply. D. total demand. E. total shipping cost. 55. Which of the following is not information needed to use the transportation model? A. Capacity of the sources. B. Demand of the destinations. C. Unit shipping costs. D. Unit shipping distances. E. All of these. 56. When formulating a transportation problem on a spreadsheet, which of the following are necessary? A. A table of data. B. A network representation. C. A table for the solution. D. a and c only. E. All of these. 57. An assignment problem: A. is a special transportation problem. B. will always have an integer solution. C. has all supplies and demands equal to 1. D. None of these. E. All of these. 58. Applications of assignment problems may include: A. matching personnel to jobs. B. assigning machines to tasks. C. designing bussing routes. D. a and b only. E. All of these. 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/