# Polymer based trim around the fuel tank and seat each

• Homework Help
• 8
• 92% (24) 22 out of 24 people found this document helpful

This preview shows page 7 - 8 out of 8 pages.

##### We have textbook solutions for you!
The document you are viewing contains questions related to this textbook.
The document you are viewing contains questions related to this textbook.
Chapter 4 / Exercise 26
Finite Mathematics for the Managerial, Life, and Social Sciences: An Applied Approach
Tan
Expert Verified
polymer-based trim around the fuel tank and seat. Each Razor’s trim requires 2 pounds of polymer and 3 hours of production time. And each Zoomer requires 1 pound of polymer and 4 hours of production time. Assume that 900 pounds of polymer and 2400 labor hours are available for production of these items in the coming week. a. Formulate an LP model for this problem. b. Sketch the feasible region for this model. c. Find the optimal solution. 300 0
##### We have textbook solutions for you!
The document you are viewing contains questions related to this textbook.
The document you are viewing contains questions related to this textbook.
Chapter 4 / Exercise 26
Finite Mathematics for the Managerial, Life, and Social Sciences: An Applied Approach
Tan
Expert Verified
19. The Quality Desk Company makes two types of computer desks from laminated particle board. The Presidential model requires 30 square feet of particle board, 1 keyboard sliding mechanism and 5 hours of labor to fabricate. It sells for \$149. The Senator model requires 24 square feet of particle board, 1 keyboard sliding mechanism, and 3 hours to fabricate. It sells for \$135. In the coming week, the company can buy up to 15,000 square feet of particle board at \$1.35 per square foot and up to 600 keyboard mechanisms at a cost of \$4.75 each. The company views manufacturing labor as a fixed cost and has 3000 labor hours available in the coming week for the fabrication of these desks. a. Formulate an LP model for this problem. b. Sketch the feasible region for this model. c. Find the optimal solution. 0