Homework Help is Here – Start Your Trial Now!
Business
Operations Management
Consider the following linear program, which maximizes profit for two products: regular (R) and super (S): MAX 5R + 75S s.t. 1.2 R+ 1.6 S≤ 600 assembly (hours) 0.8 R +0.5 S s 300 paint (hours) 0.16 R+ 0.4 S ≤ 100 inspection (hours) R, S > O See the sensitivity report provided below: Variable Cells Cell $C$28 Regular-R $C$29 Super S Constraints Name Cell SFS6 assembly (hours) $F$7 paint (hours) SFSB inspection (hours) Name Final Reduced Objective Allowable Allowable Value Cost Coefficient Increase Decrease 5 25 1E+30 75 1E+30 62.5 0 250 -25 0 Final Shadow Constraint Allowable Allowable Value Price R.H. Side Increase Decrease 400 125 100 0 0 187.5 600 300 100 1E+30 1E+30 50 Regarding the resource "assembling (hours)"_ Please choose the option that best fit the empty space above. 200 175 100 If the company has more hours of this process they will be willing to pay more for this resource. If the company has only 450 hours of this process they will be willing to pay less for this resource. If the company has more hours of this process they will be willing to pay less for this resource. If the company has only 150 hours of this process they will no longer be willing to pay nothing (zero) for this resource. None of the above

Consider the following linear program, which maximizes profit for two products: regular (R) and super (S): MAX 5R + 75S s.t. 1.2 R+ 1.6 S≤ 600 assembly (hours) 0.8 R +0.5 S s 300 paint (hours) 0.16 R+ 0.4 S ≤ 100 inspection (hours) R, S > O See the sensitivity report provided below: Variable Cells Cell $C$28 Regular-R $C$29 Super S Constraints Name Cell SFS6 assembly (hours) $F$7 paint (hours) SFSB inspection (hours) Name Final Reduced Objective Allowable Allowable Value Cost Coefficient Increase Decrease 5 25 1E+30 75 1E+30 62.5 0 250 -25 0 Final Shadow Constraint Allowable Allowable Value Price R.H. Side Increase Decrease 400 125 100 0 0 187.5 600 300 100 1E+30 1E+30 50 Regarding the resource "assembling (hours)"_ Please choose the option that best fit the empty space above. 200 175 100 If the company has more hours of this process they will be willing to pay more for this resource. If the company has only 450 hours of this process they will be willing to pay less for this resource. If the company has more hours of this process they will be willing to pay less for this resource. If the company has only 150 hours of this process they will no longer be willing to pay nothing (zero) for this resource. None of the above

Practical Management Science
Practical Management Science
6th Edition
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:WINSTON, Wayne L.
Chapter2: Introduction To Spreadsheet Modeling
Section: Chapter Questions
Problem 20P: Julie James is opening a lemonade stand. She believes the fixed cost per week of running the stand...
See similar textbooks
icon
Related questions
Question
Consider the following linear program, which maximizes profit for two products: regular (R) and super (S): MAX 5R + 75S s.t. 1.2 R+ 1.6 S ≤ 600 assembly (hours) 0.8 R +0.5 S ≤ 300 paint (hours) 0.16 R+ 0.4 S ≤ 100 inspection (hours) R,S >=0 See the sensitivity report provided below: Variable Cells Cell $C$28 Regular-R $C$29 Super-S Constraints Name Cell $F$6 assembly (hours) $F$7 paint (hours) $F$8 inspection (hours) Name Final Reduced Objective Allowable Allowable Value Cost Coefficient Increase Decrease 25 1E+30 62.5 0 250 -25 0 400 125 100 Final Shadow Constraint Allowable Allowable Value Price R.H. Side Increase Decrease 5 75 1E+30 0 0 187.5 600 300 100 1E+30 1E+30 50 Regarding the resource "assembling (hours)". Please choose the option that best fit the empty space above. 200 175 100 O If the company has more hours of this process they will be willing to pay more for this resource. O If the company has only 450 hours of this process they will be willing to pay less for this resource. ○ If the company has more hours of this process they will be willing to pay less for this resource. O If the company has only 150 hours of this process they will no longer be willing to pay nothing (zero) for this resource. None of the above
Transcribed Image Text:Consider the following linear program, which maximizes profit for two products: regular (R) and super (S): MAX 5R + 75S s.t. 1.2 R+ 1.6 S ≤ 600 assembly (hours) 0.8 R +0.5 S ≤ 300 paint (hours) 0.16 R+ 0.4 S ≤ 100 inspection (hours) R,S >=0 See the sensitivity report provided below: Variable Cells Cell $C$28 Regular-R $C$29 Super-S Constraints Name Cell $F$6 assembly (hours) $F$7 paint (hours) $F$8 inspection (hours) Name Final Reduced Objective Allowable Allowable Value Cost Coefficient Increase Decrease 25 1E+30 62.5 0 250 -25 0 400 125 100 Final Shadow Constraint Allowable Allowable Value Price R.H. Side Increase Decrease 5 75 1E+30 0 0 187.5 600 300 100 1E+30 1E+30 50 Regarding the resource "assembling (hours)". Please choose the option that best fit the empty space above. 200 175 100 O If the company has more hours of this process they will be willing to pay more for this resource. O If the company has only 450 hours of this process they will be willing to pay less for this resource. ○ If the company has more hours of this process they will be willing to pay less for this resource. O If the company has only 150 hours of this process they will no longer be willing to pay nothing (zero) for this resource. None of the above
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Practical Management Science
Practical Management Science
Operations Management
ISBN:
9781337406659
Author:
WINSTON, Wayne L.
Publisher:
Cengage,
Operations Management
Operations Management
Operations Management
ISBN:
9781259667473
Author:
William J Stevenson
Publisher:
McGraw-Hill Education
Operations and Supply Chain Management (Mcgraw-hi…
Operations and Supply Chain Management (Mcgraw-hi…
Operations Management
ISBN:
9781259666100
Author:
F. Robert Jacobs, Richard B Chase
Publisher:
McGraw-Hill Education
Business in Action
Business in Action
Operations Management
ISBN:
9780135198100
Author:
BOVEE
Publisher:
PEARSON CO
Purchasing and Supply Chain Management
Purchasing and Supply Chain Management
Operations Management
ISBN:
9781285869681
Author:
Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:
Cengage Learning
Production and Operations Analysis, Seventh Editi…
Production and Operations Analysis, Seventh Editi…
Operations Management
ISBN:
9781478623069
Author:
Steven Nahmias, Tava Lennon Olsen
Publisher:
Waveland Press, Inc.
SEE MORE TEXTBOOKS