Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
645 views

Program Linear

The document describes a furniture company that produces tables and chairs using boards, wood, and work hours. It provides the materials and time required to produce each table and chair, as well as the profits earned. The company has 150 boards, 100 wood units, and 80 work hours available. The problem is to determine the number of each product to produce to maximize profits. The solution formulates the problem as a linear programming model to maximize total profits based on constraints of available materials and time. Applying the simplex method yields an optimal solution of producing 5 tables and 30 chairs to maximize total profits of 300 units.

Uploaded by

Ulul Afidah
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
645 views

Program Linear

The document describes a furniture company that produces tables and chairs using boards, wood, and work hours. It provides the materials and time required to produce each table and chair, as well as the profits earned. The company has 150 boards, 100 wood units, and 80 work hours available. The problem is to determine the number of each product to produce to maximize profits. The solution formulates the problem as a linear programming model to maximize total profits based on constraints of available materials and time. Applying the simplex method yields an optimal solution of producing 5 tables and 30 chairs to maximize total profits of 300 units.

Uploaded by

Ulul Afidah
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Contoh :

Sebuah perusahaan meubel memproduksi meja dan kursi menggunakan


papan, kayu, dan waktu pengerjaan. Setiap meja membutuhkan 5 unit papan, 2 unit
kayu, dan 4 jam pengerjaan. Setiap kursi membutuhkan 2 unit papan, 3 unit kayu,
dan 2 jam pengerjaan. Perusahaan dapat keuntungan $12 untuk meja dan $8 untuk
kursi. Tersedia 150 unit papan, 100 unit Kayu, dan 80 jam pengerjaan. Berapa
banyak produk agar keuntungan maksimum?

Jawab :
- Variabel Keputusan

: X1= meja, dan X2 = kursi

- Fungsi Tujuan

: Maks. Z = 12X1 + 8 X2

- Kendala

: papan, kayu, dan waktu

Formulasi Model :
Maks. Z = 12X1 + 8 X2
Kendala :

5 X1 + 2 X2 150
2 X 1 + 3 X2 100
4 X 1 + 2 X2 80
X1 , X 2 0

Bentuk standard
Maks. Z = 12X1 + 8 X2+0.S1+0.S2+0.S3
Kendala :

5 X1 + 2 X2 +S1 = 150
2 X 1 + 3 X2 +S2= 100
4 X 1 + 2 X2 +S3 = 80
X1 , X2 , S1, S2, S3 0

Tabel Simpleks

Basis

X1

X2

S1

S2

S3

Rasio

S1

150

150/5 =

S2

100

30
100/2

S3

80

=50
80/4 =

-12

-8

20
0

elemen pivot

Maka :
b3

(0 4 20 0 1 80)
4

= (0 1

b2

1
2

0 0

1
4

20 )

= ( 0 2 3 0 1 0 100 ) - 2 ( 0 1

1
2

= ( 0 2 3 0 1 0 100 ) - ( 0 2 1 0 0

2 0 1 -

b1

1
2

1
4

0 0

1
2

20 )

40 ) = ( 0 0

60 )

= ( 0 5 2 1 0 0 150 ) - 5 ( 0 1

1
2

0 0

1
4

20 )

= (0

5
4

150 ) - ( 0

5
2

(0 0 - 2

1 0 -

b4

= ( 1 -12 -8 0 0 0 0 ) - (-12) ( 0 1

5
4

100 ) =

0 0

1
4

20 )

50 )

1
2

= ( 1 -12 -8 0 0 0 0 ) - ( 0 -12 6 0 0 -3 -240 ) = ( 1 0


-2 0 0 3 240 )

Basis

X1

S1

0
-

X2

S1

S2

1
2

S3

Rasio

50

50
1
2

- 4

-100
S2

1
2

60

60
2

= 30

X1

1
2

1
4

20

20
1
2

= 40

-2

240

elemen pivot

b2

1
(0 0 2 01 60)
2
2

= (0 01 0

1
2

1
- 4

30 )

= (0

1
2

1
4

200 ) -

= (0

1
2

1
4

200 ) - ( 0

15 )= ( 0 10 0 -

1
4

b3

1
2

(0

0 1

1
2

1
2 -

1
4

1
8

30 )

b1

1
4

= (0

3
8

5 )

1
2

0 -

10 -

5
4

50 ) - (-

1
2 )( 0

1
2

0 1 0

30 )

= (0 0 -

1
4

)= (0 0 0 1

b4

1
2
11
8

10 -

5
4

50 ) - ( 0 0 -

= ( 1 0 -2 0 0 3 240 ) - (-2)( 0 0 1 0

5
2

300 )

1
2

0 -

1
2

1
4

1
8

-15

65 )

= ( 1 0 -2 0 0 3 240 ) - ( 0 0 -2 0 -1

0 1

1
4

1
2

1
4

30 )

-60 ) = ( 1 0 0

Tabel Akhir
Basis
S1

Z
0

X1
0

X2
0

S1
1

S2

S3

1
4

H
65

11
8

X2

1
2

30

1
4
X1
Z

1
4

3
8

5
2

300

Kesimpulan : X1=5

( banyak meja )

X2=30

( banyak kursi )

S1=65

( unit papan / pers. Kendala 1 yg berlebih )

Z = 300 ( keuntungan maks )


Bukti

Fungsi tujuan

Z = 12X1 + 8 X2
= 12 ( 5 ) + 8 ( 30 )
= 60 + 240

Papan

300

5 X1 + 2 X2 150
5 ( 5 ) + 2 ( 30 ) = 25 + 60 = 85

65 ( sisa )

Kayu

2 X1 + 3 X2 100
2 ( 5 ) + 3 ( 30 ) = 10 + 90 = 100

Waktu

4 X1 + 2 X2 80

150 - 85 =

4 ( 5 ) + 2 ( 30 ) = 20 + 60 = 80

Metode Dual :
Contoh = Min Z = 3 X1 + 2 X2

Menjadi

Kendala 3X 1 + X2 3

Max

Y=

3P + 6Q + 3R
4X 1 + 3X2 6

Fungsi Kendala

3P +

4Q + R 3
X 1 + 2X2 3

P+

3Q + 2R 2
P, Q ,
R0

Jawab :
Y = 3P + 6Q + 3R + 0S 1 + 0S2
Kendala 3P + 4Q + R + S1 = 3
P + 3Q + 2R +S 2 = 2
P, Q , R 0
P

S1

S2

3
1
-3

4
3
-4

1
2
-1

1
0
0

0
1
0

Basis
S1
S2
Z

b2 =

b2
a22

b1 = b1 -

=
a12
a22

3
2
0

(13 2 0 1 2)
3
. b2 = ( 3 4 1 1 0 3 ) (4) (

1
3

2
3

1
3

2
3

4
3

=(3 4 1 1 0 3 )(
=

b3 = b3 -

a32
a22

5
3

0 -

5
3

Q
0

5
3

R
-

5
3

S1
1

4
3

4
3

S2

1
3

4
3

8
3

1
3

. b2 = ( -3 -4 -1 0 0 0 ) (- 4) (

=(-

5
3

4
3

1 -

= ( -3 -4 -1 0 0 0 ) (

Basis
S1

8
3

-4

8
3

2
3

8
3

0 -

1
3

4
3

2
3
-

8
3

4
3

1
3

5
3
Q

1
3

2
3

1
3

2
3

5
3

4
3

8
3

b1

5
3

b1
a11

5
5
41
( 0 1
)
3
3
33
5
3

b2

1
5

= b2 -

a21
a11

b1 = (

1
3

2
3

1
3

2
3

1
3

(1 0 -1

3
5

4
5

1
3

=(

1
15

2
3

a31
a11

= b3 -

4
5

1
5

1
5

5
3

. b1 = ( -

)( 3

1
3

0 -

1
5

4
15

3
5
5
3

3
5

4
3

8
3

) (-

5
3

)(1 0 -1

3
5

4
3

=( -

1
3

2
3

=(0 1 1 -

b3

1
3

5
3

5
3

4
3

8
3

)(-

5
3

5
3

-1

)
=(0 0 0 1 0 3)

Basis
P

P
1

Q
0

R
-1

S1

3
5

S2

4
5
1
5

1
5

3
5

3
5

3
5

Z= 3

Solusi : P =

1
5

Q =

You might also like