
Titus Jr I.
asked 10/05/23Operations Management question
The Pinewood Furniture Company produces chairs and tables from two resources: labor and wood. The company has 145 hours of labor and 100 board-ft. of wood available each day. Demand for chair is limited to 8 per day. Each chair requires 3 hours of labor and 4 board-ft. of wood, whereas a table requires 22 hours of labor and 9 board-ft. of wood. The profit derived from each chair is $100 and from each table is $500. The company wants to determine the number of chairs and tables to produce each day in order to maximize profit. The correct linear programming model formulation of this problem is:
2 Answers By Expert Tutors
Mauricio Q. answered 10/07/23
MBA Berkeley - EX CEO - Strategy Professor - Business Consultant
FOR SOLVING THIS PROBLEM, THE BEST TOOL IS USING LINEAR PROGRAMMING METHODS, SUCH AS THE SIMPLEX METHOD.
As the answers is limited to 10,000 characters, I will divide my answer in 3 parts:
1. I will explain the how to prepare the problem to solve it
2. I will explain how to solve it using SIMPLEX in excel
3. I will explain how to solve it using SIMPLEX in phyton
1. PREPARE THE PROBLEM TO SOLVE IT:
The Pinewood Furniture Company wants to maximize its profit by determining the optimal number of chairs and tables to produce, given constraints on labor, wood, and demand.
Let:
- C = number of chairs to be produced per day,
- T = number of tables to be produced per day.
OBJECTIVE FUNCTION: The company wants to maximize its profit. Profit from chairs is $100 each and from tables is $500 each, so:
Maximize Z=100C+500T
Subject to Constraints:
1. Labor constraint: Each chair requires 3 hours of labor and each table requires 22 hours. The company has 145 hours available each day. 3C+22T≤145
2. Wood constraint: Each chair requires 4 board-ft. of wood and each table requires 9 board-ft. The company has 100 board-ft. available each day. 4C+9T≤100
3. Demand constraint: The company can only sell up to 8 chairs per day. C≤8
4. Non-negativity constraints: The number of chairs and tables cannot be negative. C≥0,T≥0
In formal mathematical notation, the linear programming model is:
- Maximize Z=100C+500T
- Subject to:
- 3C+22T≤145
- 4C+9T≤100
- C≤8
- C,T≥0

Mauricio Q.
10/07/23

Mauricio Q.
10/07/23
This linear programming model formula has several parts.
Begin with the sentence "The company wants to determine the number of chairs and tables to produce each day in order to maximize profit."
Writing this formula will tell you what the variables are for the graph that is to come.
The formula comes from the sentence preceding. "The profit derived from each chair is $100 and from each table is $500." This is pretty straightforward.
Let c = number of chairs and t = number of tables
Profit = 100c + 500t
Now set this formula aside to write the constraints formulas. These come from the earlier sentences.
Labor formula: 3c + 22 t <= 145
Wood formula: 4c + 9 t <= 100
There is another constraint in this sentence: "Demand for chair is limited to 8 per day"
So. c <= 8.
Of course we must include the constraints that you cannot produce a negative number of chairs or tables so
c >= 0 and t >= 0 are part of the solution.
The question only asks for the model and does not ask for you to solve it.
So the answer is all the inequalities that I have printed in bold.

Linda B.
10/05/23
Still looking for help? Get the right answer, fast.
Get a free answer to a quick problem.
Most questions answered within 4 hours.
OR
Choose an expert and meet online. No packages or subscriptions, pay only for the time you need.
Mark M.
Did you formulate all of the conditions and then plot them?10/05/23