Scribd
Upload
30 views3 pages

Kebutuhan Air Maksimum Luas Hasil Panen Persamaan Lahan (Ha) Maksimum (Ton) Z 8X1+6X2 (1000 M) 4X + 2X 60 2X + 4X 48 Kebutuhan Air (1000 M)

The document describes a linear programming problem to maximize crop yield given constraints on water needs and land area. The problem involves optimizing two variables - water needs (X1) and land area (X2) - subject to two constraints relating their sum to maximum crop yields, with the goal of maximizing the objective function Z = 8X1 + 6X2.

Uploaded by

CHand DedaRksky
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
30 views3 pages

Kebutuhan Air Maksimum Luas Hasil Panen Persamaan Lahan (Ha) Maksimum (Ton) Z 8X1+6X2 (1000 M) 4X + 2X 60 2X + 4X 48 Kebutuhan Air (1000 M)

The document describes a linear programming problem to maximize crop yield given constraints on water needs and land area. The problem involves optimizing two variables - water needs (X1) and land area (X2) - subject to two constraints relating their sum to maximum crop yields, with the goal of maximizing the objective function Z = 8X1 + 6X2.

Uploaded by

CHand DedaRksky
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as XLSX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Kebutuhan Air Maksimum Luas Hasil Panen Persamaan

(1000 m3) Lahan (Ha) Maksimum (Ton) Z = 8X1+6X2


4 2 60 Pers. 1 = 4X1 + 2X2 ≤ 60
2 4 48
Pers. 2 = 2X1 + 4X2 ≤ 48
X1 = Kebutuhan air (1000 m3)
X2 = Maksimum luas lahan (Ha)
35

30

25

20

15

10

0
0 5 10
8X1+6X2
4X1 + 2X2 ≤ 60 ---> Jika X1 =0 30 0 30
Jika X2 =0 15 15 0
2X1 + 4X2 ≤ 48 ---> Jika X1 =0 12 0 12
Jika X2 =0 24 24 0

5 10 15 20 25 30
X1 X2 Z Batasan
12 6 132
60 60
48 48

You might also like