Scribd Logo
Upload

Welcome to Scribd!

  • MKB 3

    Uploaded by

    Mbii Alvaro
    10 views5 pages
    The document describes using linear programming to solve a business optimization problem. It defines two variables (standard and super products), a profit objective function, and two constraints. It constructs the feasible region graphically and then solves the problem using the simplex method. The optimal solution found is 4.8 units of the standard product and 1.6 units of the super product, for a maximum profit of $24.

    Original Description:

    Original Title

    mkb 3.xlsx

    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 document describes using linear programming to solve a business optimization problem. It defines two variables (standard and super products), a profit objective function, and two constraints. It constructs the feasible region graphically and then solves the problem using the simplex method. The optimal solution found is 4.8 units of the standard product and 1.6 units of the super product, for a maximum profit of $24.

    Copyright:

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

    MKB 3

    Uploaded by

    Mbii Alvaro
    The document describes using linear programming to solve a business optimization problem. It defines two variables (standard and super products), a profit objective function, and two constraints. It constructs the feasible region graphically and then solves the problem using the simplex method. The optimal solution found is 4.8 units of the standard product and 1.6 units of the super product, for a maximum profit of $24.

    Copyright:

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

    metode kuantitatif bisnis

    variabel: var dsr z x1 x2 x3 x4 x5


    X1 :Pia z 1 -1.5 -4 -6 0 0
    X2:bolu kismis x4 0 4 2 6 1 0
    X3: Coklat keju x5 0 3 4 9 0 1
    Z= 150x1+400x2+600x3→Z-150x1-400x2-600x3 x6 0 1 2 4 0 0
    kendala :
    4x1+2x2+6x3≤130 →4x1+2x2+6x3+x4=130 var dsr z x1 x2 x3 x4 x5
    3x1+4x2+9x3≤170 →3x1+4X2+9x3+x5=170 z 1 -1.5 -4 -6 0 0
    x1+2x2+4x3≤52→x1+2x2+4x3+x6=52 x4 0 4 2 6 1 0
    x5 0 3 4 9 0 1
    x3 0 0.25 0.5 1 0 0
    baris z
    baris lama -1.5 -4 -6 0 0
    NBBK *-6 0.25 0.5 1 0 0
    0 -1 0 0 0
    baris x4
    baris lama 4 2 6 1 0
    NBBK *6 0.25 0.5 1 0 0
    2.5 -1 0 1 0
    baris x5
    baris lama 3 4 9 0 1
    NBBK *9 0.25 0.5 1 0 0
    0.75 -0.5 0 0 1

    var dsr z x1 x2 x3 x4 x5
    z 1 0 -1 0 0 0
    x4 0 2.5 -1 0 1 0
    x5 0 0.75 -0.5 0 0 1
    x3 0 0.25 0.5 1 0 0
    x6 NK Index
    0 0
    0 130 21.66667
    0 170 18.88889
    1 52 13

    x6 NK Index
    0 0
    0 130 21.66667
    0 170 18.88889
    0.25 13 13

    0 0
    0.25 13
    1.5 78

    0 130
    0.25 13
    -1.5 52

    0 170
    0.25 13
    -2.25 53

    x6 NK Index
    1.5 78
    -1.5 52 -52
    -2.25 53 -106
    0.25 13 26
    metode kuantitaf bisnis
    Linear programing
    variabel:
    x1: standart
    x2: super
    fungsi tujuan:
    Z=3x1+6x2
    fungsi batasan:
    2x1+4x2≥16
    4x1+3x2≥24
    membuat grafik
    1. 2x1+4x2=16, x1=0, x2=4
    x2=0, x1=8 (0,4),(8,0)
    2. 4x1+3x2=24,x1=0, x2=8
    x2=0, x1=6 (0,8),(6,0)
    metode simplex -6
    Fungsi tujuan: vrb dsr z x1 x2 x3 x4
    Z=3x1+6x2→Z-3x1-6x2=0 z 1 -3 -6 0 0
    fungsi batasan: x3 0 2 4 1 0
    2x1+4x2≥16→2x1+4x2+x3=16 x4 0 4 3 0 1
    4x1+3x2≥24→4x1+3x2+x4=24
    vrb dsr z x1 x2 x3 x4
    z 1 -3 -6 0 0
    x2 0 0.5 1 0.25 0
    x4 0 4 3 0 1
    Baris Z
    Baris lama -3 -6 0 0
    NBBK *-6 0.5 1 0.25 0
    Baris baru 0 0 1.5 0
    Baris x4
    Baris lama 4 3 0 1
    NBBk *3 0.5 1 0.25 0
    Baris Baru 2.5 0 -0.75 1

    vrb dsr z x1 x2 x3 x4
    z 1 0 0 1.5 0
    x2 0 0.5 1 0.25 0
    x4 0 2.5 0 -0.75 1

    vrb dsr z x1 x2 x3 x4
    z 1 0 0 1.5 0
    x2 0 0.5 1 0.25 0
    x1 0 1 0 -0.3 0.4

    baris x2
    baris lama 0.5 1 0.25 0
    NBBK *0.5 1 0 -0.3 0.4
    0 1 0.4 -0.2

    kesimpulannya diperoleh hasil: vrb dsr z x1 x2 x3 x4


    x1=4.8 z 1 0 0 1.5 0
    x2=1.6 x2 0 0 1 0.4 -0.2
    Zmax=$24 x1 0 1 0 -0.3 0.4
    nk index
    0
    16 4
    24 8

    nk index
    0
    4 4
    24 8

    0
    4
    24

    24
    4
    12

    nk index
    24
    4 8
    12 4.8

    nk index
    24
    4
    4.8

    4
    4.8
    1.6

    nk index
    24
    1.6
    4.8

    You might also like