Scribd Logo
Upload

Welcome to Scribd!

  • Tugas Metode Simpleks

    Uploaded by

    Novi nisa
    312 views2 pages
    The document contains 10 problems involving linear programming and the simplex method. Each problem defines an objective function to maximize or minimize subject to multiple linear constraints on variables X1, X2, and sometimes X3. The objective functions and constraints vary across the problems, involving maximizing or minimizing combinations of the variables subject to inequalities or equalities on sums of the variables.

    Original Description:

    Original Title

    TUGAS METODE SIMPLEKS

    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
    The document contains 10 problems involving linear programming and the simplex method. Each problem defines an objective function to maximize or minimize subject to multiple linear constraints on variables X1, X2, and sometimes X3. The objective functions and constraints vary across the problems, involving maximizing or minimizing combinations of the variables subject to inequalities or equalities on sums of the variables.

    Copyright:

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

    Tugas Metode Simpleks

    Uploaded by

    Novi nisa
    The document contains 10 problems involving linear programming and the simplex method. Each problem defines an objective function to maximize or minimize subject to multiple linear constraints on variables X1, X2, and sometimes X3. The objective functions and constraints vary across the problems, involving maximizing or minimizing combinations of the variables subject to inequalities or equalities on sums of the variables.

    Copyright:

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

    TUGAS METODE SIMPLEKS

    1. Fungsi tujuan:
    Maksimalkan Z = 20X1 + 15X2
    Fungsi Kendala:
    3 X1 + 4 X2 ≤ 20
    5 X1 + 6 X2 ≤ 30
    2. Fungsi tujuan:
    Maksimalkan Z = 30X1 + 25X2 Fungsi
    Kendala: 6 X1 + 8 X2 ≤ 40
    5 X1 ≤ 25
    7 X2 ≤ 35
    3. Fungsi tujuan:
    Maksimalkan Z = 20X1 + 30X2 + 40X3 Fungsi
    Kendala:
    5 X1 + 6 X2 ≤ 30
    3 X1 + 4 X2 + 5 X3 ≤ 40
    2 X2 + 3 X3 ≤ 35
    4. Fungsi tujuan:
    Maksimalkan Z = 10X1 + 15X2 + 20X3 Fungsi
    Kendala:
    2 X2 + 5 X3 ≤ 15
    6 X1 + 2 X3 ≤ 30
    4 X1 + 5 X2 ≤ 35
    5. Fungsi tujuan:
    Maksimalkan Z = 40X1 + 50X2 + 60X3 Fungsi
    Kendala:
    4 X1 + 6 X2 + 8X3 ≤ 40
    6 X1 + 8 X2 + 10 X3 ≤ 60
    8 X1 + 10 X2 + 12 X3 ≤ 80
    6. Fungsi tujuan:
    Maksimalkan Z = 20X1 + 15X2 Fungsi
    Kendala: 6 X1 + 8X2 ≤ 40 10 X1 + 12
    X2 = 60
    7. Fungsi tujuan:
    Maksimalkan Z = 30X1 + 25X2 Fungsi
    Kendala: 6 X1 + 8 X2 ≤ 40
    5 X1 ≤ 25
    7 X2 = 35
    8. Fungsi tujuan:
    Minimalkan Z = 20X1 + 15X2 Fungsi
    Kendala:
    3 X1 + 4 X2 ≤ 20
    5 X1 + 6 X2 ≥ 30
    9. Fungsi tujuan:
    Minimalkan Z = 30X1 + 25X2
    Fungsi Kendala:
    3 X1 + 4 X2 ≤ 20
    5 X1 ≥ 25
    6 X2 = 35
    10. Fungsi tujuan:
    Minimalkan Z = 20X1 + 30X2 Fungsi
    Kendala:
    5 X1 + 6 X2 ≤ 30
    3 X1 + 4 X2 = 40

    You might also like