Explanation of Solution
Formulation of Linear program (LP) to maximize the revenue from candy sales:
Let “xij” be the ounces of ingredient “i” used to make candy “j”.
- Let ingredient 1 is sugar, 2 is nuts, and 3 is chocolate. The candy 1 is slugger candy and 2 is easy out candy.
- The objective of function is to maximize the revenue from the candy sales.
- Each ounce of out candy can be sold for 25 cents and each ounce of slugger candy can be sold for 20 cents.
Therefore, the objection function is,
Constraint 1:
At present, 100 oz of sugar is in the stock.
Constraint 2:
At present, 20 oz of nuts is in the stock.
Constraint 3:
At present, 30 oz of nuts is in the stock.
Constraint 4:
At least, 20% of nuts must be there in easy out candy.
Constraint 5:
At least, 10% of nuts must be there in slugger candy.
Constraint 6:
At least, 10% of chocolate must be there in slugger candy
Trending nowThis is a popular solution!
Chapter 3 Solutions
Operations Research : Applications and Algorithms
- 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…arrow_forwardIKEO is a furniture manufacturer which produces two sizes of wood blocks (type A and B) thatare used to make either a table or a chair. A table is made of a type A and a type B wood blocks,while a chair is made of a type A and two type B wood blocks.A table makes RM 3 profit, and a chair makes RM 5 profit. If M number of type A and Nnumber of type B wood blocks are produced, how many tables and chairs should themanufacturer make to obtain the greatest profit?For example, let M = 12 and N = 12.By making 4 tables (4 type A and 4 type B) and 4 chairs (4 type A and 8 type B), themanufacturer gain profit as follows,Profit = (RM 3) × 4 + (RM 5) × 4 = RM 32.If the manufacturer makes 2 more tables and 1 less chair, the profit will be increased as follows,Profit = (RM 3) × 6 + (RM 5) × 3 = RM 33.Is this the greatest profit?Write a complete C++ program to help the manufacturer determine the greatest profit obtainfrom making tables and chairs with a given number of M type A and N type B wood…arrow_forwardA company owns the same asset in a ASIAN plant and in a UK plant . It has B $2,000,000 and a salvage value of 20% of B . For tax depreciation purposes, ASIA allows a straight line write-off over 5 years, while the UK allows SL write-off over 8 years. The general managers of the two plants want to know the difference in the depreciation amount for year 5.arrow_forward
- Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole