Scribd Logo
Upload

Welcome to Scribd!

  • 35 15 460 The Optimal Solution Value Is 460

    Uploaded by

    toko jaya baru
    5 views3 pages
    This document summarizes the results of a linear programming problem to maximize vitamin and protein production given two resources. The optimal solution is to produce 35 units of vitamin and 15 units of protein, achieving a maximum total value of 460. The solution satisfies the constraints of producing a minimum of 100 units from the first resource and 80 units from the second. It provides details on the iterations taken to reach the optimal solution and the dual values.

    Original Description:

    CONTOH PPIC

    Original Title

    UJIKOM SOAL 2

    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 vitamin and protein production given two resources. The optimal solution is to produce 35 units of vitamin and 15 units of protein, achieving a maximum total value of 460. The solution satisfies the constraints of producing a minimum of 100 units from the first resource and 80 units from the second. It provides details on the iterations taken to reach the optimal solution and the dual values.

    Copyright:

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

    35 15 460 The Optimal Solution Value Is 460

    Uploaded by

    toko jaya baru
    This document summarizes the results of a linear programming problem to maximize vitamin and protein production given two resources. The optimal solution is to produce 35 units of vitamin and 15 units of protein, achieving a maximum total value of 460. The solution satisfies the constraints of producing a minimum of 100 units from the first resource and 80 units from the second. It provides details on the iterations taken to reach the optimal solution and the dual values.

    Copyright:

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

    1 1 1

    06-30-2019 13:58:38

    Module/submodule: Linear Programming


    Problem title: (untitled)
    Objective: Minimize

    Problem and Results ----------

    VITAMIN PROTEIN
    (UNIT) (UNIT) RHS Dual
    -----------------------------------------------------------------------------------
    Minimize 8 12
    ROYAL BEE 2 2 >= 100 -3
    ROYAL JELLY 1 3 >= 80 -2
    -----------------------------------------------------------------------------------
    Solution 35 15 460

    The optimal solution value is = 460

    Ranging ----------

    Reduced Original Lower Upper


    Variable Value Cost Value Bound Bound
    VITAMIN (UNIT) 35 0 8 4 12
    PROTEIN (UNIT) 15 0 12 8 24

    Dual Slack/ Original Lower Upper


    Constraint Value Surplus Value Bound Bound
    ROYAL BEE -3 0 100 53.3333 160
    ROYAL JELLY -2 0 80 50 150

    Solution list ----------

    Variable Status Value


    VITAMIN (UNIT)
    Basic 35
    PROTEIN (UNIT)
    Basic 15
    surplus 1 NONBasic 0
    surplus 2 NONBasic 0
    Z Optimal 460

    Iterations ----------

    Iteration 1

    Cj--> 8 12 0 0 0 0
    Basic VITAMIN ( PROTEIN ( artfcl 1 surplus 1 artfcl 2 surplus 2 Quantity
    ---------------------------------------------------------------------------------------
    artfcl 1 2 2 1 -1 0 0 100
    artfcl 2 1 3 0 0 1 -1 80
    zj 5 7 0 1 0 1 180
    cj-zj 3 5 0 -1 0 -1

    Iteration 2

    Cj--> 8 12 0 0 0 0
    Basic VITAMIN ( PROTEIN ( artfcl 1 surplus 1 artfcl 2 surplus 2 Quantity
    ---------------------------------------------------------------------------------------------
    artfcl 1 1.3333 0 1 -1 -0.6667 0.6667 46.6667
    PROTEIN (UNIT) 0.3333 1 0 0 0.3333 -0.3333 26.6667
    zj 6.6667 12 0 1 1.6667 -.6667 46.6667
    cj-zj 1.3333 0 0 -1 -1.6667 0.6667

    Iteration 3

    Cj--> 8 12 0 0 0 0
    Basic VITAMIN ( PROTEIN ( artfcl 1 surplus 1 artfcl 2 surplus 2 Quantity
    ---------------------------------------------------------------------------------------------
    VITAMIN (UNIT) 1 0 0.75 -0.75 -0.5 0.5 35.0
    PROTEIN (UNIT) 0 1 -0.25 0.25 0.5 -0.5 15.0
    zj 8 12 1 0 1 0 0.0
    cj-zj 0 0 -1.0 0 -1.0 0

    Iteration 4

    Cj--> 8 12 0 0 0 0
    Basic VITAMIN ( PROTEIN ( artfcl 1 surplus 1 artfcl 2 surplus 2 Quantity
    ---------------------------------------------------------------------------------------------
    VITAMIN (UNIT) 1 0 0.75 -0.75 -0.5 0.5 35.0
    PROTEIN (UNIT) 0 1 -0.25 0.25 0.5 -0.5 15.0
    zj 8 12 -3 3 -2 2 460.0
    cj-zj 0 0 3.0 -3.0 2.0 -2.0

    Dual ----------

    y1 y2
    ---------------------------------------------------------
    Maximize 100 80
    VITAMIN (UNI 2 1 <= 8
    PROTEIN (UNI 2 3 <= 12

    Intercepts and Intersections ----------

    VITAMIN PROTEIN
    (UNIT) (UNIT) Cost
    ----------------------------------------------------
    Point 1 0 50 600
    Point 2 80 0 640
    Point 3 35 15 460
    (untitled)

    PROTEIN (UNIT)
    50

    Constraints

    26.6667

    Isoprofit Line

    35.,15.

    50 80
    VITAMIN (UNIT)

    You might also like