Consider the seretvty report below that shows the solution of a near program with 2 decision...

Transcribed Image Text:

Consider the seretvty report below that shows the solution of a near program with 2 decision variables, constrants with sign and a Maimisation ohjective function. twe noeae the number of nishing hours avalable by 70 houn, which of the folowing scenanon wit happe Variable Cells Final Reduced Objective Allowable Allowable Model Variable Name Value Cost Coefficient Increase Decrease Gloves Standard 500.000 0.000 5.000 7.000 1.000 R 150.000 0.000 8.000 2.000 4.667 Gloves Deluxe Constraints Final Shadow Constraint Allowable Allowable Constraint Number Value Price R.H. Side Increase Decrease Name 175.000 Cutting and Dyeing Hours Used Finishing Hours Used Packaging and Shipping Hours Used 725.000 0.000 900.000 IE+30 300.000 3.000 300.000 100.000 166.667 2. 100.000 28.000 100,000 35.000 25.000 3. Seiect one O The optimal sottion witl emaini the same and the objective tunction will increase by 300 Ob. The optimal solution wil change and the otjective function will remain the same O The optimal solution wil change and the objective function will increae by 300 Od. The optimal solution will remain the same and the objective function will inomate by 3 O The objnctive function will increase by 210 Consider the seretvty report below that shows the solution of a near program with 2 decision variables, constrants with sign and a Maimisation ohjective function. twe noeae the number of nishing hours avalable by 70 houn, which of the folowing scenanon wit happe Variable Cells Final Reduced Objective Allowable Allowable Model Variable Name Value Cost Coefficient Increase Decrease Gloves Standard 500.000 0.000 5.000 7.000 1.000 R 150.000 0.000 8.000 2.000 4.667 Gloves Deluxe Constraints Final Shadow Constraint Allowable Allowable Constraint Number Value Price R.H. Side Increase Decrease Name 175.000 Cutting and Dyeing Hours Used Finishing Hours Used Packaging and Shipping Hours Used 725.000 0.000 900.000 IE+30 300.000 3.000 300.000 100.000 166.667 2. 100.000 28.000 100,000 35.000 25.000 3. Seiect one O The optimal sottion witl emaini the same and the objective tunction will increase by 300 Ob. The optimal solution wil change and the otjective function will remain the same O The optimal solution wil change and the objective function will increae by 300 Od. The optimal solution will remain the same and the objective function will inomate by 3 O The objnctive function will increase by 210

Answer rating: 100% (QA)

ANS WER e The objective function will i... View the full answer