
Concept explainers
Explanation of Solution
Finding optimal solution for the problem:
In the problem, it is given that the James Breed bakes two types of cakes, cheesecakes and Black forest cakes. At most 65 cakes can be baked during any month. Also, it takes 50cents to hold cheesecake and 40cents to hold a black forest cake. The costs per cake and the demand for cakes which must be met on time are given.
The tableau is given below
Item | Month 1 | Month 2 | Month 3 | |||
Demand | Cost/cake(S) | Demand | Cost/Case(S) | Demand | Cost/Cake(S) | |
Cheesecake | 40 | 3.00 | 30 | 3.40 | 20 | 3.80 |
Black forest | 20 | 2.50 | 30 | 2.80 | 10 | 3.40 |
Let,
Thus the objective function is,
Minimize,
The problem is subjected to the constraints that during any month, he can bake at most 65 cakes.
Thus,
Also, it is given than the amount of cakes in the inventory is equal to the difference of cakes previously in the inventory plus the total production and the demand.
Thus, the constraints become,
In the above, all the variables are greater than 0.
Therefore, the LP can be formulated as,
Minimize,

Want to see the full answer?
Check out a sample textbook solution
Chapter 4 Solutions
Operations Research : Applications and Algorithms
- what is a feature in the Windows Server Security Compliance Toolkit, thank you.arrow_forwardYou will write a program that allows the user to keep track of college locations and details about each location. To begin you will create a College python class that keeps track of the csollege's unique id number, name, address, phone number, maximum students, and average tuition cost. Once you have built the College class, you will write a program that stores College objects in a dictionary while using the College's unique id number as the key. The program should display a menu in this order that lets the user: 1) Add a new College 2) Look up a College 4) Delete an existing College 5) Change an existing College's name, address, phone number, maximum guests, and average tuition cost. 6) Exit the programarrow_forwardShow all the workarrow_forward
- Show all the workarrow_forward[5 marks] Give a recursive definition for the language anb2n where n = 1, 2, 3, ... over the alphabet Ó={a, b}. 2) [12 marks] Consider the following languages over the alphabet ={a ,b}, (i) The language of all words that begin and end an a (ii) The language where every a in a word is immediately followed by at least one b. (a) Express each as a Regular Expression (b) Draw an FA for each language (c) For Language (i), draw a TG using at most 3 states (d) For Language (ii), construct a CFG.arrow_forwardQuestion 1 Generate a random sample of standard lognormal data (rlnorm()) for sample size n = 100. Construct histogram estimates of density for this sample using Sturges’ Rule, Scott’s Normal Reference Rule, and the FD Rule. Question 2 Construct a frequency polygon density estimate for the sample in Question 1, using bin width determined by Sturges’ Rule.arrow_forward
- Generate a random sample of standard lognormal data (rlnorm()) for sample size n = 100. Construct histogram estimates of density for this sample using Sturges’ Rule, Scott’s Normal Reference Rule, and the FD Rule.arrow_forwardCan I get help with this case please, thank youarrow_forwardI need help to solve the following, thank youarrow_forward
- Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole
