Linear Programming Practice Problems
Linear Programming Practice Problems
1. A local company manufactures two lines of rocking chairs called type A and B. Each
rocking chair requires hand-assembled materials. Type A requires 500 pounds of wood
and 40 pounds of nails. Further each A chair is worth $450. Type B requires 150 pounds
of wood, 50 pounds of nails, and each B chair is worth $350. There is a total amount of
3,000 pounds of wood and 800 pounds of nails available. The company would like to
maximize their profit, help them to find the best combination of rocking chairs.
Nails 40 50 1,000
2. A small manufacturer, which produces 2 types of new perfumes labeled A and B in the
table below, needs to decide how much of each perfume to produce each month to
maximize profit. The profit earned from the sales of perfume A is $30, and the profit
earned from the sales of perfume B is $50. The perfume must go through two steps:
Filling and Boxing. Perfume A takes 30 minutes of Filling capacity per bottle of perfume
processed, whereas Perfume B only takes 20 minutes of Filling capacity per bottle
processed. Perfume A takes 15 minutes of Boxing capacity per bottle of perfume
processed, whereas Perfume B only takes 5 minutes of Boxing capacity per bottle
processed. The maximum Filling capacity is 180 hours per month and the maximum
Boxing capacity is 75 hours per month. The table below summarizes the findings.
Filling 30 20 180
Boxing 15 5 75
3. The following report has been generated in excel using the solver.
Linear Programming Practice Problems
The company needs some help to have the output explained to them.
b) What are the final values of the decision variables at this optimal value?
c) Explain which constraints are binding and not binding and what does that mean?
d) If you could increase the value of constraint #2 by one unit, what would be the
effect on the objective function?
Linear Programming Practice Problems
4. A manufacturer of steel furniture procures steel from 4 different steel suppliers located in
Cleveland, OH; Charleston, SC; Omaha, NE and Buffalo, NY. There are two furniture
manufacturing plants at Grand Rapids, MI and Chattanooga, TN.
The capacity of each supplier (measured in tons of steel) and the demand for steel at
each manufacturing plant is given in the tables below:
The cost to ship one ton of steel between the different supplier locations to the plant
locations is given in the table below:
Also, current transportation capacity restricts the amount of steel that can be shipped
out from Omaha, NE to Grand Rapids, MI and to Chattanooga, TN at 4000 and 6000 tons
respectively. Current contract terms also require the manufacturer to procure a
minimum of 4,000 tons of steel from the supplier in Cleveland, OH.
a) Formulate the problem as a Linear Program. Clearly write down the decision variables,
the objective function and the constraints.
b) Now open the EXCEL shell and model this problem and solve it to optimality. Generate the
Sensitivity Report. What is the total cost of the optimal plan? Which supplier location does
not utilize all its capacity?
c) What will be the effect on the optimal cost if the capacity of the Cleveland supplier is
increased by one more ton? (Answer this question without resolving the problem). How did
you find the answer to this question?
d) Would the manufacturer benefit if the capacity of the supplier located at Cleveland or
Charleston would increase? For which supplier would they prefer an increase in capacity?
Explain (again without resolving the problem).
Linear Programming Practice Problems
e) Would the manufacturer prefer an increase in demand at their Grand Rapids location or
the Chattanooga location? Why? Explain (again without resolving the problem).