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 solutionChapter 4 Solutions
Operations Research : Applications and Algorithms
- Which option is correct for the following system equation? x-y-z=4 2x-2y-2z=8 5x - 5y - 5z = 20 answer a)Finite solutions b)No solution c)Subzero solutions d)Infinitely many solutions e)Unique solutionarrow_forwardSolve problem 1arrow_forwardRounding the solution of a linear programming problem to the nearest integer values provides a(n): a. integer solution that is optimal. b. integer solution that may be neither feasible nor optimal. c. feasible solution that is not necessarily optimal. d. infeasible solution.arrow_forward
- I need the solution parrow_forwardPlease solve a,b, c, and d.arrow_forwardA construction company has four large bulldozers located at four different garages. The bulldozers are to be moved to four different construction sites. The distances in miles between the bulldozers and the construction sites are given below. Bulldozer/ A B C D Site Students 1 90 75 75 80 solve it 2 35 85 55 65 yourself 3 125 95 90 105 4 45 110 95 115 How should the bulldozers be moved to the construction sites in order to minimize the total distance traveled?arrow_forward
- Solve the following:arrow_forwardYou are given some tasks of size xK, yK and zK respectively and there are at most 9 tasks each. Determine the best that you could achieve if you are to fill up a hole of size SK, for the following values of x, y, z and S, by maximizing the space used (up to S), i.e. minimizing the used space, if any. Show how many tasks of size x, how many tasks of size y and how many tasks of size z are used in each of the three cases. (g) Now if we relax the requirement so that there are no upper limits on the number of tasks for each type, determine the maximal space usage and the task mix. (h) If we tighten the requirement so that there are still at most 9 tasks of each size, but we also require that each type of tasks must be used at least once, determine maximal space usage and the task mix. Case 1 2 3 X 22 26 28 y 33 43 65 50 77 74 S 488 556 777 You could complete the following table. Fill in the number of tasks inside the brackets and the corresponding maximal usage. (At most 9 tasks each (g)…arrow_forwardQ6: Find the total cost of transportation for the following problem using the method of transportation is less cost. Quantity 2000 Quantity From To 2000 B 500 350 700 850 Cost Int. E F G A 2 5 B 4 9 4 On76arrow_forward
- Please solve the following questionarrow_forwardConstruct a table of optimal Huffman code based on Table 1arrow_forwardThe following table belongs to the optimal solition nit of a Lineer Programming Problem. Obtain the formulation of the initial problem. XI x2 ke -Jig 38 X₁ Xu O 1 O 19 41 14 23 38 xu O O 1 VI 38 A 38 AL A2 (1-38M) (2-19M) 38 19 -3 38 5 L 응급 31 19 19 solution 7' 2 5arrow_forward
- Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks Cole