Harga Roti Penjualan Roti

Jenis Roti Harga x Rp 1000 Jenis Roti Senin Selasa Rabu Kamis
Roti Ayam 3 Roti Ayam 13 9 7 15
Roti Daging 4 Roti Daging 8 7 4 6
Roti Coklat 2 Roti Coklat 6 4 0 3

Penjualan hari Senin

(Harga) . (Jumlah Penjualan Roti hari Senin)

(Rp.3, Rp.4, Rp.2) • (13, 8, 6) = Rp.3×13 + Rp.4×8 + Rp.2×6 = Rp.83

DOT PRODUCT

Matrix
13 9 7 15
3 4 2 8 7 4 6
6 4 0 3
1x3 3x4

13 8 6
9 7 4
7 4 0
15 6 3

0 0 0 0
1 2 0 2
2 4 0 4
3 6 0 6

13 9 7 15
8 7 4 6
6 4 0 3
 1 2
1E-06 4 5
0.125

2x3

A
4 7
2 6
A-1
0.6 -0.7
-0.2 0.4

4 7
2 6

=MMULT(A21:C21;E20:H22)
shift ctrl enter 1 0
0 1

#VALUE! #VALUE! #VALUE! #VALUE!

83 63 37 75

#VALUE! #VALUE! #VALUE! #VALUE!

 ctrl shift enter
3 7 8 58 64
6 9 10 139 154
11 12 2x2

3x2 58
58

A-1 AxA-1
0.6 -0.7 1 0
-0.2 0.4 0 1
A A-1xA
4 7 1 0
2 6 0 1

1 0 4 7
0 1 2 6

4 7 4 7
2 6 2 6
4 7 0.6 -0.7 1
2 6 -0.2 0.4 0

=MINVERSE(A2:B3) =MMULT(A2:B3;D2:E3)

4 7 0.6 -0.7 1
2 6 -0.2 0.4 0

1 2 3 4 4 -1.2094413441
4 6 7 9 0 0.7664885906
5 4 2 38 5 -0.0459555538
5 6 7 8 9 0.0622803011
7 9 45 13 20 0.141302405

1
-4.440892E-16
-2.220446E-16
-4.440892E-16
0
 0 1 8.8817842E-16
1 0 1

MULT(A2:B3;D2:E3) adudee212@gmail.com

X
x1 x2
0
1

BUS
-0.1203900463 0.0522113876 0.4476198042 0.02740651
0.220979882 -0.0771950033 -0.1764542331 -0.0545945624 TRAIN
0.016443906 0.0004567752 -0.0462931702 0.0299088436
0.0045081723 0.0279030048 -0.0453001807 0.0009532699 A
-0.0972335313 -0.0027009314 0.0563422239 -0.0029392489 A^-1 . A
I

-5.551115E-17 -3.469447E-18 2.7755576E-16 2.0816682E-17 3 3.2

1 5.5511151E-17 4.4408921E-16 3.1225023E-17 3.5 3.6
-2.220446E-16 1 4.4408921E-16 1.7347235E-17
-1.110223E-16 2.4286129E-17 1 6.9388939E-18 -9 8
-4.440892E-16 5.5511151E-17 4.4408921E-16 1 8.75 -7.5

2x2
A A^-1 = B A^-1
3 3.5 -9 8.75 118.4 135.2
3.2 3.6 8 -7.5
1x2

X = B
X = A^-1 . B
X = X
=
X1 118.4
X2 135.2
2x1
16
22
 -9 8.75 16 22
8 -7.5
2x2 1x2
Selesaikan masalah dibawah ini menggunakan metode grafik linier,
Gunakan persamaan stimultan untuk mendapatkan nilai optimum

a. Maximize z = 4x1 + 3x2

Subject to
Material 6x1 + 4x2 <= 48 lb
Tenaga Kerja 4x1 +8x2 <= 80 jam
x1, x2 >= 0

Soal:
x1 x2 >= 0
z 4 3 maximize
Material 6 4 <= 48 lb 0.25 -0.125
Tenaga Kerja 4 8 <= 80 jam -0.125 0.1875

Tentukan:
Kuantitas untuk z maksimal

Jawaban:
Intercept x1 x2
Material 0 12 48 14
8 0 48
Tenaga Kerja 0 10 80 12
20 0 80
10 1
4
8
x1 2
x2 9 6

Corner Points z = 4x1 + 3x2 4

x1 x2 z
35 2 9 35 max 2
0 0 0 0 2 3
0
32 8 0 32 0 5 10 15 20
30 0 10 30

Jawaban 2: Solver

z 35 4 3
Material 48 6 4
Tenaga Kerja 80 4 8

x1 x2
2 9
 48 2
80 9

=MINVERSE(C13:D14)

Material 0.25 -0.125 48

Tenaga Kerja -0.125 0.1875 80

10 15 20 25

1 7
1 10
12
=MMULT(P27:Q28;S27:S28)

2
9
 Max: 2x + 5y Intercept:
S.To: x + 2y <= 16 C1 x + 2y <= 16
5x + 3y <= 45 C2 x y
x, y >= 0 (non negativity constraint) 0 8
16 0
SOLVER
x y Total 5x + 3y <= 45
2 5 x y
1 2 16 16 0 15
5 3 24 45 9 0
0 8 Max= 40

Chart Title
Eliminasi:
16
x + 2y = 16
14 5x + 3y = 45
12

10

8 x + 2y = 16
6 x + 2*5 = 16
x = 16 - 10 = 6
4

0
0 2 4 6 8 10 12 14 16 18
 16

14

12

10

6
4
4 feasible region

0
0 2 4 6 8 10 12 14 16 18

Max z
5x + 10y = 80 Point x Point y 2x + 5y
5x + 3y = 45 0 8 40
7y = 35 0 0 0
y = 35/7 = 5 10 0 20
6 5 37