Calculating the extra payment: Let BR is the number of brownies eaten daily, IC be the number of scoops of chocolate ice cream eaten daily, CLA is the number of bottles of cola drunk daily and PCS be the pieces of pineapple cheesecake eaten daily. In order to minimize the cost of diet, the following Linear Programming has to be solved: min z= 50 B R + 20 I C + 30 C L A + 80 P C S Such that, 400 B R + 200 I C + 150 C L A + 500 P C S ≥ 500 3 B R + 2 I C ≥ 6 2 B R + 2 I C + 4 C L A + 4 P C S ≥ 10 2 B R + 4 I C + C L A + 5 P C S ≥ 8 B R , I C , C L A , P C S ≥ 0 The output of this Linear Programming is given below: min z= 50 B R + 20 I C + 30 C L A + 80 P C S Subject to constraint 400 B R + 200 I C + 150 C L A + 500 P C S ≥ 500 3 B R + 2 I C ≥ 6 2 B R

OPERATIONS RES APP W/ STUDENT SOL MAN

4th Edition

ISBN: 9780534662257

Author: WINSTON

Publisher: CENGAGE L

See similar textbooks

Expert Solution & Answer

Chapter 5.3, Problem 3P

Explanation of Solution

Calculating the extra payment:

Let BR is the number of brownies eaten daily, IC be the number of scoops of chocolate ice cream eaten daily, CLA is the number of bottles of cola drunk daily and PCS be the pieces of pineapple cheesecake eaten daily.

In order to minimize the cost of diet, the following Linear Programming has to be solved:

min z= 50BR+20IC+30CLA+80PCS

Such that,

400BR+200IC+150CLA+500PCS≥500

3BR+2IC≥6

2BR+2IC+4CLA+4PCS≥10

2BR+4IC+CLA+5PCS≥8

BR,IC,CLA,PCS≥0

The output of this Linear Programming is given below:

min z=50BR+20IC+30CLA+80PCS

Subject to constraint

400BR+200IC+150CLA+500PCS≥500

3BR+2IC≥6

2BR

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 5.3, Problem 1P

Chapter 5.3, Problem 4P

Students have asked these similar questions

When two parties have reached an impasse from which neither can retreat, the situation is said to be in deadlock. How does malnutrition differ from starvation?

a)A thief robbing a store finds 5 items; the items are worth 8,10,7,20 and 11 dollars and weights 2,3,2,7 and 7 pounds. He wants to take as valuable a load as possible, but he can carry at most 9 pounds in his knapsack. What is the maximum worth of items that he can take? b) What if the thief somehow managed to increase the capacity of his knapsack by 2 pounds? What will be the maximum worth of items that he can take then?

A farmer is planning to raise wheat and barley. Each acre of wheat yields a profit of $50, and each acre of barley yields a profit of $70. To sow the crop, two machines, a tractor and a tiller are rented. The tractor is available for 150 hours, and the tiller is available for 200 hours. Sowing an acre of wheat requires 4 hours of tractor time and 1 hour of tilling. Sowing an acre of barley requires 3 hours of tractor time and 2 hours of tilling. How many acres of each crop should be planted to maximize the farmer’s profit? (Let W be the number of acres of wheat to be planted, B the number of acres of barley to be planted and P the profit) What is the objective function for the problem? Excluding the non-negative constraint, how many constraints does the problem have? What is the linear programming model of the problem? In the initial tableau, what is the leaving variable? What is the pivot element in the initial tableau? What is the optimal solution to the problem? After how many…

Knowledge Booster

Solution Summary: The author explains that in order to minimize the cost of diet, the following Linear Programming has to be solved:

Explanation of Solution

Want to see the full answer?

Chapter 5 Solutions