Scribd Logo
Upload

Welcome to Scribd!

  • Module/submodel: Linear Programming Problem Title: SOAL NO 10 (MODUL A2) Objective: Maximize

    Uploaded by

    Widya Jayantari
    6 views2 pages
    This document summarizes the results of a linear programming problem to maximize output given resource constraints. The objective is to maximize production of chairs (KURSI) and tables (MEJA). Constraints include limits on the number of workers (BURUH), wood (KAYU), and maximum chairs. The optimal solution is to produce 6 chairs and 3.2 tables, using all available resources, for a maximum output valued at 2720.

    Original Description:

    qm analisis

    Original Title

    Soal 10 Module a2prin

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document summarizes the results of a linear programming problem to maximize output given resource constraints. The objective is to maximize production of chairs (KURSI) and tables (MEJA). Constraints include limits on the number of workers (BURUH), wood (KAYU), and maximum chairs. The optimal solution is to produce 6 chairs and 3.2 tables, using all available resources, for a maximum output valued at 2720.

    Copyright:

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

    Module/submodel: Linear Programming Problem Title: SOAL NO 10 (MODUL A2) Objective: Maximize

    Uploaded by

    Widya Jayantari
    This document summarizes the results of a linear programming problem to maximize output given resource constraints. The objective is to maximize production of chairs (KURSI) and tables (MEJA). Constraints include limits on the number of workers (BURUH), wood (KAYU), and maximum chairs. The optimal solution is to produce 6 chairs and 3.2 tables, using all available resources, for a maximum output valued at 2720.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 2

    ASUS

    E:\s2\ANALISA SISTEM\QM\SOAL 10 (MODUL A2).lin


    Module/submodel: Linear Programming
    Problem title: SOAL NO 10 (MODUL A2)
    Objective: Maximize

    Linear Programming Results


    KURSI MEJA RHS Dual

    Maximize 400 100

    BURUH 8 10 <= 80 10

    KAYU 2 6 <= 36 0

    BATAS KURSI 1 0 <= 6 320

    Solution 6 3.2 2720

    Ranging

    Variable Value Reduced Cost Original Val Lower Bound Upper Bound
    KURSI 6 0 400 80 Infinity
    MEJA 3.2 0 100 0 500
    Dual Value Slack/Surplus Original Val Lower Bound Upper Bound
    BURUH 10 0 80 48 88
    KAYU 0 4.8 36 31.2 Infinity
    BATAS KURSI 320 0 6 4.286 10

    Solution list
    Variable Status Value

    KURSI Basic 6

    MEJA Basic 3.2

    slack 1 NONBasic 0

    slack 2 Basic 4.8

    slack 3 NONBasic 0

    Optimal Value (Z) 2720

    Iterations
    Cj Basic Variables Quantity 400KURSI 100MEJA 0slack 1 0slack 2 0slack 3

    Iteration 1
    Wednesday, September 19, 2018 6:10 AM 1 of 1
    ASUS
    E:\s2\ANALISA SISTEM\QM\SOAL 10 (MODUL A2).lin
    Iterations
    Cj Basic Variables Quantity 400KURSI 100MEJA 0slack 1 0slack 2 0slack 3

    0 slack 1 80 8 10 1 0 0

    0 slack 2 36 2 6 0 1 0

    0 slack 3 6 1 0 0 0 1

    zj 0 0 0 0 0 0

    cj-zj 400 100 0 0 0

    Iteration 2

    0 slack 1 32 0 10 1 0 -8

    0 slack 2 24 0 6 0 1 -2

    400 KURSI 6 1 0 0 0 1

    zj 2,400 400 0 0 0 400

    cj-zj 0 100 0 0 -400

    Iteration 3

    100 MEJA 3.2 0 1 0.1 0 -0.8

    0 slack 2 4.8 0 0 -0.6 1 2.8

    400 KURSI 6 1 0 0 0 1

    zj 2,720 400 100 10 0 320

    cj-zj 0 0 -10 0 -320

    Dual

    Original Problem
    Maximize KURSI MEJA
    BURUH 8 10 <= 80
    KAYU 2 6 <= 36
    BATAS KURSI 1 <= 6

    Dual Problem
    BURUH KAYU BATAS KURSI
    Minimize 80 36 6
    KURSI 8 2 1 >= 400
    MEJA 10 6 >= 100

    Wednesday, September 19, 2018 6:10 AM 2 of 1

    You might also like