A furniture maker makes three different style of wardrobes: x, x, and x,. The manufacture of each style of wardrobe requires a certain amount of time in three types of skilled labor: cutting, assembling and painting. Model x, requires 1 hour for the cutting of component parts, 2 hours for assembling and 4 hours for painting. Model x, requires 2 hours for cutting, 4 hours for assembling and painting, respectively. While model x, needs 3, 7 and 5 hours for cutting, assembling and painting accordingly. Currently, 200 cutting hours of component parts, 300 assembling hours and 150 painting hours are available. Determine the product mix that will maximize the furniture maker's revenue if a model x, sells for $20, a painted model x, sells for $30, an unpainted model x, sells for $20 and a model x, sells for $50. (a) Formulate a linear programming model for this problem. (b) Find the optimal solution by using simplex algorithm.

Algebra for College Students
10th Edition
ISBN:9781285195780
Author:Jerome E. Kaufmann, Karen L. Schwitters
Publisher:Jerome E. Kaufmann, Karen L. Schwitters
Chapter11: Systems Of Equations
Section11.CT: Test
Problem 24CT
icon
Related questions
Question
A furniture maker makes three different style of wardrobes: x,, x, and x, . The manufacture
of each style of wardrobe requires a certain amount of time in three types of skilled labor:
cutting, assembling and painting. Model x, requires 1 hour for the cutting of component parts,
2 hours for assembling and 4 hours for painting. Model x, requires 2 hours for cutting, 4
hours for assembling and painting, respectively. While model x, needs 3, 7 and 5 hours for
cutting, assembling and painting accordingly. Currently, 200 cutting hours of component
parts, 300 assembling hours and 150 painting hours are available. Determine the product mix
that will maximize the furniture maker's revenue if a model x, sells for $20, a painted model
x, sells for $30, an unpainted model x, sells for $20 and a model x, sells for $50.
(a) Formulate a linear programming model for this problem.
(b) Find the optimal solution by using simplex algorithm.
Transcribed Image Text:A furniture maker makes three different style of wardrobes: x,, x, and x, . The manufacture of each style of wardrobe requires a certain amount of time in three types of skilled labor: cutting, assembling and painting. Model x, requires 1 hour for the cutting of component parts, 2 hours for assembling and 4 hours for painting. Model x, requires 2 hours for cutting, 4 hours for assembling and painting, respectively. While model x, needs 3, 7 and 5 hours for cutting, assembling and painting accordingly. Currently, 200 cutting hours of component parts, 300 assembling hours and 150 painting hours are available. Determine the product mix that will maximize the furniture maker's revenue if a model x, sells for $20, a painted model x, sells for $30, an unpainted model x, sells for $20 and a model x, sells for $50. (a) Formulate a linear programming model for this problem. (b) Find the optimal solution by using simplex algorithm.
Expert Solution
steps

Step by step

Solved in 3 steps

Blurred answer
Recommended textbooks for you
Algebra for College Students
Algebra for College Students
Algebra
ISBN:
9781285195780
Author:
Jerome E. Kaufmann, Karen L. Schwitters
Publisher:
Cengage Learning
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:
9781133382119
Author:
Swokowski
Publisher:
Cengage
College Algebra
College Algebra
Algebra
ISBN:
9781305115545
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning
Algebra and Trigonometry (MindTap Course List)
Algebra and Trigonometry (MindTap Course List)
Algebra
ISBN:
9781305071742
Author:
James Stewart, Lothar Redlin, Saleem Watson
Publisher:
Cengage Learning