Scribd Logo
Upload

Welcome to Scribd!

  • 248 views

    Tugas 1 Lisa

    Uploaded by

    Dhila Kurokawa Chii
    The bakery produces coffee cakes and Danish pastries using flour and sugar. There is a demand for 8 pans of coffee cake. Coffee cakes require 5 pounds of flour and 2 pounds of sugar per pan, while Danish require 5 pounds of flour and 4 pounds of sugar. Coffee cakes have a $1 profit per pan and Danish have a $5 profit per pan. The bakery wants to maximize its total profit. This can be modeled as a linear programming problem to determine the optimal number of each item to produce. Solving the model shows the bakery should produce 2 pans of coffee cake and 3 pans of Danish for a maximum profit of $17.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content

    Tugas 1 Lisa

    Uploaded by

    Dhila Kurokawa Chii
    248 views3 pages
    The bakery produces coffee cakes and Danish pastries using flour and sugar. There is a demand for 8 pans of coffee cake. Coffee cakes require 5 pounds of flour and 2 pounds of sugar per pan, while Danish require 5 pounds of flour and 4 pounds of sugar. Coffee cakes have a $1 profit per pan and Danish have a $5 profit per pan. The bakery wants to maximize its total profit. This can be modeled as a linear programming problem to determine the optimal number of each item to produce. Solving the model shows the bakery should produce 2 pans of coffee cake and 3 pans of Danish for a maximum profit of $17.

    Original Description:

    ASPK Analisa Pengambilan Keputusan

    Copyright

    © © All Rights Reserved

    Available Formats

    XLSX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The bakery produces coffee cakes and Danish pastries using flour and sugar. There is a demand for 8 pans of coffee cake. Coffee cakes require 5 pounds of flour and 2 pounds of sugar per pan, while Danish require 5 pounds of flour and 4 pounds of sugar. Coffee cakes have a $1 profit per pan and Danish have a $5 profit per pan. The bakery wants to maximize its total profit. This can be modeled as a linear programming problem to determine the optimal number of each item to produce. Solving the model shows the bakery should produce 2 pans of coffee cake and 3 pans of Danish for a maximum profit of $17.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xlsx, pdf, or txt
    248 views3 pages

    Tugas 1 Lisa

    Uploaded by

    Dhila Kurokawa Chii
    The bakery produces coffee cakes and Danish pastries using flour and sugar. There is a demand for 8 pans of coffee cake. Coffee cakes require 5 pounds of flour and 2 pounds of sugar per pan, while Danish require 5 pounds of flour and 4 pounds of sugar. Coffee cakes have a $1 profit per pan and Danish have a $5 profit per pan. The bakery wants to maximize its total profit. This can be modeled as a linear programming problem to determine the optimal number of each item to produce. Solving the model shows the bakery should produce 2 pans of coffee cake and 3 pans of Danish for a maximum profit of $17.

    Copyright:

    © All Rights Reserved
    Download as XLSX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as xlsx, pdf, or txt
    of 3

    Ditulis tangan di lembar folio bergaris

    Question no.11
    The Crumb and Custard Bakery makes both coffee cakes an Danish in large pans.
    The main ingredients are flour and sugar.
    There are 25 pounds of flour and 16 pounds of sugar available and the demand for coffee cakes is 8.
    Five pounds of flour and 2 pounds of sugar are required to make one pan of coffee cake,
    and 5 pounds of flour and 4 pounds of sugar are required to make one pan of Danish.
    One pan of coffee cake has a profit of $1,
    and one pan of Danish has a profit of $5.
    Determine the number of pans of cake and Danish that the bakery must produce each day so that
    profit will be maximized.
    Formulate a linear programming model for this problem and solve using the simplex method.
    Solution :
    Product
    (pan)
    Coffee cake
    Danish

    The main Ingredients


    Flour
    Sugar
    (pounds)
    (pounds)
    5
    2
    5
    4

    Variabel :
    x1 = the number of pans of coffee cake
    x2 = the number of pans of Danish

    Profit
    per pan

    $1
    $5

    x2

    Objective Function :
    Maximized : Z = x1 + 5x2

    Constraint Function :
    5x1 + 5x2 < 25
    2x1 + 4x2 < 16
    x1 > 8
    x1 , x2 > 0

    x1
    0
    5
    0
    8

    x1=0, x2=5 and x1=5, x2=0


    x1=0, x2=4 and x1=8, x2=0
    0
    0

    x2
    5
    0
    4
    0
    2

    5
    x1

    Linear Programming :
    x1 = 2
    x2 = 3
    Z = 2 + 15 = 17 $

    Max.Z
    Pembatas 1
    Pembatas 2
    Pembatas 3

    x1

    x2

    S1

    S2

    =
    =
    =
    =

    x1
    5x1
    2x1
    x1

    + 5x2
    + 5x2
    + 4x2

    + S1

    5
    2
    1

    5
    4
    0

    1
    0
    0

    0
    1
    0

    0
    0
    1

    Cj
    Var.b
    S1
    S2
    S3
    Zj
    Cj-Zj

    1
    x1
    5
    2
    1
    0
    1

    5
    x2
    5
    4
    0
    0
    5

    0
    S1
    1
    0
    0
    0
    0

    + S2

    Iterasi 1
    Cb
    0
    0
    0

    x1 =
    x2 =
    S1 =
    S2 =
    S3 =
    Z=

    0
    0
    25
    16
    8
    0

    25/5 = 5
    16/4=4

    4= pivot

    Iterasi 2
    Cb
    0
    5
    0

    x1 =
    x2 =
    S1 =
    S2 =
    S3 =
    Z=

    Cj
    Var.b
    S1
    x2
    S3
    Zj
    Cj-Zj
    0
    4
    5
    0
    8
    20

    1
    x1
    2.5
    0.5
    1
    2.5
    -1.5

    5
    x2
    0
    1
    0
    5
    0

    0
    S1
    1
    0
    0
    0
    0

    S3

    RHS

    + S3

    = 25
    = 16
    =8

    x1
    x2
    S1
    S2
    S3

    0
    S2
    0
    1
    0
    0
    0

    0
    S3
    0
    0
    1
    0
    0

    Q
    25
    16
    8
    0

    0
    S2
    -1.25
    0.25
    0
    1.25
    -1.25

    0
    S3
    0
    0
    1
    0
    0

    25
    16
    8

    karena pivot=4 ada di baris 2


    Q
    5
    4
    8
    20

    baris 1 - 5/4*baris 2
    baris 2 dibagi 4
    baris 3 - 0/4*baris 2

    You might also like