Scribd Logo
Upload

Welcome to Scribd!

  • 11 views

    Tgs LP1

    Uploaded by

    asistensi pak
    This document presents three linear programming problems and asks the reader to solve them using a graphical method. It instructs the reader to: 1) Draw the feasible region for each problem 2) Determine the extreme/vertex points 3) Find the optimal point 4) For problems 1 and 2, draw the contour line f(x1,x2)=12 and for problem 3, draw the contour plane f(x1,x2,x3)=12

    Copyright:

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

    You might also like

    Tgs LP1

    Uploaded by

    asistensi pak
    11 views1 page
    This document presents three linear programming problems and asks the reader to solve them using a graphical method. It instructs the reader to: 1) Draw the feasible region for each problem 2) Determine the extreme/vertex points 3) Find the optimal point 4) For problems 1 and 2, draw the contour line f(x1,x2)=12 and for problem 3, draw the contour plane f(x1,x2,x3)=12

    Original Description:

    Tugas Linear Programming

    Original Title

    tgs_LP1

    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 presents three linear programming problems and asks the reader to solve them using a graphical method. It instructs the reader to: 1) Draw the feasible region for each problem 2) Determine the extreme/vertex points 3) Find the optimal point 4) For problems 1 and 2, draw the contour line f(x1,x2)=12 and for problem 3, draw the contour plane f(x1,x2,x3)=12

    Copyright:

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

    Tgs LP1

    Uploaded by

    asistensi pak
    This document presents three linear programming problems and asks the reader to solve them using a graphical method. It instructs the reader to: 1) Draw the feasible region for each problem 2) Determine the extreme/vertex points 3) Find the optimal point 4) For problems 1 and 2, draw the contour line f(x1,x2)=12 and for problem 3, draw the contour plane f(x1,x2,x3)=12

    Copyright:

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

    Tugas 2.

    Program Linear : 1

    Diberikan masalah
    (1)
    maks. x1 - x2
    d.s
    -2x1 + x2  2
    x1 - 2x2  2
    x1 + x2  5
    x1, x2  0

    (2)
    min. 3x1 + 4x2
    d.s
    x1 + x2  5
    2x1 + x2  7
    2x1 + 3x2  12
    x1, x2  0

    (3)
    maks. 4x1 + 12 x2 + 3x3
    d.s
    x1  1000
    x2  500
    x3  1500
    x1 x 2 x 3
       45
    50 25 75
    x1, x2 , x3  0

    Gunakan metode grafik untuk menyelesaikannya


    Untuk ketiga masalah di atas,
    a.Gambarkan daerah penyelesaian (layak) nya
    b.Tentukan titik-titik puncak (ekstrim) nya
    c.Tentukan titik optimumnya
    d. Untuk soal nomor (1) dan (2), gambarkan garis selidik f(x1, x2) = 12
    Untuk soal nomor (3), gambarkan bidang selidik f(x1, x2, x3) = 12

    You might also like