Chapter 03 - Linear Programming: Formulation and Applications
CHAPTER 3
LINEAR PROGRAMMING:
FORMULATION AND APPLICATIONS
True-False Questions
3-1 When formulating a linear programming model on a spreadsheet, the decisions to be made are
located in the data cells.
3-2 When formulating a linear programming model on a spreadsheet, the constraints are located (in
part) in the output cells.
3-3 When formulating a linear programming model on a spreadsheet, the measure of performance is
located in the objective cell.
3-4 A mathematical model will be an exact representation of the real problem.
3-5 Approximations and simplifying assumptions generally are required to have a workable model.
3-6 Linear programming does not permit fractional solutions.
3-7 When formulating a linear programming problem on a spreadsheet, data cells will show the levels
of activities for the decisions being made.
3-8 A key assumption of linear programming is that the equation for each of the output cells, including
the objective cell, can be expressed as a SUMPRODUCT (or SUM) function.
3-9 Resource-allocation problems are linear programming problems involving the allocation of limited
resources to activities.
3-10 Strict inequalities (i.e., < or >) are not permitted in linear programming formulations.
3-1
© 2014 by McGraw-Hill Education. This is proprietary material solely for authorized instructor use. Not authorized for sale or distribution in any
manner. This document may not be copied, scanned, duplicated, forwarded, distributed, or posted on a website, in whole or part.
Chapter 03 - Linear Programming: Formulation and Applications
3-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.
3-12 It is usually quite simple to obtain estimates of parameters in a linear programming problem.
3-13 The objective cell is a special kind of output cell.
3-14 Financial planning is one of the most important areas of application for cost-benefit-tradeoff
problems.
3-15 A resource constraint refers to any functional constraint with a ≥ sign in a linear programming
model.
3-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.
3-17 Cost-benefit-tradeoff problems are linear programming problems involving the allocation of
limited resources to activities.
3-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.
3-19 A benefit constraint refers to a functional constraint with a ≥ sign in a linear programming model.
3-20 In most cases, the minimum acceptable level for a cost-benefit-tradeoff problem is set by how
much money is available.
3-21 It is the nature of the application that determines the classification of the resulting linear
programming formulation.
3-2
© 2014 by McGraw-Hill Education. This is proprietary material solely for authorized instructor use. Not authorized for sale or distribution in any
manner. This document may not be copied, scanned, duplicated, forwarded, distributed, or posted on a website, in whole or part.
Chapter 03 - Linear Programming: Formulation and Applications
3-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.
3-23 It is fairly common to have both resource constraints and benefit constraints in the same
formulation.
3-24 Choosing the best tradeoff between cost and benefits is a managerial judgment decision.
3-25 Having one requirement for each location is a characteristic common to all transportation
problems.
3-26 Fixed-requirement constraints in a linear programming model are functional constraints that use
an equal sign.
3-27 The capacity row in a distribution-network formulation shows the maximum number of units than
can be shipped through the network.
3-28 Once a linear programming problem has been formulated, it is rare to make major adjustments to
it.
3-29 A mixed linear programming problem will always contain some of each of the three types of
constraints in it.
3-30 Blending problems are a special type of mixed linear programming problems.
3-31 Model formulation should precede problem formulation.
3-32 When dealing with huge real problems, there is no such thing as the perfectly correct linear
programming model for the problem.
3-3
© 2014 by McGraw-Hill Education. This is proprietary material solely for authorized instructor use. Not authorized for sale or distribution in any
manner. This document may not be copied, scanned, duplicated, forwarded, distributed, or posted on a website, in whole or part.
Chapter 03 - Linear Programming: Formulation and Applications
3-33 Transportation problems are concerned with distributing commodities from sources to
destinations in such a way as to minimize the total distribution cost.
3-34 Transportation problems always involve shipping goods from one location to another.
3-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.
3-36 A transportation problem requires a unit cost for every source-destination combination.
3-37 An assignment problem is a special type of transportation problem
3-38 Generally, assignment problems match people to an equal number of tasks at a minimum cost.
3-4
© 2014 by McGraw-Hill Education. This is proprietary material solely for authorized instructor use. Not authorized for sale or distribution in any
manner. This document may not be copied, scanned, duplicated, forwarded, distributed, or posted on a website, in whole or part.
Chapter 03 - Linear Programming: Formulation and Applications
Multiple-Choice Questions
3-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 the above.
e. None of the above.
3-40 A linear programming model contains which of the following components?
a. Data.
b. Decisions.
c. Constraints.
d. Measure of performance.
e. All of the above.
3-41 In linear programming formulations, it is possible to have the following types of constraints:
a. ≤.
b. >.
c. =.
d. All of the above.
e. a and c only.
3-42 Resource-allocation problems have the following type of constraints:
a. ≥.
b. ≤.
c. =.
d. <.
e. None of the above.
3-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 objective cell.
e. All of the above.
3-5
© 2014 by McGraw-Hill Education. This is proprietary material solely for authorized instructor use. Not authorized for sale or distribution in any
manner. This document may not be copied, scanned, duplicated, forwarded, distributed, or posted on a website, in whole or part.
Chapter 03 - Linear Programming: Formulation and Applications
Questions 3-44 through 3-47 refer to the following spreadsheet.
3-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.
3-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.
3-46 Where is the objective cell located?
a. B2:D2.
b. B2:D2, B4:D7, and G5:G7.
c. B10:D10.
d. E5:E7.
e. G10.
3-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.
3-6
© 2014 by McGraw-Hill Education. This is proprietary material solely for authorized instructor use. Not authorized for sale or distribution in any
manner. This document may not be copied, scanned, duplicated, forwarded, distributed, or posted on a website, in whole or part.
Chapter 03 - Linear Programming: Formulation and Applications
3-48 Cost-benefit tradeoff problems have the following type of constraints:
a. ≥.
b. ≤.
c. =.
d. <.
e. None of the above.
3-49 Mixed problems may have the following type of constraints:
a. ≥.
b. ≤.
c. =.
d. All of the above.
e. None of the above.
3-50 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 the above.
3-51 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 the above.
3-52 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 the above.
3-7
© 2014 by McGraw-Hill Education. This is proprietary material solely for authorized instructor use. Not authorized for sale or distribution in any
manner. This document may not be copied, scanned, duplicated, forwarded, distributed, or posted on a website, in whole or part.
Chapter 03 - Linear Programming: Formulation and Applications
3-53 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
3-54 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 the above.
3-55 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 the above.
3-56 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 the above.
e. All of the above.
3-57 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 the above.
3-8
© 2014 by McGraw-Hill Education. This is proprietary material solely for authorized instructor use. Not authorized for sale or distribution in any
manner. This document may not be copied, scanned, duplicated, forwarded, distributed, or posted on a website, in whole or part.
