Scribd Logo
Upload

Welcome to Scribd!

  • 71 views

    Activity 3 C

    Uploaded by

    Alyssa Mae Honson
    The document describes a linear programming problem to maximize profit for a metal company that produces aluminum frying pans and casserole dishes given constraints on available aluminum, machine time, and other supplies. It provides the linear program formulation with objectives and constraints. The optimal solution is found to be producing 8 frying pans and 6 casserole dishes for a maximum profit of P2,400.

    Copyright:

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

    Activity 3 C

    Uploaded by

    Alyssa Mae Honson
    71 views4 pages
    The document describes a linear programming problem to maximize profit for a metal company that produces aluminum frying pans and casserole dishes given constraints on available aluminum, machine time, and other supplies. It provides the linear program formulation with objectives and constraints. The optimal solution is found to be producing 8 frying pans and 6 casserole dishes for a maximum profit of P2,400.

    Original Description:

    Activity3C

    Original Title

    Activity3C

    Copyright

    © © All Rights Reserved

    Available Formats

    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 profit for a metal company that produces aluminum frying pans and casserole dishes given constraints on available aluminum, machine time, and other supplies. It provides the linear program formulation with objectives and constraints. The optimal solution is found to be producing 8 frying pans and 6 casserole dishes for a maximum profit of P2,400.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    71 views4 pages

    Activity 3 C

    Uploaded by

    Alyssa Mae Honson
    The document describes a linear programming problem to maximize profit for a metal company that produces aluminum frying pans and casserole dishes given constraints on available aluminum, machine time, and other supplies. It provides the linear program formulation with objectives and constraints. The optimal solution is found to be producing 8 frying pans and 6 casserole dishes for a maximum profit of P2,400.

    Copyright:

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

    HONSON, ALYSSA MAE B.

    CBET-01-601A
    Activity 3C
    Maximization of Profit (Simplex method)

    The Metal Company produces aluminum frying pans and aluminum casserole dishes. Each frying pan and
    each casserole dish requires 10 oz. aluminum. The company’s daily aluminum supply is limited to 140 oz.
    Each frying pan and each casserole dish requires 20 minutes and 40 minutes respectively on the casting
    machine which is available for 400 minutes a day. Each frying pan requires an insulated handle and only
    12 of this are available each day. Each casserole dish requires 2 special pick-up handles and only 16 of this
    are available daily. Each frying pan contributes P150 to profit and each casserole dish contributes P200
    to profit. The man is good and the company can sell all it can produce. Determine the best combination
    of frying pans and casserole dishes which the company must produce and sell to maximize profit. What
    is this profit?

    Linear Program
    Maximize Z = P150x1 + P200x2

    Subject to:
    10x1 + 10x2 ≤ 140
    20x1 + 40x2 ≤ 400
    x1 ≤ 12
    2x2 ≤ 16
    x1,x2 ≥ 0

    Convert the inequalities to equalities by adding slack variables.


    10x1 + 10x2 +S1 = 140
    20x1 + 40x2 +S2 = 400
    x1 + S3 = 12
    2x2 + S4 = 16

    Modified objective functions and constraints


    Z = P150x1 + P200x2 + P0S1 + P0S2 + P0S3+ P0S4
    140= 10x1 + 10x2 + S1 + 0S2 + 0S3+ P0S4
    400 = 2x1 + 40x2 + 0S1 + S2 + 0S3+ P0S4
    12 = x1 + 0S1 + 0S2 + S3+ 0S4
    16 = 2x2 + 0x2 + 0S1 + 0S2 + 0S3+ S4
    First Solution
    Cj P150 P200 P0 P0 P0 P0
    Pm Qty x1 x2 S1 S2 S3 S4
    P0 S1 140 10 10 1 0 0 0
    P0 S2 400 20 40 0 1 0 0
    P0 S3 12 1 0 0 0 1 0
    P0 S4 16 0 2 0 0 0 1
    Zj 0 0 0 0 0 0 0
    Cj-Zj 150 200 0 0 0 0
    16/2= 8 0/2=0 2/2=1 0/2=0 0/2=0 0/2=0 1/2=1/2

    S1 Row S2 Row S3 Row


    140-10(8)= 60 400-40(8)=80 same values, IE=0
    10-10(0)= 10 20-40(0)=20
    10-10(1)=0 40-40(1)=0
    1- 0-
    10(0)=1 40(0)=0
    0- 1-
    10(0)=0 40(0)=1
    0- 0-
    10(0)=0 40(0)=0
    0-10(1/2)= -5 0-40(1/2)= -20

    Second Solution

    Cj P150 P200 P0 P0 P0 P0
    Pm Qty x1 x2 S1 S2 S3 S4
    P0 S1 60 10 0 1 0 0 -5
    P0 S2 80 20 0 0 1 0 -20
    P0 S3 12 1 0 0 0 1 0
    P200 x2 8 0 1 0 0 0 1/2
    Zj 1600 0 200 0 0 0 100
    Cj-Zj 150 0 0 0 0 -100
    20
    − = −1
    80/20=4 20/20=1 0/20=0 0/20=0 1/20=1/20 0/20=0 20

    S1 Row S3 Row x2 Row


    12-
    60-10(4)= 20 1(4)=8 same values, IE=0
    10-10(1)= 0 1-1(1)=0
    0-
    10(0)=0 0-1(0)=0
    1-
    10(0)=1 0-1(0)=0
    0-10(1/20)= -1/2 0-1(1/20)= -1/20
    0-
    10(0)=0 1-1(0)=1
    0-1(-
    (-5 )-10(-1)=5
    )) ( ) 1)=1
    Third Solution

    Cj P150 P200 P0 P0 P0 P0
    Pm Qty x1 x2 S1 S2 S3 S4

    P0 S1 20 0 0 1 - 1/2 0 5
    1⁄
    P150 x2 4 1 0 0 20 0 -1
    P0 S3 8 0 0 0 1⁄ 1 1
    20
    P200 x2 8 0 1 0 0 0 1/2
    Zj 2200 150 200 0 15/2 0 -50

    Cj-Zj 0 0 0 -15⁄2 0 50

    1
    − 2 = −1/10
    20/5= 4 0/5=0 0/5=0 1/5=1/5 5 0/5=0 5/5=1

    x1 Row S3 Row x2 Row


    4-(-1)(4)= 8 8-4=4 8-(1/2)(4)=6
    1-(-1)(0)=1 0-0=0 0-(1/2)(0)=0
    0-(-1)(0)=0 0-0=0 1-(1/2)(0)=1
    0-(-1)(1/5)=1/5 0-1/5= -1/5 0-(1/2)(1/5)= -1/10
    0-(1/2)(-
    1/20-(-1)(-1/10)= -1/20 1/20-(-1/10)=3/20 1/10)=1/20
    0-(-1)(0)= 0 1-0=1 0-(1/2)(0)=0
    (-1)-(-1)(1)=0 1-1=0 1/2-(1/2)(1)=0

    In Fourth Solution there is no positive Cj – Zj values so the optimum solution has been obtained.

    Cj P150 P200 P0 P0 P0 P0
    Pm Qty x1 x2 S1 S3 S4
    S2

    1⁄
    P0 S1 4 0 0 1/5 10 0 1
    1⁄ 1⁄ 0
    P150 x1 8 1 0 5 20 0
    P0 S3 4 0 0 1⁄ 3⁄ 1 0
    5 20
    P200 x2 6 0 1 1⁄ 1⁄ 0 0
    10 20
    Zj 2400 150 200 10 5⁄ 0 0
    2
    Cj-Zj 0 0 -10 -5⁄2 0 0
    Optimum Solution

    Produce and Sell:


    Aluminium Frying Pans (X1) = 8 units
    Aluminium Casserole Dishes (X2) = 6 units
    Profit = P2,400

    You might also like