For a product mix linear programming problem, we use three materials (A, B and C) to make two products (X and Y) to maximize total profit. The following screenshot is the Answer Report generated by Excel.   Given above report, which statement is FALSE?

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...
icon
Related questions
Question

11. 

For a product mix linear programming problem, we use three materials (A, B and C) to make two products (X and Y) to maximize total profit. The following screenshot is the Answer Report generated by Excel.

 

Given above report, which statement is FALSE?

 

Select one:
a.

 

The Material C is used up given the optimal solution.


 

b.

 

The optimal solution is making 5 units of Product X only.


 

c.

 

The Material B is used up given the optimal solution.


 

d.

 

The optimized (maximum) profit is $60.

Objective Cell (Max)
Cell
$C$7
Name
Max Z= Profit
Variable Cells
Cell
Name
$B$4 # built Product X
$C$4
# built Product Y
Constraints
Cell
Name
$D$10 Material A LHS (used)
$D$11 Material B LHS (used)
$D$12 Material C LHS (used)
Original Value
22
Original Value
1
1
Cell Value
10
10
5
Final Value
60
Final Value
5
0
Integer
Contin
Contin
Status Slack
0
2
0
Formula
$D$10<=$F$10 Binding
$D$11<=$F$11 Not Binding
$D$12<=$F$12 Binding
Transcribed Image Text:Objective Cell (Max) Cell $C$7 Name Max Z= Profit Variable Cells Cell Name $B$4 # built Product X $C$4 # built Product Y Constraints Cell Name $D$10 Material A LHS (used) $D$11 Material B LHS (used) $D$12 Material C LHS (used) Original Value 22 Original Value 1 1 Cell Value 10 10 5 Final Value 60 Final Value 5 0 Integer Contin Contin Status Slack 0 2 0 Formula $D$10<=$F$10 Binding $D$11<=$F$11 Not Binding $D$12<=$F$12 Binding
arked out of
00
Flag
gestion
Excel.
Objective Cell (Max)
$C$7
Variable Cells
Cell
$B$4
Constraints
Cell
Name
$D$10 Material A LHS (used)
$D$11 Material B LHS (used)
$D$12 Material C LHS (used)
Variable Cells
Name
#built Product X
# built Product Y
Constraints
Name
Max Z= Profit
Cell
Name
$B$4 #built Product X
$C$4 #built Product Y
Select one:
Ob.
Original Value Final Value
22
60
Original Value Final Value
1
5
1
0
Cell Value
10
10
5
5
0
Final
Value
D
Final Reduced
Objective Allowable Allowable
Value Cost Coefficient Increase Decrease
10
10
5
0
0
Shadow
Price
Name
Cell
$D$10 Material A LHS (used)
$D$11 Material B LHS (used)
$D$12 Material C LHS (used)
Given above reports, which statement is FALSE?
2
0
8
Formula
$D$10<=$F$10 Binding
$D$11<=$F$11 Not Binding
$D$12<=$F$12 Binding
12
10
Integer
Contin
Contin
Status Slack
0
2
0
10
12
5
2
Constraint Allowable Allowable
R.H. Side Increase Decrease
2
4
0
1E+30
0.5
2
2
0
If the RHS of Material A constraint changed to 8, the optimized pro
If the RHS of Material B constraint changed to 10, the optimized pr
Transcribed Image Text:arked out of 00 Flag gestion Excel. Objective Cell (Max) $C$7 Variable Cells Cell $B$4 Constraints Cell Name $D$10 Material A LHS (used) $D$11 Material B LHS (used) $D$12 Material C LHS (used) Variable Cells Name #built Product X # built Product Y Constraints Name Max Z= Profit Cell Name $B$4 #built Product X $C$4 #built Product Y Select one: Ob. Original Value Final Value 22 60 Original Value Final Value 1 5 1 0 Cell Value 10 10 5 5 0 Final Value D Final Reduced Objective Allowable Allowable Value Cost Coefficient Increase Decrease 10 10 5 0 0 Shadow Price Name Cell $D$10 Material A LHS (used) $D$11 Material B LHS (used) $D$12 Material C LHS (used) Given above reports, which statement is FALSE? 2 0 8 Formula $D$10<=$F$10 Binding $D$11<=$F$11 Not Binding $D$12<=$F$12 Binding 12 10 Integer Contin Contin Status Slack 0 2 0 10 12 5 2 Constraint Allowable Allowable R.H. Side Increase Decrease 2 4 0 1E+30 0.5 2 2 0 If the RHS of Material A constraint changed to 8, the optimized pro If the RHS of Material B constraint changed to 10, the optimized pr
Expert Solution
Step 1 Introduction:-

Linear programming is a mathematical technique that is also used in operations management departments. This technique is commonly used to find the best outcome with the maximum profit. Linear programming has various methods; each method is chosen by the companies as per their requirements or based on different factors.

steps

Step by step

Solved in 3 steps

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
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.