CHAPTER 3
APPLICATIONS OF LINEAR AND INTEGER PROGRAMMING MODELS
TRUE/FALSE QUESTIONS
1. It takes two pounds of steel and three pounds of copper to
make a particular product. If there are 100 pounds of steel and 100
pounds of cooper available, one constraint will be 2X1 + 3X2 200.
2. You are currently paying $12 per hour for labor, and labor
costs are included in the calculation of the objective function
coefficients of a maximization problem. The shadow price for labor
printed on the sensitivity analysis report is $8. It would be
economically beneficial to you if you could secure extra labor for
3. The objective function coefficient for X1 is currently $18 and
for X2 is $29, and the ranges of optimality for these coefficients
are between $15 and $20 and between $25 and $35, respectively. If
the objective function coefficients for X1 and X2 decline by $2 each,
since both coefficients are still within their ranges of optimality,
4. A linear programming model has a constraint that reflects a
budget restriction of $100,000. The range of feasibility for this
amount, reflected on the sensitivity report, is $85,000 to $325,000.
Thus if the budget restriction is changed to $90,000, the optimal
5. Nimble Automotive uses linear programming to produce a monthly
production schedule for their manufacturing plant. Although the
number of cars built is obviously an integer, the fractional part of
a non-integer decision variable could be considered “work in
6. If project 1 is performed then project 2 will not be
performed. This can be modeled by the constraint X1 – X2 1, where
7. One approach for solving an integer linear programming problem
is simply to enumerate all feasible points and select the one
yielding the “best” value for the objective function. However, the
number of feasible integer points is usually so large, even for
small problems, that this approach is inefficient for solving most
8. The optimal solution obtained to a maximization integer linear
programming model, where the integer requirements are at first
ignored, provides a lower bound for the optimal objective function
9. Relaxing the integer restrictions to an integer linear model
produces an optimal solution of X1 = 23 and X2 = 15. This must also