Scribd Logo
Upload

Welcome to Scribd!

  • 6 views

    Tugas Riset Operasi

    Uploaded by

    Bung Deni
    The document describes a linear programming problem to maximize production of Product A (X1) and Product B (X2) given limited raw materials A, B, and C. It defines the objective function as maximizing 500,000X1 + 750,000X2 and lists the constraints on raw materials and non-negativity conditions. The problem is solved using the simplex method, yielding optimal solutions of X1 = 8.2 and X2 = 1.54, with maximum value Z = 5,255,000.

    Copyright:

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

    You might also like

    Tugas Riset Operasi

    Uploaded by

    Bung Deni
    6 views5 pages
    The document describes a linear programming problem to maximize production of Product A (X1) and Product B (X2) given limited raw materials A, B, and C. It defines the objective function as maximizing 500,000X1 + 750,000X2 and lists the constraints on raw materials and non-negativity conditions. The problem is solved using the simplex method, yielding optimal solutions of X1 = 8.2 and X2 = 1.54, with maximum value Z = 5,255,000.

    Original Description:

    Original Title

    TUGAS RISET OPERASI.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 a linear programming problem to maximize production of Product A (X1) and Product B (X2) given limited raw materials A, B, and C. It defines the objective function as maximizing 500,000X1 + 750,000X2 and lists the constraints on raw materials and non-negativity conditions. The problem is solved using the simplex method, yielding optimal solutions of X1 = 8.2 and X2 = 1.54, with maximum value Z = 5,255,000.

    Copyright:

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

    Tugas Riset Operasi

    Uploaded by

    Bung Deni
    The document describes a linear programming problem to maximize production of Product A (X1) and Product B (X2) given limited raw materials A, B, and C. It defines the objective function as maximizing 500,000X1 + 750,000X2 and lists the constraints on raw materials and non-negativity conditions. The problem is solved using the simplex method, yielding optimal solutions of X1 = 8.2 and X2 = 1.54, with maximum value Z = 5,255,000.

    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 5

    DIKETAHUI

    BAHAN BAKU :
    BAHAN A = 24
    BAHAN B = 18
    BAHAN C = 36
    PRODUK :
    PRODUK A = X1
    PRODUK B = X2

    PRODUK A MEMBUTUHKAN = 4 BAHAN A, 2 BAHAN B, 3 BAHAN C.


    PRODUK B MEMBUTUHKAN = 6 BAHAN A, 1 BAHAN B, 9 BAHAN C.
    FUNGSI TUJUAN
    Z = 500.000X1 + 750.000X2
    FUNGSI KENDALA
    4X1 + 6X2 < 24
    2X1 + X2 < 18
    3X1 + 9X2 < 36 BASIS
    X1,X2 > 0 Z1
    S1
    BENTUK STANDAR SIMPLEKS S2
    Z max = 500.000X1 - 750.000X2 = 0 S3

    4X1 + 6X2 + 0S1 + 0S2 + 0S3 =24


    2X1 + X2 + 0S1 + 0S2 + 0S3 = 18 BARIS 2
    3X1 + 9X2 + 0S1 + 0S2 + 0S3 = 36 Z1
    S1
    S2
    X2

    X1 = 8,2 Z
    X2 = 1,54
    -750
    Z = 5.255.000 NILai baru

    S1

    6
    NILai baru

    S2

    1
    NILai baru

    BASIS
    Z1
    S1
    S2
    X2

    BARIS 2
    Z1
    S1
    X1
    X2

    Z
    -275
    NILai baru

    S1

    2.2
    NILai baru

    X2

    0.3
    NILai baru

    BASIS
    Z
    S1
    X1
    X2
    X1 X2 S1 S2 S3 NK INDEKS
    -500 -750 0 0 0 0 0
    4 6 1 0 0 24 4
    2 1 0 1 0 18 18
    3 9 0 0 1 36 4

    X1 X2 S1 S2 S3 NK

    0.3 1 0 0 0.1 4

    X1 X2 S1 S2 S3 NK
    -500 -750 0 0 0 0
    0.3 1 0 0 0.1 4
    -275 0 0 0 0 3000
    -275 0 0 0 0 3000
    X1 X2 S1 S2 S3 NK
    4 6 1 0 0 24
    0.3 1 0 0 0.1 4
    2.2 0 1 0 -0.6 0
    2.2 0 1 0 -0.6 0
    X1 X2 S1 S2 S3 NK
    2 1 0 1 0 18
    0.3 1 0 0 0.1 4
    1.7 0 0 1 -0.1 14
    1.7 0 0 1 -0.1 14
    X1 X2 S1 S2 S3 NK INDEKS
    -275 0 0 0 0 3000 10.9
    2.2 0 1 0 -0.6 0 0
    1.7 0 0 1 -0.1 14 8.2
    0.3 1 0 0 0.1 4 13.3

    X1 X2 S1 S2 S3 NK

    1 0 0 0.6 -0.1 8.2 0.588235

    X1 X2 S1 S2 S3 NK
    -275 0 0 0 0 3000
    1 0 0 0.6 -0.1 8.2
    0 0 0 165 -27.5 5255
    0 0 0 165 -27.5 5,255
    X1 X2 S1 S2 S3 NK
    2.2 0 1 0 -0.6 0
    1 0 0 0.6 -0.1 8.2
    0 0 1 -1.32 -0.38 -18.04
    0 0 1 -1.32 -0.38 -18.04
    X1 X2 S1 S2 S3 NK
    0.3 1 0 0 0.1 4 1.54
    1 0 0 0.6 -0.1 8.2
    0 1 0 -0.18 0.13 1.54
    0 1 0 -0.18 0.13 1.54
    X1 X2 S1 S2 S3 NK INDEKS
    0 0 0 165 -27.5 5,255 -191.1
    0 0 1 -1.32 -0.38 -18.04 47.5
    1 0 0 0.6 -0.1 8.2 -82
    0 1 0 -0.18 0.13 1.54 11.8

    You might also like