The world’s Largest Sharp Brain Virtual Experts Marketplace Just a click Away
Levels Tought:
Elementary,Middle School,High School,College,University,PHD
| Teaching Since: | Apr 2017 |
| Last Sign in: | 419 Weeks Ago |
| Questions Answered: | 3232 |
| Tutorials Posted: | 3232 |
MBA,MCS,M.phil
Devry University
Jan-2008 - Jan-2011
MBA,MCS,M.Phil
Devry University
Feb-2000 - Jan-2004
Regional Manager
Abercrombie & Fitch.
Mar-2005 - Nov-2010
Regional Manager
Abercrombie & Fitch.
Jan-2005 - Jan-2008
A manufacturer of bathroom fixtures produces fiberglass bathtubs in an assembly operation consisting of three processes: molding, smoothing, and painting. The number of units that can be put through each process in an hour is as follows:
|
Process |
Output (units/hr) |
|
Molding |
7 |
|
Smoothing |
12 |
|
Painting |
10 |
(Note: The three processes are continuous and sequential; thus, no more units can be smoothed or painted than have been molded.) The labor costs per hour are $8 for molding, $5 for smoothing, and $6.50 for painting. The company"s labor budget is $3000 per week. A total of 120 hours of labor is available for all three processes per week. Each completed bathtub requires 90 pounds of fiberglass, and the company has a total of 10,000 pounds of fiberglass available each week. Each bathtub earns a profit of $175. The manager of the company wants to know how many hours per week to run each process in order to maximize profit. Formulate and solve a linear programming model for this problem
Hel-----------lo -----------Sir-----------/Ma-----------dam----------- T-----------han-----------k Y-----------ou -----------for----------- us-----------ing----------- ou-----------r w-----------ebs-----------ite----------- an-----------d a-----------cqu-----------isi-----------tio-----------n o-----------f m-----------y p-----------ost-----------ed -----------sol-----------uti-----------on.----------- Pl-----------eas-----------e p-----------ing----------- me----------- on----------- ch-----------at -----------I a-----------m o-----------nli-----------ne -----------or -----------inb-----------ox -----------me -----------a m-----------ess-----------age----------- I -----------wil-----------l