Explore BrainMass
Share

# Setting and solving linear programming question

This content was STOLEN from BrainMass.com - View the original, and get the already-completed solution here!

A furniture manufacturer produces sofas, tables, and chairs. The profits per item are, respectively, \$70, \$120, and \$80. The pieces of furniture require the following labor-hours for their manufacture.

Carpentry Upholstery Finishing
Sofas 3 5 1
Tables 8 0 2
Chairs 6 2 1

The following amounts of labor-hours are available each month: carpentry, at most 768 hours; upholstery, at most 216 hours; and finishing, at most 144 hours. You are to determine how many each of sofas, tables, and chairs should be manufactured to maximize profit. (Please show all work)

b.) Determine the objective function

c.) Determine the constraints

d.) Construct the initial simplex tableau

e.) Using the simplex method, determine the solution that maximizes profit. Be sure to present your solutions in terms of the amount of each furniture type and any unused type of labor-hours.

https://brainmass.com/math/functional-analysis/setting-solving-linear-programming-question-571871

#### Solution Preview

Let x, y, and z be number of sofas, tables and chairs purchased respectively.

b.) Determine the objective function
We need to maximize P such that P=70x + 120y + 80z

c.) Determine the constraints
3x + 8y + 6z ≤ 768
5x + 0y + 2z ≤ 216
1x + 2y + 1z ≤ 144
x, y, z ≥ 0

d.) Construct the initial simplex tableau
Initial simplex tableau is:

...... x .... y ... z u v w P
[ ... 3 .... 8 ... 6 1 0 0 0 | 768 ]
[ ... 5 .... 0 ... 2 0 1 0 0 | 216 ]
[ ... 1 .... 2 ... 1 0 0 1 0 | 144 ]
[ −70 −120 −80 0 0 0 1 | 0 ]

where u, v and ...

#### Solution Summary

The solution gives detailed steps on setting and solving linear programming question using the example of furniture order. A simplex method is used in steps.

\$2.19

## Linear programming Questions

Study Questions

______1) For a linear program, which is not a property?

a) Proportionality.
b) Constraints and object function terms are additive
c) The value of decision variables are divisible.
d) Model parameters are assumed to be known with certainty.
e) Must be solved on a computer

_____ 2) Which of the following is a valid objective function in linear programming?

a) Max 5xy.
b) Min 4x + 5y - (2/3)z.
c) Max 4 x 2 + 6 Y 2.
d) Min (x + y) / z.
e) None of the above.

______3) The improvement in the value of the objective function per unit increase in a right-hand side is the

a. sensitivity value.
c. constraint coefficient.
d. slack value.

_____4) Study of how changes in the coefficients of a linear programming problem affect the optimal solution is called

a. sensitivity analysis.
b. transshipment analysis.
c. sunk cost analysis.
d. duality analysis.
e. none of the above.

_____5) Which of these is not a type of integer model?

a. a real integer model.
b. a total integer model.
c. a 0-1 integer model.
d. a mixed integer model.

_____6) Which is not a linear program network flow problem?

a. Transportation.
b. Assignment.
c. Blending.
d. Transshipment.

_____7) Given Max 2X1 - 7X2, what is the slope of the objective function line?
a. -2/7.
b. 2/7.
c. -7/2.
d. 7/2.
e. None of the above.

_____ 8) When a constraint is binding

a. the slack is zero.
b. the slack is negative.
c. the slack is positive.
d. the surplus is positive.
e. the surplus is negative.

_____ 9) Which constraint will force the number of hens to be exactly 10 times the number of roosters?

a. R - 10 H =0.
b. H - 10 R =0.
c. H - 10 R > =0.
d. R - 10H > =0.
e. R - 10H < =0.
f. None of the above.

10) Honey Oak - Graph Manual - Honey Oak Furniture company produces tables and chairs from oak. Each week the company has 160 hours of labor and 72 board feet of fine oak. Honey Oak can only sell 6 tables per week. Each chair requires 20 hours of labor and 12 board feet. The tables require 16 hours of labor and 4 board feet of oak. The profit from a chair is \$100 and a table is \$400. Honey Oak Furniture wants to determine the number of chairs and tables to produce each week to maximize profit. Set up the linear program in the following box (Give the model). Next, plot and solve by hand. You may check with Solver.

| | | | | | | | | | | | | | | | | |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

Circle the possible feasible extreme points.
Clearly mark the optimal point
Include the Z optimization line

11) You Chops Peas - Graph Manual - You Chops grocery store sells its own brand of canned peas and some national brands. The store makes \$.30 profit per can selling its own brand of peas and a profit of \$.20 per can from any of the national brands. You Chops has 864 square inches of shelf space and each can of peas requires 9 square inches. From the sales records, You Chops never sells more than one-half as many cans of its own brand as it does of the national brands. Furthermore, You Chops can obtain no more than 50 cans of the local brand per week. The store wants to know how many cans of its own brand of peas and how many of the national brands it should stock each week to maximize profit. Set up the linear program in the following box (Give the model). Next, plot and solve by hand. You may check with Solver.

| | | | | | | | | | | | | | | | | |
10 20 30 40 50 60 70 80 90 100 110 120 130 140150 160 170

Circle the possible feasible extreme points.
Clearly mark the optimal point
Include the Z optimization line

2) Quick Cake - Sensitivity - The Quick Cake Company makes giant cakes and pies. These are specialty-baked items. The main ingredients of the cooked goods are flour, sugar, and eggs. The resource requirements of the cake and pies and the amount available are in the following table.

Product Flour Sugar Eggs
Cake 6 Pounds 4 Pounds 2 Eggs
Pie 4 Pounds 5 Pounds 3 Eggs

Total Resources 1000 pounds 800 pounds 450 eggs

The sales price of the cake is \$16 and the pie is \$18. The cost of the cake is \$4 and the cost of the pie is \$2. Set up this problem to maximize the profit.

Set up the linear model to maximize the profit.

Now run the sensitivity analysis and post in the following box.

a) How many cakes and pies should QuickCake make?

b) Which of the three constraints is non-binding?

c) What is the profit at the optimal solution?

d) How much would one additional egg add to the Z value?

e) How much could you increase the profit of the pie before the solution would change?

f) Do we have a surplus of any ingredient? If so, what and how much surplus?

3) Textile Mill - Block manufactures denim. It has three grades that it produces. Those are: high, medium, and low. Block has 2 factories. Factory 1 cost \$6000 per day to run; whereas, Factory 2 cost \$5000 per day. The amount each factory is capable of producing and the requirements are in the following table.

Denim
Grades Factory 1 (1000 lb) Factory 2
(1000 lb) Requirements (1000 lb)
1. High 6 2 12
2. Medium 2 2 8
3. Low 4 10 9

Block wants to know the number of days to operate each mill in order to meet the requirements at the minimum cost.

a) Give the set up for the LP problem.

b) Give the Excel set up

c)Give the solution.

d) What is the Z value?

e) What is (are) the binding constraints?

4) Insurance Sales - Charlie is going into the insurance business. He will sell homeowner, auto, and life insurance policies. To sell policies, time is required. The time in hours to sell a homeowner policy is 14 hours. To sell an auto policy is 12 hours. To sell a life insurance policy requires 28 hours. He has 5600 hours budgeted for the year to sell these policies. There are also expenses associated with the policies. To sell a homeowner policy takes \$40. To sell an auto policy takes \$25. Finally, to sell a life insurance police takes \$30. Charlie has budget \$12,000 for expenses. Charlie wants to be able to cover all the types of insurance, so he wants to sell at least 50 of each of the policy types. His yearly profit from a homeowner policy is \$40, from an auto is \$30 and from a life policy it is \$50.

Charlie wants to maximize his profits.

a. Formulate an LP programming model for this problem.

b. Give the Excel sheet set up.

c. Solve this model using the computer for non-integer and integer.

Non Integer
Integer

d. For the Non-integer, what is/are the binding constraint(s)?

5) Sales Territories - Outback Camping supply wants to redistribute their sales territory. Now Outback has 12 salespersons in three regions - South, East and Midwest. The sales by region by salesperson are South \$600 per day, East \$540 per day, and the Midwest at \$375 per day. In the reassignment, no salespersons are to be fired. Also, Outback wants at least 5 in the South region. Outback also wants the ratio of South sales to the other two to be greater than or equal to 2. Outback wants to determine the number to assign to each region. Outback also has a budget of \$750 per day. This budget is not to be exceeded. Salespersons in the South spend \$80 per day. Salespersons in the East spend \$70 per day and salespersons in the Midwest spend \$50 per day..

Outback wants to maximize sales. Solve as an integer problem.

b. Formulate an LP programming model for this problem.

b. Give the Excel sheet set up.

c. Solve this model using the computer for an integer solution.

7) Coal Field - Consider the following transportation problem.

From To
Supply
1 Narrows 2 Lee 3 Oxford
A Blue 12.5 13.5 14 400
B Cannon 11.5 12 12.8 300
C Wiley 13.6 15.8 11.2 200
Demand 230 250 370
a) Draw the node network diagram.

b) Set up the linear program.

c) Show the Excel set up

c) Cut and paste your Excel solution the following box.

d) Provide the quantity moving between the nodes.

To
From 1 2 3
A
B
C

e) Provide the overall Z value.

f) Were the supply and demand balanced?

Food for thought

1) The Dow has fallen from 14,000 to 7,000 for a 50% drop. It is now at 9,000. What percent does it need to increase to move back to 14,000?

2) 2) If you buy cantaloupes from Georgia at \$12 per dozen and sell them for \$1 each in North Carolina at a roadside stand. Which of the following may allow you to make a profit?