Homework Help is Here – Start Your Trial Now!
Math
Statistics
Question 1 A factory manufactures two (2) types of chairs, wooden-typed and stainless steel-typed. Each unit of these chairs undergoes three (3) processes, namely production, assembling, and finishing. The production process is performed in Production Department, the assembling process in Assembling Department, and finishing process in Finishing Department. The time taken for each unit of the product in each department and the profit per unit of chair are shown in the table below. Time (min) required per unit of the product Department Wooden Stainless steel Production 3 Assembling 1 Finishing 1 Profit per unit (RM) 4 5 The Production, Finishing, and Assembling Departments will operate for 16 hours, 12 hours, and 8 hours in a day, respectively. a) By using x to represent the quantity of wooden chairs and y to represent the quantity of stainless-steel chairs, formulate the linear programming problem above into a mathematical model. b) Using 2cm =80 units on x-axis and 2cm = 80 units on y-axis, by the graphical method, find the number of wooden and stainless-steel chairs that have to be produced in order for the manufacturer to obtain the maximum profit.

Question 1 A factory manufactures two (2) types of chairs, wooden-typed and stainless steel-typed. Each unit of these chairs undergoes three (3) processes, namely production, assembling, and finishing. The production process is performed in Production Department, the assembling process in Assembling Department, and finishing process in Finishing Department. The time taken for each unit of the product in each department and the profit per unit of chair are shown in the table below. Time (min) required per unit of the product Department Wooden Stainless steel Production 3 Assembling 1 Finishing 1 Profit per unit (RM) 4 5 The Production, Finishing, and Assembling Departments will operate for 16 hours, 12 hours, and 8 hours in a day, respectively. a) By using x to represent the quantity of wooden chairs and y to represent the quantity of stainless-steel chairs, formulate the linear programming problem above into a mathematical model. b) Using 2cm =80 units on x-axis and 2cm = 80 units on y-axis, by the graphical method, find the number of wooden and stainless-steel chairs that have to be produced in order for the manufacturer to obtain the maximum profit.

Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter2: Systems Of Linear Equations
Section2.4: Applications
Problem 6EQ: Redo Exercise 5, assuming that the house blend contains 300 grams of Colombian beans, 50 grams of...
See similar textbooks
icon
Related questions
Topic Video
Question
100%
Question 1 A factory manufactures two (2) types of chairs, wooden-typed and stainless steel-typed. Each unit of these chairs undergoes three (3) processes, namely production, assembling, and finishing. The production process is performed in Production Department, the assembling process in Assembling Department, and finishing process in Finishing Department. The time taken for each unit of the product in each department and the profit per unit of chair are shown in the table below. Time (min) required per unit of the product Department Wooden Stainless steel Production 2 3 Assembling 2 1 Finishing 1 1 Profit per unit (RM) 4 5 The Production, Finishing, and Assembling Departments will operate for 16 hours, 12 hours, and 8 hours in a day, respectively. a) By using x to represent the quantity of wooden chairs and y to represent the quantity of stainless-steel chairs, formulate the linear programming problem above into a mathematical model. b) Using 2cm = 80 units on x-axis and 2cm = 80 units on y-axis, by the graphical method, find the number of wooden and stainless-steel chairs that have to be produced in order for the manufacturer to obtain the maximum profit.
Transcribed Image Text:Question 1 A factory manufactures two (2) types of chairs, wooden-typed and stainless steel-typed. Each unit of these chairs undergoes three (3) processes, namely production, assembling, and finishing. The production process is performed in Production Department, the assembling process in Assembling Department, and finishing process in Finishing Department. The time taken for each unit of the product in each department and the profit per unit of chair are shown in the table below. Time (min) required per unit of the product Department Wooden Stainless steel Production 2 3 Assembling 2 1 Finishing 1 1 Profit per unit (RM) 4 5 The Production, Finishing, and Assembling Departments will operate for 16 hours, 12 hours, and 8 hours in a day, respectively. a) By using x to represent the quantity of wooden chairs and y to represent the quantity of stainless-steel chairs, formulate the linear programming problem above into a mathematical model. b) Using 2cm = 80 units on x-axis and 2cm = 80 units on y-axis, by the graphical method, find the number of wooden and stainless-steel chairs that have to be produced in order for the manufacturer to obtain the maximum profit.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 7 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Optimization
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, statistics and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning
College Algebra (MindTap Course List)
College Algebra (MindTap Course List)
Algebra
ISBN:
9781305652231
Author:
R. David Gustafson, Jeff Hughes
Publisher:
Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
SEE MORE TEXTBOOKS