Scribd Logo
Upload

Welcome to Scribd!

  • Cost Per Unit Masing-Masing Produk Total Cost

    Uploaded by

    Indah Arisaq
    3 views12 pages
    The document presents a linear programming problem to minimize total cost given production quantities and constraints. The objective is to determine the optimal allocation of production across 11 products (X11-X34) that minimizes total cost while meeting capacity limits of 4 sources (S1-S4) and demand limits of 4 targets (T1-T4). The document provides the production quantities, unit costs, capacity limits, demand limits and solves the linear program to determine the optimal solution with a total cost of 3,925,000.

    Original Description:

    Original Title

    Transportasi

    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 presents a linear programming problem to minimize total cost given production quantities and constraints. The objective is to determine the optimal allocation of production across 11 products (X11-X34) that minimizes total cost while meeting capacity limits of 4 sources (S1-S4) and demand limits of 4 targets (T1-T4). The document provides the production quantities, unit costs, capacity limits, demand limits and solves the linear program to determine the optimal solution with a total cost of 3,925,000.

    Copyright:

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

    Cost Per Unit Masing-Masing Produk Total Cost

    Uploaded by

    Indah Arisaq
    The document presents a linear programming problem to minimize total cost given production quantities and constraints. The objective is to determine the optimal allocation of production across 11 products (X11-X34) that minimizes total cost while meeting capacity limits of 4 sources (S1-S4) and demand limits of 4 targets (T1-T4). The document provides the production quantities, unit costs, capacity limits, demand limits and solves the linear program to determine the optimal solution with a total cost of 3,925,000.

    Copyright:

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

    X11 X12 X13 X14 X21 X22

    Jumlah Produksi 25 0 100 25 0 0

    Batasan Kapasitas Digunakan


    S1 150 150 1 1 1 1 0 0
    S2 175 175 0 0 0 0 1 1
    S3 275 275 0 0 0 0 0 0
    T1 200 200 1 0 0 0 1 0
    T2 100 100 0 1 0 0 0 1
    T3 100 100 0 0 1 0 0 0
    T4 200 200 0 0 0 1 0 0

    Cost Per Unit 6 8 10 7 7 11


    Masing-masing Produk 150 0 1000 175 0 0
    Total Cost 3,925

    Solusi
    X11 25
    X12 0
    X13 100
    X14 25
    X21 0
    X22 0
    X23 0
    X24 175
    X31 175
    X32 100
    X33 0
    X34 0

    600

    Total Biaya adalah Rp 3,925,000 (dengan asumsi biaya transportasi dalam Rp .000)
    X23 X24 X31 X32 X33 X34
    0 175 175 100 0 0

    0 0 0 0 0 0
    1 1 0 0 0 0
    0 0 1 1 1 1
    0 0 1 0 0 0
    0 0 0 1 0 0
    1 0 0 0 1 0
    0 1 0 0 0 1

    11 8 4 5 12 6
    0 1400 700 500 0 0
    F(x) = 6x1+8x2+10x3+7x4+7x5+11x6+11x7+8x8+4x9+5x10+12x11

    X11+X12+X13+X14 = 150
    X21+X22+X23+X24 = 175 Pembatas Sumber
    X31+X32+X33+X34 = 275

    X11+X21+X31 = 200
    X12+X22+X32 = 100 Pembatas Tujuan
    X13+X23+X33 = 100
    X14+X24+X34 = 200
    +5x10+12x11+6x12 → min
    X11 X12 X13 X14 X21 X22
    Jumlah Produksi 0 0 0 150 25 0

    Batasan Kapasitas Digunakan


    S1 150 150 1 1 1 1 0 0
    S2 175 175 0 0 0 0 1 1
    S3 275 275 0 0 0 0 0 0
    T1 200 200 1 0 0 0 1 0
    T2 100 100 0 1 0 0 0 1
    T3 100 50 0 0 1 0 0 0
    T4 250 250 0 0 0 1 0 0

    Cost Per Unit 6 8 10 7 7 11


    Masing-masing Produk 0 0 0 1050 175 0
    Total Cost 3,775

    Solusi
    X11 0
    X12 0
    X13 0
    X14 150
    X21 25
    X22 0
    X23 50
    X24 100
    X31 175
    X32 100
    X33 0
    X34 0

    600

    Total Biaya adalah Rp 3,775,000 (dengan asumsi biaya transportasi dalam Rp .000)
    X23 X24 X31 X32 X33 X34
    50 100 175 100 0 0

    0 0 0 0 0 0
    1 1 0 0 0 0
    0 0 1 1 1 1
    0 0 1 0 0 0
    0 0 0 1 0 0
    1 0 0 0 1 0
    0 1 0 0 0 1

    11 8 4 5 12 6
    550 800 700 500 0 0
    F(x) = 6x1+8x2+10x3+7x4+7x5+11x6+11x7+8x8+4x9+5x10+12x11

    X11+X12+X13+X14 = 150
    X21+X22+X23+X24 = 175 Pembatas Sumber
    X31+X32+X33+X34 = 275

    X11+X21+X31 <= 200


    X12+X22+X32 <= 100 Pembatas Tujuan
    X13+X23+X33 <= 100
    X14+X24+X34 <= 250
    +5x10+12x11+6x12 → min
    X11 X12 X13 X14 X21 X22
    Jumlah Produksi 0 0 0 150 25 0

    Batasan Kapasitas Digunakan


    S1 150 150 1 1 1 1 0 0
    S2 200 175 0 0 0 0 1 1
    S3 275 275 0 0 0 0 0 0
    T1 200 200 1 0 0 0 1 0
    T2 100 100 0 1 0 0 0 1
    T3 100 100 0 0 1 0 0 0
    T4 200 200 0 0 0 1 0 0

    Cost Per Unit 6 8 10 7 7 11


    Masing-masing Produk 0 0 0 1050 175 0
    Total Cost 3,925

    Solusi
    X11 0
    X12 0
    X13 0
    X14 150
    X21 25
    X22 0
    X23 100
    X24 50
    X31 175
    X32 100
    X33 0
    X34 0

    600

    Total Biaya adalah Rp 3,925,000 (dengan asumsi biaya transportasi dalam Rp .000)
    X23 X24 X31 X32 X33 X34
    100 50 175 100 0 0

    0 0 0 0 0 0
    1 1 0 0 0 0
    0 0 1 1 1 1
    0 0 1 0 0 0
    0 0 0 1 0 0
    1 0 0 0 1 0
    0 1 0 0 0 1

    11 8 4 5 12 6
    1100 400 700 500 0 0
    F(x) = 6x1+8x2+10x3+7x4+7x5+11x6+11x7+8x8+4x9+5x10+12x11

    X11+X12+X13+X14 <= 150


    X21+X22+X23+X24 <= 200 Pembatas Sumber
    X31+X32+X33+X34 <= 275

    X11+X21+X31 = 200
    X12+X22+X32 = 100 Pembatas Tujuan
    X13+X23+X33 = 100
    X14+X24+X34 = 200
    +5x10+12x11+6x12 → min

    You might also like