1 / 25

Sherwood Furniture Company

Sherwood Furniture Company.

bailey
Download Presentation

Sherwood Furniture Company

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Sherwood Furniture Company Recently, Sherwood Furniture Company has been interested in developing a new line of stereo speaker cabinets. In the coming month, Sherwood expects to have excess capacity in its Assembly and Finishing departments and would like to experiment with two new models. One model is the Standard, a large, high-quality cabinet in a traditional design that can be sold in virtually unlimited quantities to several manufacturers of audio equipment. The other model is the Custom, a small, inexpensive cabinet in a novel design that a single buyer will purchase on an exclusive basis. Under the tentative terms of this agreement, the buyer will purchase as many Customs as Sherwood produces, up to 32 units. The Standard requires 4 hours in the Assembly Department and 8 hours in the Finishing Department, and each unit contributes $20 to profit. The Custom requires 3 hours in Assembly and 2 hours in Finishing, and each unit contributes $10 to profit. Current plans call for 120 hours to be available next month in Assembly and 160 hours in Finishing for cabinet production, and Sherwood desires to allocate this capacity in the most economical way. Linear Programming

  2. Sherwood Furniture Company – Linear Equations Linear Programming

  3. Sherwood Furniture Company – Graph Solution Linear Programming

  4. Sherwood Furniture Company – Graph Solution Constraint 1 Linear Programming

  5. Sherwood Furniture Company – Graph Solution Constraint 1 Linear Programming

  6. Sherwood Furniture Company – Graph Solution Constraint 2 Linear Programming

  7. Sherwood Furniture Company – Graph Solution Constraint 1 & 2 Linear Programming

  8. Sherwood Furniture Company – Graph Solution Constraint 3 Linear Programming

  9. Sherwood Furniture Company – Graph Solution Constraint 1, 2 & 3 Linear Programming

  10. Sherwood Furniture Company – Graph Solution Linear Programming

  11. Sherwood Furniture Company – Graph Solution Linear Programming

  12. Sherwood Furniture Company – Solve Linear Equations Linear Programming

  13. Sherwood Furniture Company – Solve Linear Equations Linear Programming

  14. Sherwood Furniture Company – Solve Linear Equations Linear Programming

  15. Sherwood Furniture Company – Graph Solution Optimal Point (15, 20) Linear Programming

  16. Sherwood Furniture Company – Slack Calculation Linear Programming

  17. Sherwood Furniture Company - Slack Variables Max 20x1 + 10x2 + 0S1 + 0S2 + 0S3 s.t. 4x1 + 3x2 + 1S1 = 120 8x1 + 2x2 + 1S2 = 160 x2 + 1S3 = 32 x1, x2, S1 ,S2 ,S3 >= 0 Linear Programming

  18. Sherwood Furniture Company – Graph Solution 3 1 2 Linear Programming

  19. Sherwood Furniture Company – Slack Calculation Point 1 Point 1 Linear Programming

  20. Sherwood Furniture Company – Graph Solution 3 1 2 Linear Programming

  21. Sherwood Furniture Company – Slack Calculation Point 2 Point 2 Linear Programming

  22. Sherwood Furniture Company – Graph Solution 3 1 2 Linear Programming

  23. Sherwood Furniture Company – Slack Calculation Point 3 Point 3 Linear Programming

  24. Sherwood Furniture Company – Slack Calculation Points 1, 2 & 3 Point 1 Point 2 Point 3 Linear Programming

  25. Sherwood Furniture Company – Slack Variables • For each ≤ constraint the difference between the RHS and LHS (RHS-LHS). It is the amount of resource left over. • Constraint 1; S1 = 0 hrs. • Constraint 2; S2 = 0 hrs. • Constraint 3; S3 = 12 Custom Linear Programming

More Related