Question

In: Advanced Math

The problem below involves three variables. Solve it with the simplex method, Excel, or some other...

The problem below involves three variables. Solve it with the simplex method, Excel, or some other technology.

Patio Iron makes wrought iron outdoor dining tables, chairs, and stools. Each table uses 8 feet of a standard width wrought iron, 2 hours of labor for cutting and assembly, and 2 hours of labor for detail and finishing work. Each chair uses 6 feet of the wrought iron, 2 hours of cutting and assembly labor, and 1.5 hours of detail and finishing labor. Each stool uses 1 footof the wrought iron, 1.5 hours for cutting and assembly, and 0.5 hour for detail and finishing work, and the daily demand for stools is at most 16. Each day Patio Iron has available at most 156 feet of wrought iron, 70 hours for cutting and assembly, and 50 hours for detail and finishing. The profits are $60 for each dining table, $48 for each chair, and $36 for each stool.

Suppose Patio Iron wants to maximize its profits each day by making dining tables, chairs, and stools.

Let x be the number of dining tables, y be the number of chairs, and z be the number of stools made each day.

Let f be the maximum profit (in dollars). Form the profit equation that needs to be maximized.

f = ____

Since Patio Iron has available at most 156 feet of wrought iron, form the constraint inequality for the total feet of wrought iron used for dining tables, chairs, and stools.

___ ≤ 156

Since Patio Iron has available at most 70 hours for cutting and assembly, form the constraint inequality for the total hours spent on cutting and assembling dining tables, chairs, and stools.

___ ≤ 70

Since Patio Iron has available at most 50 hours for detail and finishing work, form the constraint inequality for the total hours spent on detailing and finishing dining tables, chairs, and stools.

___ ≤ 50

Since the daily demand for stools is at most 16,  ---Pick one--- x ≤ 16 or y ≤ 16 or z ≤ 16 .

How many of each item should be made each day to maximize profit? Solve with the simplex method, Excel, or some other technology.

tables ___

chairs ___

stools ___

Find the maximum profit.

$ ___

Solutions

Expert Solution

Then no.of dining tables,x1=1

No.of chair,x2=22

No.of stools,x3=16 is the optimal solution.

And maximum profit; max.f=1692

Thank you so much sir


Related Solutions

Solve the following problem using the simplex method. If the problem is two dimensional, graph the...
Solve the following problem using the simplex method. If the problem is two dimensional, graph the feasible region, and outline the progress of the algorithm. Max               Z = 5X1 + 3X2 + 2X3 Subject to    4X1 + 5X2 + 2X3 + X4≤ 20                      3X1 + 4X2 - X3 + X4≤ 30                       X1, X2, X3, X4 ≥ 0   
Solve this problem with the revised simplex method: Maximize            Z = 5X1 + 3X2 + 2X3...
Solve this problem with the revised simplex method: Maximize            Z = 5X1 + 3X2 + 2X3 Subject to            4X1 + 5X2 + 2X3 + X4 ≤ 20                             3X1 + 4X2 - X3 + X4 ≤ 30                            X1, X2, X3, X4 ≥ 0
Use the simplex method to solve the linear programming problem. The maximum is ___ when x1=...
Use the simplex method to solve the linear programming problem. The maximum is ___ when x1= ___ and x2=___ a.) Maximize : z= 24x1+2x2 Subject to: 6x1+3x2<=10, x1+4x2<=3 With: x1>=0, x2>=0 b.) Maximize: z=2x1+7x2 Subject to: 5x1+x2<=70, 7x1+2x2<=90, x1+x2<=80 With: x1,x2>=0 c.) Maximize: z=x1+2x2+x3+5x4 Subject to: x1+3x2+x3+x4<=55, 4x+x2+3x3+x4<=109 With: x1>=0, x2>- 0, x3>=0, x4>=0 d.) Maximize: z=4x1+7x2 Subject to: x1-4x2<=35 , 4x1-3x2<=21 With: x1>=0, x2>=0
Maximization by the simplex method Solve the following linear programming problems using the simplex method. 1>....
Maximization by the simplex method Solve the following linear programming problems using the simplex method. 1>. Maximize z = x1 + 2x2 + 3x3 subject to x1 + x2 + x3 ≤ 12 2x1 + x2 + 3x3 ≤ 18 x1, x2, x3 ≥ 0 2>. A farmer has 100 acres of land on which she plans to grow wheat and corn. Each acre of wheat requires 4 hours of labor and $20 of capital, and each acre of corn...
Use the simplex method to solve the linear programming problem. Maximize P = x + 2y...
Use the simplex method to solve the linear programming problem. Maximize P = x + 2y + 3z subject to 2x + y + z ≤ 21 3x + 2y + 4z ≤ 36 2x + 5y − 2z ≤ 15 x ≥ 0, y ≥ 0, z ≥ 0
Use the simplex method to solve the linear programming problem. Maximize P = 3x + 2y...
Use the simplex method to solve the linear programming problem. Maximize P = 3x + 2y subject to 3x + 4y ≤ 33 x + y ≤ 9 2x + y ≤ 13 x ≥ 0, y ≥ 0   The maximum is P =  at (x, y)
Use the simplex method to solve the linear programming problem. Maximize P = 3x + 2y...
Use the simplex method to solve the linear programming problem. Maximize P = 3x + 2y subject to 3x + 4y ≤ 33 x + y ≤ 9 2x + y ≤ 13 x ≥ 0, y ≥ 0   The maximum is P =  at (x, y)
Use the simplex method to solve the linear programming problem. Maximize P = x + 2y...
Use the simplex method to solve the linear programming problem. Maximize P = x + 2y + 3z subject to 2x + y + z ≤ 56 3x + 2y + 4z ≤ 96 2x + 5y − 2z ≤ 40 x ≥ 0, y ≥ 0, z ≥ 0   The maximum is P =  at (x, y, z) =
Use the simplex method to solve the linear programming problem. Maximize   P = x + 2y...
Use the simplex method to solve the linear programming problem. Maximize   P = x + 2y + 3z subject to   2x + y + z ≤ 28 3x + 2y + 4z ≤ 48 2x + 5y − 2z ≤ 20 x ≥ 0, y ≥ 0, z ≥ 0   The maximum is P = ________ at (x, y, z) = (_______)       .
Solve the following linear programming problem using the dual simplex method: max ? = −?1 −...
Solve the following linear programming problem using the dual simplex method: max ? = −?1 − 2?2 s.t. −2?1 + 7?2 ≤ 6 −3?1 + ?2 ≤ −1 9?1 − 4?2 ≤ 6 ?1 − ?2 ≤ 1 7?1 − 3?2 ≤ 6 −5?1 + 2?2 ≤ −3 ?1,?2 ≥ 0
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT