Preview

Jenny's Bakery: The Real World Problem

Good Essays
Open Document
Open Document
889 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Jenny's Bakery: The Real World Problem
The real world problem that we will use is:
Jenny’s bakery makes two types of cakes:
Angel food cake which sells for $25
Red Velvet Cake which sells for $35
Both cakes are the same size, but the decorating and assembly time required for the angel food cake is 2 hours, while the time for the red velvet cake is 3 hours. There are 450 hours of labor available for production. How many of each cake should Jenny make to maximize revenue? For this problem we will use linear optimization, which is a method for finding the maximum or minimum of a function over a given system of inequalities, with each representing a constraint. An example of a constraint would be how much you spend, make, number of employees, space and time. In the real world problem that we are using, the constraints would be 450 hours of labor available for production.
…show more content…
Your two variables are the two options given to you in the problem, so the options that we have are angel food cake and red velvet cake. Next with your constraint, which I had said was 450 hours of labor available for production, you need to write an inequality. For all of our inequalities in linear optimization, you will use a greater than or less than sign, which means all of your lines will be solid. Going back to your two variables, you use these and your constraint to write the inequality, which with this problem you will only have one inequality. Since 450 hours is the maximum amount of hours for production, your inequality should start with 450 is greater than or equal to your inequality. Now take your two variables and add in their amount of numbers that was set to them from the problem. X will have 2 hours and Y will have 3 hours, you take these two variables and add them to 450 is greater than or equal to. Now you have a inequality of 450 is greater than or equal to 2X plus

You May Also Find These Documents Helpful

  • Good Essays

    Food Booth Case Study

    • 1116 Words
    • 5 Pages

    As she has only $1500 for purchasing food articles, and the cost of all the articles cannot exceed this amount of $1500, the constraint can be expressed as…

    • 1116 Words
    • 5 Pages
    Good Essays
  • Good Essays

    ECO 550 FINAL EXAM

    • 1177 Words
    • 4 Pages

    4. The production manager for Beer etc. produces 2 kinds of beer: light (L) and dark (D). Two resources used to produce beer are malt and wheat. He can obtain at most 4800 oz of malt per week and at most 3200 oz of wheat per week respectively. Each bottle of light beer requires 12 oz of malt and 4 oz of wheat, while a bottle of dark beer uses 8 oz of malt and 8 oz of wheat. Profits for light beer are $2 per bottle, and profits for dark beer are $1 per bottle. If the production manager decides to produce of 0 bottles of light beer and 400 bottles of dark beer, it will result in slack of…

    • 1177 Words
    • 4 Pages
    Good Essays
  • Satisfactory Essays

    Busn312 Hw3A

    • 727 Words
    • 3 Pages

    Linear programming problems have a.|linear objective functions, non-linear constraints.| b.|non-linear objective functions, non-linear constraints.| c.|non-linear objective functions, linear constraints.| d.|linear objective functions, linear constraints.| ____C 7. The first step in formulating a linear programming problem is a.|Identify any upper or lower bounds on the decision variables.| b.|State the constraints as linear combinations of the decision variables.| c.|Understand the problem.| d.|Identify the decision variables.| e.|State the objective…

    • 727 Words
    • 3 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Economics 5050

    • 1669 Words
    • 7 Pages

    A restaurant currently has two cooks and ten waiters. Cooks earn $10 an hour and waiters earn $5 an hour. The last cook added 40 meals served to total output, while the last waiter added 25 meals served to total output. In order to maximize the number of meals served with a fixed budget, the manager should…

    • 1669 Words
    • 7 Pages
    Satisfactory Essays
  • Better Essays

    Imp 2 Cookies Cover Letter

    • 1219 Words
    • 5 Pages

    The main goal of the Cookies unit was to solve the Unit Problem. The unit problem introduced us to the Woos, the owners of a cookie bakery. The Woos want to find the most profitable combination of plain and iced cookies to bake and sell in their store. We were given several constraints for this problem. According to the Woo’s recipes, a dozen normal cookies requires one pound of cookie dough, and a dozen iced cookies requires .7 pounds of cookie dough. The Woo family only has 110 pounds of cookie dough in stock, which will affect the number of cookies that can be made. The iced cookies also need icing, obviously. A dozen of iced cookies required .4 pounds of icing and the Woos only have 32 pounds of icing in stock. There are also limitations for the oven space in the Woo’s kitchen. It can only hold 140 cookies at a time. The last limitation that the Woo family’s problem has is time. The preparation time of the plain cookies is .1 hours, and the preparation time of the iced cookies is .15 hours. The Woo family only has 15 hours to prepare the iced and plain cookies for the oven. All of these constraints decide the number of cookies that you can and cannot have. The second half of the problem was concerning the combination of normal cookies and iced cookies that would give the most profitable result. A dozen of plain cookies cost $4.50 to make and sell for $6.00 and a dozen of iced cookies cost $5.00 to make, and sell for 7.00. So, they make a profit of $1.50 per dozen of plain cookies and $2.00 per dozen of iced cookies. The Woo family knows that they can sell all the cookies they make. The point of this problem was to find the most profitable combination of iced and normal cookies.…

    • 1219 Words
    • 5 Pages
    Better Essays
  • Good Essays

    Cheat sheet OMIS 355

    • 727 Words
    • 3 Pages

    The following linear programming problem has been written to plan the production of two products. The company wants to maximize its profits. 
X1 = number of product 1 produced in each batch X2 = number of product 2 produced in each batch 
MAX: 150 X1 + 250 X2
Subject to: 2 X1 + 5 X2 ≤ 200 − resource 1 
3 X1 + 7 X2 ≤ 175 − resource 2 X1, X2 ≥ 0. How many units of resource 1 are consumed by each unit of product 1 produced? 2…

    • 727 Words
    • 3 Pages
    Good Essays
  • Satisfactory Essays

    A bakery buys sugar in 15-pound bags. The bakery uses 5000 bags of sugar each year. Carrying costs are $20 per bag per year. Ordering costs are estimated at $5 per order. Assume that the bakery is open 250 days a year and its daily demand is estimated at 20 bags. It takes 5 days for each order of sugar to be filled.…

    • 1687 Words
    • 12 Pages
    Satisfactory Essays
  • Good Essays

    Mat 540 Stateline shipping

    • 1018 Words
    • 5 Pages

    Here the demand constraint + + ++ + ≤ 65 represents the number of barrels transported to the waste disposal site Whitewater from all the six plants. The barrel of wastes that can accommodate in the waste disposal site Whitewater is limited to 65 barrels. The demand constraints are ≤ inequalities because the total demand (65+80+105) = 250 exceeds the total supply (26+42+53+29+38) = 223.…

    • 1018 Words
    • 5 Pages
    Good Essays
  • Satisfactory Essays

    Julia's Food Booth

    • 364 Words
    • 2 Pages

    The linear programming results show that Julie will have a profit of $2250 minus the $1000 for booth rent for the month which will leave $1150. She only wants to make a profit of $1000 therefore she has at least $150 to keep $50 to purchase more sandwiches and $100 to pay a friend. After the purchase of more sandwiches Julie made need some additional help. Therefore it will be feasible to hire a friend for extra help which could help to generate more profit.…

    • 364 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    7. When using linear programming model to solve the “diet” problem, the objective is generally to maximize profit.…

    • 894 Words
    • 6 Pages
    Good Essays
  • Good Essays

    Direct Labour

    • 844 Words
    • 4 Pages

    The company’s plant has a capacity of 130,000 direct labor-hours per year on a single-shift basis. The company’s present employees and equipment can produce all five products.…

    • 844 Words
    • 4 Pages
    Good Essays
  • Satisfactory Essays

    Mid Term Exams

    • 1230 Words
    • 5 Pages

    | The owner of Chips etc. produces 2 kinds of chips: Lime (L) and Vinegar (V). He has a limited amount of the 3 ingredients used to produce these chips available for his next production run: 4800 ounces of salt, 9600 ounces of flour, and 2000 ounces of herbs. A bag of Lime chips requires 2 ounces of salt, 6 ounces of flour, and 1 ounce of herbs to produce; while a bag of Vinegar chips requires 3 ounces of salt, 8 ounces of flour, and 2 ounces of herbs. Profits for a bag of Lime chips are $0.40, and for a bag of Vinegar chips $0.50. Which of the following is not a feasible production combination?Answer…

    • 1230 Words
    • 5 Pages
    Satisfactory Essays
  • Good Essays

    Question 1 Graphical solution (16 marks) For a linear programming model given below: Decision variables x1  Units of product 1 to produce. x2 – Units of product 2 to produce. Objective function Maximize 4.0x1 + 3.6x2 Constraints Constraint 1: 11x1 + 5x2 > 55 Constraint 2: 3x1 + 4x2 < 36 Constraint 3: 4x1 – 9x2 < 0 Nonnegativity: x1, x2 >= 0 Solve this linear programming model by using the graphical approach (Graph paper is provided on the next page). For your graphical solution,  Label the axes.  Draw and label each constraint. Show your procedure of drawing Constraint 3 only.  For each constraint line, determine and label which side is feasible. Briefly explain how to determine the feasible side for Constraint 3 only.  Shade and label the feasible region.  Identify all feasible corner points and determine the coordinates of each feasible corner point. Show only your calculations for the corner point determined by Constraints 1 and 2.  Determine the optimal solution and objective function value.  For all calculations in this question, please…

    • 2847 Words
    • 12 Pages
    Good Essays
  • Good Essays

    Sundown Bakery Case Study

    • 1048 Words
    • 5 Pages

    Sundown Bakery reads like a typical small business story where rapid growth can be as detrimental and hard to manage as rapid contraction. Small business owners are typically the type of people who are rich with specific skills, but are missing fundamental management skills and are often ill equipped when it comes to managing rapid expansion of their individual business. Sundown Bakery is no different in my opinion. Through this paper it is my intention to clearly identify some of the issues resulting from the rapid expansion and to recommend some possible solutions that would have helped them avoid their current situation.…

    • 1048 Words
    • 5 Pages
    Good Essays
  • Satisfactory Essays

    1.) How do changes in the demographic makeup of Sundown Bakeries reflect transformation of the large workforce?…

    • 453 Words
    • 2 Pages
    Satisfactory Essays