Student Suite Cd-rom For Winston's Operations Research: Applications And Algorithms
Student Suite Cd-rom For Winston's Operations Research: Applications And Algorithms
4th Edition
ISBN: 9780534423551
Author: Wayne L. Winston
Publisher: Cengage Learning
Expert Solution & Answer
Book Icon
Chapter 4, Problem 12RP

Explanation of Solution

Optimal solution:

  • Given table:
ProductLaborLumberPaintPrice ($)Variable Cost ($)
11.5232610
2332286
3242317
  • Let,
    • x1 = Number of product I produced
    • x2 = Number of product II produced
    • x3 = Number of product III produced
    • x4 = Amount of additional labor purchased
    • x5 = Amount of additional paint purchased
    • x6 = Amount of additional lumber purchased
    • x7 = Amount of labor, lumber, and paint required for producing product I
    • x8 = Amount of labor, lumber, and paint required for producing product II
    • x9 = Amount of labor, lumber, and paint required for producing product III
    • (d1)- = Underachievement in obtaining a profit of at least $10500
    • (d1)+ = Overachievement in obtaining a profit of at least $10500
    • (d2)- = Underachievement in purchasing no additional labor
    • (d2)+  = Overachievement in purchasing no additional labor
    • (d3)- = Underachievement in purchasing no additional paint
    • (d3)+ = Overachievement in purchasing no additional paint
    • (d4)- =Underachievement in purchasing no additional lumber
    • (d4)+ = Overachievement in purchasing no additional lumber
  • ...

Blurred answer
Students have asked these similar questions
A company manufactures 3 products in 2 different factories. The cost of production and time required for production for each product varies depending on which factory produces it. The time and cost required for production of each product in each factory is provided in the tables in this worksheet. Demand for products 1, 2 and 3 are 200, 240 and 100 units, respectively. There are a total of 3,000 hours available in each factory. Additionally, at least 60% of the total units of Product 1 must be produced in Factory A, and at least 40% of  of the total units of Product 2 must be produced in Factory B. Create a linear programming model and use the Solver add-in to determine the optimal production plan that will minimize total cost. Note: The cost is per unit not per hour. All demand must be met.
Kevin bought a new moulding machine for $3,000. The machine deteriorates with age and requires to trade in for a new one every fifth year of usage. The resale value and the running cost are given in below table. Age of machine (year) 1 3 4 5 Maintenance cost ($) 600 700 800 900 1,000 Resale value ($) 2,000 1,333 1,000 750 500
A company manufactures three products 1, 2, and 3. Each product requires production time in three departments as shown below: PRODUCT DEPARTMENT 1 DEPARTMENT 2 DEPARTMENT 3 1 3 hr/unit 2 hr/unit 1 hr/unit 2 4 hr/unit 1 hr/unit 3 hr/unit 3 2 hr/unit 2 hr/unit 3 hr/unit There are 500, 400, and 300 hours of production time available in the three departments, respectively. If products 1, 2, and 3 contribute $3, $4, and $2.5 per unit to profit, answer the following questions: (You may attach your solution or write in the box) a) Define the decision variables (2 marks). b) Write all constraints (3 marks). c) Write the objective function (define whether it is a maximization or minimization) (1.5 marks)

Chapter 4 Solutions

Student Suite Cd-rom For Winston's Operations Research: Applications And Algorithms

Ch. 4.5 - Prob. 1PCh. 4.5 - Prob. 2PCh. 4.5 - Prob. 3PCh. 4.5 - Prob. 4PCh. 4.5 - Prob. 5PCh. 4.5 - Prob. 6PCh. 4.5 - Prob. 7PCh. 4.6 - Prob. 1PCh. 4.6 - Prob. 2PCh. 4.6 - Prob. 3PCh. 4.6 - Prob. 4PCh. 4.7 - Prob. 1PCh. 4.7 - Prob. 2PCh. 4.7 - Prob. 3PCh. 4.7 - Prob. 4PCh. 4.7 - Prob. 5PCh. 4.7 - Prob. 6PCh. 4.7 - Prob. 7PCh. 4.7 - Prob. 8PCh. 4.7 - Prob. 9PCh. 4.8 - Prob. 1PCh. 4.8 - Prob. 2PCh. 4.8 - Prob. 3PCh. 4.8 - Prob. 4PCh. 4.8 - Prob. 5PCh. 4.8 - Prob. 6PCh. 4.10 - Prob. 1PCh. 4.10 - Prob. 2PCh. 4.10 - Prob. 3PCh. 4.10 - Prob. 4PCh. 4.10 - Prob. 5PCh. 4.11 - Prob. 1PCh. 4.11 - Prob. 2PCh. 4.11 - Prob. 3PCh. 4.11 - Prob. 4PCh. 4.11 - Prob. 5PCh. 4.11 - Prob. 6PCh. 4.12 - Prob. 1PCh. 4.12 - Prob. 2PCh. 4.12 - Prob. 3PCh. 4.12 - Prob. 4PCh. 4.12 - Prob. 5PCh. 4.12 - Prob. 6PCh. 4.13 - Prob. 2PCh. 4.14 - Prob. 1PCh. 4.14 - Prob. 2PCh. 4.14 - Prob. 3PCh. 4.14 - Prob. 4PCh. 4.14 - Prob. 5PCh. 4.14 - Prob. 6PCh. 4.14 - Prob. 7PCh. 4.16 - Prob. 1PCh. 4.16 - Prob. 2PCh. 4.16 - Prob. 3PCh. 4.16 - Prob. 5PCh. 4.16 - Prob. 7PCh. 4.16 - Prob. 8PCh. 4.16 - Prob. 9PCh. 4.16 - Prob. 10PCh. 4.16 - Prob. 11PCh. 4.16 - Prob. 12PCh. 4.16 - Prob. 13PCh. 4.16 - Prob. 14PCh. 4.17 - Prob. 1PCh. 4.17 - Prob. 2PCh. 4.17 - Prob. 3PCh. 4.17 - Prob. 4PCh. 4.17 - Prob. 5PCh. 4.17 - Prob. 7PCh. 4.17 - Prob. 8PCh. 4 - Prob. 1RPCh. 4 - Prob. 2RPCh. 4 - Prob. 3RPCh. 4 - Prob. 4RPCh. 4 - Prob. 5RPCh. 4 - Prob. 6RPCh. 4 - Prob. 7RPCh. 4 - Prob. 8RPCh. 4 - Prob. 9RPCh. 4 - Prob. 10RPCh. 4 - Prob. 12RPCh. 4 - Prob. 13RPCh. 4 - Prob. 14RPCh. 4 - Prob. 16RPCh. 4 - Prob. 17RPCh. 4 - Prob. 18RPCh. 4 - Prob. 19RPCh. 4 - Prob. 20RPCh. 4 - Prob. 21RPCh. 4 - Prob. 22RPCh. 4 - Prob. 23RPCh. 4 - Prob. 24RPCh. 4 - Prob. 26RPCh. 4 - Prob. 27RPCh. 4 - Prob. 28RP
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole