Practical Management Science
Practical Management Science
6th Edition
ISBN: 9781337406659
Author: WINSTON, Wayne L.
Publisher: Cengage,
Bartleby Related Questions Icon

Related questions

bartleby

Concept explainers

Question

A company has three warehouses that supply four stores with a given product. Each warehouse has 30 units of the product. Stores 1, 2, 3, and 4 require 20, 25, 30, and 35 units of the product, respectively. The per unit shipping costs from each warehouse to each store are given in the following table. (Let Xij represent the number of units that flow from warehouse i to store j for i = 1, 2, 3 and j = 1, 2, 3, 4.)

  Store
Warehouse 1 2 3 4
1 7 6 7 6
2 4 7 6 5
3 6 4 4 4

Solve the problem using Solver. Caution: You should note that the amount of supply at the warehouses is less than the amount of demand at the stores. You will need to address this when structuring the flow balance constraints. (Hint: You want to ship everything from the warehouses even though there will be a demand shortage at the stores).
(X11, X12, X13, X14, X21, X22, X23, X24, X31, X32, X33, X34) = ( ??? )

What is the optimal solution to the modified problem?
(X11, X12, X13, X14, X21, X22, X23, X24, X31, X32, X33, X34) = ( ??? )
 
Expert Solution
Check Mark
Still need help?
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

Suppose that shipments are not allowed between warehouse 1 and store 2 or between warehouse 2 and store 3. What is the easiest way to modify the spreadsheet so that you can solve this modified problem?
a) Assign arbitrarily small costs such as $0.01 to the arcs representing these flows.
b) Assign arbitrarily large costs such as $999 to the arcs representing these flows.
(I picked option b, which is correct)

What is the optimal solution to the modified problem?
Solution
Bartleby Expert
by Bartleby Expert
SEE SOLUTION
Follow-up Question

How would you write the optimal solution for these?

Solution
Bartleby Expert
by Bartleby Expert
SEE SOLUTION
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

Suppose that shipments are not allowed between warehouse 1 and store 2 or between warehouse 2 and store 3. What is the easiest way to modify the spreadsheet so that you can solve this modified problem?
a) Assign arbitrarily small costs such as $0.01 to the arcs representing these flows.
b) Assign arbitrarily large costs such as $999 to the arcs representing these flows.
(I picked option b, which is correct)

What is the optimal solution to the modified problem?
Solution
Bartleby Expert
by Bartleby Expert
SEE SOLUTION
Follow-up Question

How would you write the optimal solution for these?

Solution
Bartleby Expert
by Bartleby Expert
SEE SOLUTION
Knowledge Booster
Background pattern image
Operations Management
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, operations-management and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Practical Management Science
Operations Management
ISBN:9781337406659
Author:WINSTON, Wayne L.
Publisher:Cengage,
Text book image
Operations Management
Operations Management
ISBN:9781259667473
Author:William J Stevenson
Publisher:McGraw-Hill Education
Text book image
Operations and Supply Chain Management (Mcgraw-hi...
Operations Management
ISBN:9781259666100
Author:F. Robert Jacobs, Richard B Chase
Publisher:McGraw-Hill Education
Text book image
Business in Action
Operations Management
ISBN:9780135198100
Author:BOVEE
Publisher:PEARSON CO
Text book image
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
Text book image
Production and Operations Analysis, Seventh Editi...
Operations Management
ISBN:9781478623069
Author:Steven Nahmias, Tava Lennon Olsen
Publisher:Waveland Press, Inc.