4. Tom would like 3 pints of home brew today and an additional 6 pints of home brew tomorrow. Dick is willing to sell a maximum of 5 pints total at a price of $3.00 per pint today and $2.70 per pint tomorrow. Harry is willing to sell a maximum of 4 pints total at a price of $2.90 per pint today and $2.80 per pint tomorrow. Tom wishes to know what his purchases should be to minimize his cost while satisfying his thirst requirements. (a) Formulate a linear programming model for this problem. (max or min Z=..., subject to ... constraints...) (Let x₁ be the amount of pints of brew bought from Dick today, x₂ be the amount of pints of brew bought from Dick tomorrow, x3 be the amount of pints of brew bought from Harry today, x4 be the amount of pints of brew bought from Harry tomorrow.) (b) Formulate this problem as a transportation problem by constructing the appropriate parameter table (in the format as below). Source Demand 1 2 1 Destination 2 3..... supply (c) Draw the network representation of this problem. (d) Use Excel Solver to obtain an optimal solution.

Purchasing and Supply Chain Management
6th Edition
ISBN:9781285869681
Author:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
Publisher:Robert M. Monczka, Robert B. Handfield, Larry C. Giunipero, James L. Patterson
ChapterC: Cases
Section: Chapter Questions
Problem 5.1SC: Scenario 3 Ben Gibson, the purchasing manager at Coastal Products, was reviewing purchasing...
icon
Related questions
Question
4. Tom would like 3 pints of home brew today and an additional 6 pints of home brew tomorrow.
Dick is willing to sell a maximum of 5 pints total at a price of $3.00 per pint today and $2.70 per
pint tomorrow. Harry is willing to sell a maximum of 4 pints total at a price of $2.90 per pint
today and $2.80 per pint tomorrow.
Tom wishes to know what his purchases should be to minimize his cost while satisfying his thirst
requirements.
(a) Formulate a linear programming model for this problem. (max or min Z=..., subject to ...
constraints...)
(Let x₁ be the amount of pints of brew bought from Dick today,
x₂ be the amount of pints of brew bought from Dick tomorrow,
x3 be the amount of pints of brew bought from Harry today,
x4 be the amount of pints of brew bought from Harry tomorrow.)
(b) Formulate this problem as a transportation problem by constructing the appropriate
parameter table (in the format as below).
Source
Demand
1
2
1
Destination
2 3..... supply
(c) Draw the network representation of this problem.
(d) Use Excel Solver to obtain an optimal solution.
Transcribed Image Text:4. Tom would like 3 pints of home brew today and an additional 6 pints of home brew tomorrow. Dick is willing to sell a maximum of 5 pints total at a price of $3.00 per pint today and $2.70 per pint tomorrow. Harry is willing to sell a maximum of 4 pints total at a price of $2.90 per pint today and $2.80 per pint tomorrow. Tom wishes to know what his purchases should be to minimize his cost while satisfying his thirst requirements. (a) Formulate a linear programming model for this problem. (max or min Z=..., subject to ... constraints...) (Let x₁ be the amount of pints of brew bought from Dick today, x₂ be the amount of pints of brew bought from Dick tomorrow, x3 be the amount of pints of brew bought from Harry today, x4 be the amount of pints of brew bought from Harry tomorrow.) (b) Formulate this problem as a transportation problem by constructing the appropriate parameter table (in the format as below). Source Demand 1 2 1 Destination 2 3..... supply (c) Draw the network representation of this problem. (d) Use Excel Solver to obtain an optimal solution.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 5 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
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