Scribd Logo
Upload

Welcome to Scribd!

  • 59 views

    Ga 2

    Uploaded by

    Pradnya Wadia
    The document describes a linear programming problem to maximize profits from producing two types of candy, Easy Out and Slugger. The decision variables are the ounces of sugar, nuts, and chocolate in each candy. Constraints include having 20% nuts in Easy Out Candy and limits on total amounts of each ingredient. The objective is to maximize total profits by choosing the optimal amounts of ingredients in each candy.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Ga 2

    Uploaded by

    Pradnya Wadia
    59 views1 page
    The document describes a linear programming problem to maximize profits from producing two types of candy, Easy Out and Slugger. The decision variables are the ounces of sugar, nuts, and chocolate in each candy. Constraints include having 20% nuts in Easy Out Candy and limits on total amounts of each ingredient. The objective is to maximize total profits by choosing the optimal amounts of ingredients in each candy.

    Original Description:

    assignment

    Original Title

    GA 2

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes a linear programming problem to maximize profits from producing two types of candy, Easy Out and Slugger. The decision variables are the ounces of sugar, nuts, and chocolate in each candy. Constraints include having 20% nuts in Easy Out Candy and limits on total amounts of each ingredient. The objective is to maximize total profits by choosing the optimal amounts of ingredients in each candy.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    59 views1 page

    Ga 2

    Uploaded by

    Pradnya Wadia
    The document describes a linear programming problem to maximize profits from producing two types of candy, Easy Out and Slugger. The decision variables are the ounces of sugar, nuts, and chocolate in each candy. Constraints include having 20% nuts in Easy Out Candy and limits on total amounts of each ingredient. The objective is to maximize total profits by choosing the optimal amounts of ingredients in each candy.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 1

    Q No 4.

    49
    Let xij = no. of ounces of product j in candy i. Where j = 1,2 and 3 represents sugar,
    nuts and chocolate respectively and i = 1 and 2 represents Easy Out and Slugger
    Candy respectively.
    Note:

    Ounces of Easy Out Candy produced = x11 + x12 + x13


    Ounces of Slugger Candy produced = x21 + x22 + x23

    Therefore, to have 20 % of nuts in Easy Out Candy, then:

    Multiplying by x11 + x12 + x13 on both sides and rearranging, we have


    0.8 x12 0.2 x11 0.2 x13 0

    (Nuts in Easy Out Constraint)

    The same procedure will follow for finding the no. of ounces of nuts and chocolate
    in Slugger Candy.
    Max z =

    1.2 x11

    + 1.2 x12

    + 1.2x13

    x11

    + 1.4 x21

    + 1.4 x22

    x21

    x12

    x22

    x13

    -0.2x11

    xij 0

    + 0.8x12

    + 1.4 x23

    x23

    - 0.2 x13

    10000

    (Sugar)

    2000

    (Nuts)

    3000

    (Chocolate)

    (Nuts in Easy Out)

    - 0.1 x21

    + 0.9x22

    - 0.1 x23

    (Nuts in Slugger)

    - 0.1 x21

    - 0.1 x22

    + 0.9x23

    (Choc. in Slugger)

    You might also like