Scribd
Upload
39 views1 page

Class Example - Chairs & Tables - Linear Programming Solution

Sarah, the CEO of a furniture company, needs to determine how many tables and chairs to produce to maximize her profit given constraints on raw materials. After evaluating various combinations, the optimal solution is to construct 2 tables and 2 chairs, yielding a maximum profit of $70. The constraints include limits on the availability of small and large bricks required for production.

Uploaded by

Daniel Ma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
39 views1 page

Class Example - Chairs & Tables - Linear Programming Solution

Sarah, the CEO of a furniture company, needs to determine how many tables and chairs to produce to maximize her profit given constraints on raw materials. After evaluating various combinations, the optimal solution is to construct 2 tables and 2 chairs, yielding a maximum profit of $70. The constraints include limits on the availability of small and large bricks required for production.

Uploaded by

Daniel Ma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Introduction to Linear Programming- Class Example (Solution)

Sarah is the CEO of a home furniture company. She constructs tables and chairs. She makes a profit of $20
per tables and $15 per chair. Every week Sarah receives an order of raw materials: 8 small bricks and 6
large bricks. A table requires 2 large bricks and 2 small bricks to construct. A chair requires 2 small bricks
and 1 large brick to construct. How many tables and chairs should Sarah build to maximize her weekly
profit?
Variables:
Let t = the number of tables made per week.
Let c= the number of chairs made per week.

Constraints:
Small bricks: Every table requires 2 small bricks and every chair requires 2 small bricks. 2t+2c≤8
Large bricks: Every table requires 2 large bricks and every chair requires 1 large brick.
2t+c≤6

Objective Function: Maximize profit.


Max Z=$20t+$15c

Now, we will consider the corner points of the feasible region determined by the constraints.
From the small bricks constraint: When t=0: 2c=8 or c=4 When c=0: 2t=8or t=4

From the large bricks constraint: When t=0: c=6 (but this is not feasible due to the small bricks constraint)
When c=0: 2t=6 or t=3

Now, evaluate the profit based on our “Objective Function”: Max Z=$20t+$15c

(4 Tables, 0 Chairs): Profit = $20(4)+ $15(0)=$80 (infeasible)


Why is it infeasible? Recall our “Large Brick” constraint.
2t+c≤6
2(4) + 0 = 8
Because building 4 tables would require 8 “Large Bricks” (when we only have 6) the solution is infeasible.

(3 Tables, 0 Chairs): Profit= $20(3) + $15(0) = $60 (feasible)

(3 Tables, 1 Chair): Profit= $20(3) + $15(1) = $75 (infeasible)


Why is it infeasible? Recall our “Large Brick” constraint.
2t+c≤6
2(3) + 1 = 7
Because building 3 tables and 1 chair would require 7 “Large Bricks” (when we only have 6) the solution is
infeasible.

(2 Table, 2 Chairs): Profit = $20(2)+$15(2)=$40+$30=$70 (feasible; Maximum Profit)


Checking the Restraints
Small Brick Restraint: 2t+2c≤8
2(2) + 2(2) = 8; Yes, within the restraint.
Large Brick Constraint: 2t+c≤6
2(2) + 2 = 6; Yes, within the restraint.

(1 Table, 3 Chairs): Profit = $20(1) + $15(3) = $65 (feasible)

(0 Tables, 4 Chairs): Profit = $20(0)+$15(4)=$60 (feasible)

The maximum profit is $70.


Sarah should construct 2 tables and 2 chairs to maximize her weekly profit.

You might also like