aplikom03 excel or
TRANSCRIPT
![Page 1: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/1.jpg)
1
Aplikasi Riset Operasional
Dalam Spread SheetArif Rahman, ST MT
![Page 2: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/2.jpg)
2
Linear ProgrammingLinear Programming merupakan pemodelan matematika optimasi pada permasalahan minimasi dan maksimasi satu fungsi tujuan linier dengan satu atau beberapa persamaan dan atau pertidaksamaan fungsi kendala linier.Pada tahun 1939, L.V. Kantorovich (Soviet) merumuskan permasalahan dalam formula linear programming.Metode simplex sebagai algoritma pemecahan permasalahan linear programming dikembangkan oleh George B. Dantzig (Amerika Serikat) pada 1947.Istilah linear programming dicetuskan oleh T.C.Koopmans pada 1948.
![Page 3: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/3.jpg)
3
Linear ProgrammingVariables
Decision variablesStructural variablesAuxiliary variablesSlack variablesArtificial variables
CoefficientsCost coefficientsTechnological coefficientsConstraint parameter or Right Hand Side value
FunctionObjective or criterion functionRestriction or functional constraintsNonnegativity constraints
![Page 4: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/4.jpg)
4
Linear ProgrammingMaximize z = c1x1 + c2x2 + … + cnxn
Subject toa11x1 + a12x2 + … + a1nxn b1
a21x1 + a22x2 + … + a2nxn b2
am1x1 + am2x2 + … + amnxn bm
andx1 0; x2 0; … ; xn 0
Maximize or Minimize
or or =
0 or 0 or unrestricted
![Page 5: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/5.jpg)
5
Linear ProgrammingMetode SimplexMetode dua faseMetode Big-MMetode Revised SimplexMetode Primal-DualSpecial variables
Bounded variablesUnrestricted variablesInteger variables
Goal Programming
![Page 6: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/6.jpg)
6
Linear ProgrammingAsumsi
ProportionalityAdditivityDivisibilityDeterministic or certainty
Variabel basis dan nonbasisSolusi
Solusi optimal unikSolusi optimal alternatifSolusi unboundedSolusi infeasible
Analisis SensitivitasPerubahan cost coefficientPerubahan constraint parameterPerubahan technological coefficientPenambahan decision variablePenambahan restriction constraint
![Page 7: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/7.jpg)
7Program Solver dalam ExcelMS Excel 2003 &
sebelumnyaPilih menu ToolsPilih pulldown submenu Add-InsAktifkan Solver Add-in
![Page 8: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/8.jpg)
8Program Solver dalam ExcelMS Excel 2007 &
sesudahnyaBuka Excel OptionsPilih Add-InsManage Excell Add-Ins, & GoAktifkan Solver Add-in
![Page 9: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/9.jpg)
9Program Solver dalam Excel
![Page 10: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/10.jpg)
10
Linear ProgrammingMaximize z = 100 x1 + 200 x2 + 300 x3 Subject to
2x1 + 1x2 + 3x3 5000-1x1 + 2x2 + 1x3 2000 4x1 + 2x2 + 2x3 100 3x1 + 0x2 + 1x3 = 500
![Page 11: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/11.jpg)
11
Linear ProgrammingFormula pada Z di objective function= ( c1*x1 ) + ( c2*x2 ) + … + ( cn*xn )Atau= Sumproduct (cost coefficients array ; decision
variables array)Formula pada Value di constraints= ( a11*x1 ) + ( a12*x2 ) + … + ( a1n*xn )Atau= Sumproduct (technological coefficients array ;
decision variables array)Formula pada Slack Variables= RHS value - value
![Page 12: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/12.jpg)
12
Tools Solver…Set Target Cell pada cell dari ZChanging Cells pada range dari decision variables Add Constraint meliputi restriction constraints dan nonnegativity constraints
![Page 13: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/13.jpg)
13
SolusiAnswer ReportSensitivity AnalysisReportVariables Limits Report
![Page 14: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/14.jpg)
14Integer Linear Programming
Add Constraint dengan range dari decision variables sebagai integer
![Page 15: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/15.jpg)
15
Goal ProgrammingFactor
Contribution1 2 3
Goal Penalty
Profit 12 9 15 120 5 (-)
Employment 5 3 4 = 40 2 (+), 4 (-)
Investment 5 7 8 60 3 (+)
![Page 16: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/16.jpg)
16
Goal ProgrammingMinimize z = 5 y1
- + 2 y2+ + 4 y2
- + 3 y3+
Subject to12x1 + 9x2 + 15x3 – ( y1
+ - y1- )= 120
5x1 + 3x2 + 4x3 – ( y2+ - y2
- )= 40
5x1 + 7x2 + 8x3 – ( y3+ - y3
- )= 60
![Page 17: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/17.jpg)
17
Goal ProgrammingFormula pada Z di objective function= Sumproduct (cost coefficients array ;
auxiliary variables array)
Formula pada Value di constraints= Sumproduct (technological coefficients array
; overall variables array)
Formula pada Slack Variables= RHS value - value
![Page 18: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/18.jpg)
18
Tools Solver…Set Target Cell pada cell dari ZChanging Cells pada range dari decision variables dan auxiliary variablesAdd Constraint meliputi restriction constraints dan nonnegativity constraints
![Page 19: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/19.jpg)
19
TransportationMinimize
Subject to
for each i = 1, 2, … , m
for each j = 1, 2, … , n
andxij 0 where i = 1, 2, … , m; j = 1, 2, … , n
m
i
n
jijij xcZ
1 1
.
i
n
jij sx
1
j
m
iij dx
1
![Page 20: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/20.jpg)
20
Transportation Destination Sup- 1 2 3 4 ply
Source
464 513 654 867
1 75
352 416 690 791
2 125
995 682 388 685
3 100
Demand 80 65 70 85
![Page 21: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/21.jpg)
21
TransportationMinimize z = 464 x11 + 513 x12 + … + 685 x34
Supply constraintsx11 + x12 + x13 + x14 75
x21 + x22 + x23 + x24 125
x31 + x32 + x33 + x34 100
Demand constraintsx11 + x21 + x31 80
x12 + x22 + x32 65
x13 + x23 + x33 70
x14 + x24 + x34 85
![Page 22: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/22.jpg)
22
Transportation
![Page 23: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/23.jpg)
23
TransportationFormula pada Z di objective function= Sumproduct (cost coefficients array ;
decision variables array)
Formula pada Value di constraints= Sumproduct (technological coefficients array
; decision variables array)
Formula pada Slack Variables= RHS value - value
![Page 24: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/24.jpg)
24
Tools Solver…Set Target Cell pada cell dari ZChanging Cells pada range dari decision variablesAdd Constraint meliputi supply constraints dan demand constraints
![Page 25: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/25.jpg)
25
AssignmentMinimize
Subject to
for each i = 1, 2, … , m
for each j = 1, 2, … , n
andxij 0 where i = 1, 2, … , m; j = 1, 2, … , n
m
i
n
jijij xcZ
1 1
.
11
n
jijx
11
m
iijx
![Page 26: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/26.jpg)
26
Assignment Job 1 2 3
Operator
13 12 11
1
15 13 20
2
5 10 6
3
![Page 27: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/27.jpg)
27
AssignmentMinimize z = 13 x11 + 12 x12 + … + 6 x33
Operator constraintsx11 + x12 + x13 = 1
x21 + x22 + x23 = 1
x31 + x32 + x33 = 1
Job constraintsx11 + x21 + x31 = 1
x12 + x22 + x32 = 1
x13 + x23 + x33 = 1
![Page 28: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/28.jpg)
28
Assignment
![Page 29: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/29.jpg)
29
AssignmentFormula pada Z di objective function= Sumproduct (cost coefficients array ;
decision variables array)
Formula pada Value di constraints= Sumproduct (technological coefficients array
; decision variables array)
Formula pada Slack Variables= RHS value - value
![Page 30: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/30.jpg)
30
Tools Solver…Set Target Cell pada cell dari ZChanging Cells pada range dari decision variablesAdd Constraint meliputi restriction constraints, nonnegativity constraint dan Integer constraints
![Page 31: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/31.jpg)
31
Minimal Cost NetworkMinimize
Subject to
for each i = 1, 2, … , m
andxij 0 where i , j = 1, 2, … , m
m
i
m
jijij xcZ
1 1
.
i
m
kki
m
jij bxx
11
![Page 32: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/32.jpg)
32
Minimal Cost Network
4
2
-5
-1
7
-5 3
6 -1
2 4
![Page 33: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/33.jpg)
33
Minimal Cost NetworkMinimize z = 2 x12 - 5 x13 + … + 7 x41
Subject to( x12 + x13 ) - ( x41 ) = 4
( x23 + x24 ) - ( x12 + x32 ) = 2
( x32 + x34 ) - ( x13 + x23 ) = -1
( x41 ) - ( x24 + x34 ) = -5
![Page 34: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/34.jpg)
34
Minimal Cost NetworkFormula pada Z di objective function= Sumproduct (cost coefficients array ;
decision variables array)
Formula pada Value di constraints= Sumproduct (technological coefficients array
; decision variables array)
Formula pada Slack Variables= RHS value - value
![Page 35: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/35.jpg)
35
Tools Solver…Set Target Cell pada cell dari ZChanging Cells pada range dari decision variablesAdd Constraint meliputi restriction constraints dan nonnegativity constraint
![Page 36: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/36.jpg)
36
Maximal Flow NetworkMinimize Z = flowSubject to
xij uij where i = 1, 2, … , m
andxij 0 where i , j = 1, 2, … , m
miflowmi
iflowxx
m
kki
m
jij
if1 if0
1 if
11
![Page 37: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/37.jpg)
37
Maximal Flow Network
4 2
2
1 3
![Page 38: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/38.jpg)
38
Maximal Flow NetworkMaximize z = x12 + x13
Subject to( x12 + x13 ) = z( x23 + x24 ) - ( x12 ) = 0( x34 ) - ( x13 + x23 ) = 0- ( x24 + x34 ) = -zx12 1 ; x13 4 ; x23 2 ; x24 3 ; x34 2
![Page 39: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/39.jpg)
39
Maximal Flow NetworkFormula pada Z di objective function= Sum (from node 1 decision variables array)
Formula pada RHS value= Z untuk node 1= 0 untuk node selain 1 atau m= -Z untuk node m
Formula pada Value di constraints= Sumproduct (technological coefficients array ;
decision variables array)Formula pada Slack Variables= RHS value - value
![Page 40: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/40.jpg)
40
Tools Solver…Set Target Cell pada cell dari ZChanging Cells pada range dari decision variablesAdd Constraint meliputi restriction constraints dan nonnegativity constraint
![Page 41: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/41.jpg)
41
Shortest Path NetworkMinimize
Subject to
for each i = 1, 2, … , m
andxij 0 where i , j = 1, 2, … , m
mimi
ixx
m
kki
m
jij
if11 if0
1 if1
11
m
i
m
jijij xcZ
1 1
.
![Page 42: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/42.jpg)
42
Shortest Path Network
-1 -6
-4
2 3
![Page 43: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/43.jpg)
43
Shortest Path NetworkMinimize z = 2 x12 - 1 x13 - 4 x23 + 3 x24 - 6 x34
Subject to( x12 + x13 ) = 1
( x23 + x24 ) - ( x12 ) = 0
( x34 ) - ( x13 + x23 ) = 0
- ( x24 + x34 ) = -1
![Page 44: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/44.jpg)
44
Shortest Path NetworkFormula pada Z di objective function= Sumproduct (cost coefficients array ; decision
variables array)Formula pada RHS value= 1 untuk node 1= 0 untuk node selain 1 atau m= -1 untuk node m
Formula pada Value di constraints= Sumproduct (technological coefficients array ;
decision variables array)Formula pada Slack Variables= RHS value - value
![Page 45: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/45.jpg)
45
Tools Solver…Set Target Cell pada cell dari ZChanging Cells pada range dari decision variablesAdd Constraint meliputi restriction constraints, nonnegativity constraint dan Integer constraints
![Page 46: Aplikom03 excel or](https://reader035.vdocuments.site/reader035/viewer/2022062517/58ee3a251a28abde3d8b462b/html5/thumbnails/46.jpg)
46
Akhir Perkuliahan…Akhir Perkuliahan…
… … Ada Yang DitanyakanAda Yang Ditanyakan