Homework Help is Here – Start Your Trial Now!
Math
Advanced Math
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.

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.

Advanced Engineering Mathematics
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
See similar textbooks
icon
Related questions
Question

a) and b). 

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

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,
SEE MORE TEXTBOOKS