A Principled Approach to MILP Modeling
|
|
- Laurence Bell
- 5 years ago
- Views:
Transcription
1 A Prncpled Approach o MILP Modelng John Hooer Carnege Mellon Unvers Augus 008 Slde
2 Proposal MILP modelng s an ar, bu need no be unprncpled. Slde
3 Proposal MILP modelng s an ar, bu need no be unprncpled. I has wo basc componens: Dsuncve modelng of subses of connuous space. Knapsac modelng of counng deas. Slde 3
4 Proposal MILP modelng s an ar, bu need no be unprncpled. I has wo basc componens: Dsuncve modelng of subses of connuous space. Knapsac modelng of counng deas. MILPs can model subses of connuous space ha are unons of polhedra. ha s, represened b dsuncons of lnear ssems. Slde 4
5 Proposal MILP modelng s an ar, bu need no be unprncpled. I has wo basc componens: Dsuncve modelng of subses of connuous space. Knapsac modelng of counng deas. MILPs can model subses of connuous space ha are unons of polhedra. ha s, represened b dsuncons of lnear ssems. So a prncpled approach s o analze he problem as Slde 5 dsuncons neger of lnear + napsac ssems nequales
6 Proposal Jeroslow s Represenabl Theorem provdes heorecal bass for dsuncve modelng. Bounded MILP represenabl assumes bounded neger varables. Ths s nadequae for napsac modelng. Slde 6
7 Proposal Jeroslow s Represenabl Theorem provdes heorecal bass for dsuncve modelng. Bounded MILP represenabl assumes bounded neger varables. Ths s nadequae for napsac modelng. We wll generalze Jeroslow s heorem. Knapsac modelng accommodaed. Ineger varables can be unbounded. Slde 7
8 Oulne Bounded med neger represenabl Bounded represenabl heorem. Conve hull formulaon Eample: Fed charge problem Wh he dsuncve model wors Mulple dsuncons Eample: Facl locaon Eample: Lo szng wh seup coss Bg-M dsuncve formulaon Slde 8 Eample: Healh care benefs
9 Oulne General med neger represenabl Knapsac models General represenabl heorem. Conve hull formulaon Eample: Facl locaon Wh a sngle recesson cone Eample: Fregh pacng and ransfer Research ssues Slde 9
10 Slde 0 Bounded MILP Represenabl
11 Bounded represenabl heorem Defnon of R. Jeroslow: R A subse S of s bounded MILP represenable f S s he proecon ono of he feasble se of some MILP consran se of he form n A + Bz + D b n R, z R {0,} p m Bounded general neger varables can be encoded as 0- varables Aular connuous varables can be used Slde
12 Bounded represenabl heorem Theorem (Jeroslow). A subse of connuous space s bounded MILP represenable f and onl f s he unon of fnel man polhedra havng he same recesson cone. Recesson cone of polhedron Polhedron Unon of polhedra wh he same recesson cone (n hs case, he orgn) Slde
13 Conve hull formulaon Sar wh a dsuncon of lnear ssems o represen he unon of polhedra. ( A b ) The h polhedron s { A b} Inroduce a 0- varable ha s when s n polhedron. Dsaggregae o creae an for each. A b, all = = { 0,} Slde 3
14 Conve hull formulaon Sar wh a dsuncon of lnear ssems o represen he unon of polhedra. ( A b ) The h polhedron s { A b} Inroduce a 0- varable ha s when s n polhedron. Dsaggregae o creae an for each. Ever bounded MILP represenable se has a model of hs form. A b, all = = { 0,} Slde 4
15 Conve Hull Formulaon The connuous relaaon of hs dsuncve MILP provdes a conve hull relaaon of he dsuncon. Srcl, descrbes he closure of he conve hull. Unon of polhedra Conve hull relaaon (ghes lnear relaaon) Slde 5
16 Idea behnd he conve hull formulaon Sar b formulang a conve hull formulaon of he relaaon of he dsuncon Wre each soluon as a conve combnaon of pons n he polhedron A b, all = = [0,] Conve hull relaaon Slde 6
17 Idea behnd he conve hull formulaon Now appl a change of varable Wre each soluon as a conve combnaon of pons n he polhedron A b, all = = [0,] Change of varable = A b, all = = [0,] Conve hull relaaon Slde 7
18 Idea behnd he conve hull formulaon Now mae s 0- varables o ge an MILP represenaon A b, all = = { 0,} Mae s 0- A b, all = = [0,] Conve hull formulaon Slde 8
19 Idea behnd he conve hull formulaon When s hs a vald formulaon? Le s loo a an eample frs A b, all = = { 0,} Conve hull formulaon Slde 9
20 Eample: Fed charge funcon Mnmze a fed charge funcon: mn 0 f = 0 f + c f > 0 0 Slde 0
21 Fed charge problem Mnmze a fed charge funcon: mn 0 f = 0 f + c f > 0 0 Feasble se (epgraph) Slde
22 Fed charge problem Mnmze a fed charge funcon: mn 0 f = 0 f + c f > 0 0 Unon of wo polhedra P, P P Slde
23 Fed charge problem Mnmze a fed charge funcon: mn 0 f = 0 f + c f > 0 0 Unon of wo polhedra P, P P P Slde 3
24 Fed charge problem Mnmze a fed charge funcon: mn 0 f = 0 f + c f > 0 0 The polhedra have dfferen recesson cones. P P Slde 4 P recesson cone P recesson cone
25 Fed charge problem Dsuncve model descrbes conve hull relaaon bu no he feasble se. mn = f + c P P Slde 5
26 Fed charge problem Sar wh a dsuncon of lnear ssems o represen he unon of polhedra mn = f + c Inroduce a 0- varable ha s when s n polhedron. Dsaggregae o creae an for each. mn = c f + =, [0,] = +, = + Slde 6
27 To smplf, replace wh snce = 0 mn = c f + =, [0,] = +, = + Slde 7
28 To smplf, replace wh snce = 0 mn 0 + = + 0 c f + =, [0,] Slde 8
29 Replace wh because plas no role n he model mn 0 + = =, [0,] c f Slde 9
30 Replace wh because plas no role n he model mn 0 c + f + =, [0,] Slde 30
31 Replace wh because plas no role n he model mn 0 c + f + =, [0,] Slde 3
32 Replace wh because plas no role n he model mn [0,] 0 c + f Slde 3
33 The conve hull s hs. mn [0,] 0 c + f P P Slde 33
34 mn [0,] 0 c + f Relaaon correcl descrbes closure of conve hull P P Slde 34
35 mn 0 c + f {0,} Bu MILP model does no descrbe feasble se P P Slde 35
36 To f he problem Add an upper bound on mn 0 f = 0 f + c f > 0 0 M The polhedra have he same recesson cone. P P Slde 36 M P recesson cone P recesson cone
37 Fed charge problem mn The dsuncon s now = 0 0 M 0 f + c P P Slde 37 M
38 Fed charge problem mn = 0 0 M 0 f + c The dsuncve model s mn = 0 0 M 0 + c f { } + =, 0, = +, = + Slde 38
39 Ths smplfes as before mn 0 M c + f { 0, } Slde 39
40 Ths smplfes as before mn 0 M c + f { 0, } Prevous model mn 0 c + f { 0, } Slde 40
41 Ths smplfes as before mn 0 M c + f { 0, } or mn c + f 0 M { 0,} Bg M Prevous model mn 0 c + f { 0, } Slde 4
42 The model now correcl mn c + f descrbes he feasble se. { 0,} 0 M Bg M P P Slde 4 M
43 Wh he dsuncve model wors P l Recesson cone of polhedra mn c A b, all = = { 0,} Le S be feasble se. P Slde 43
44 Wh he dsuncve model wors P l mn c A b, all = = { 0,} P Le S be feasble se. S some P Slde 44
45 Wh he dsuncve model wors P l mn c A b, all = = { 0,} P Le S be feasble se. S some P sasfes he model for =, oher s = 0 l =, oher s = 0 l Slde 45
46 Wh he dsuncve model wors P l mn c A b, all = = { 0,} P Conversel, suppose,, s sasf he model some = P Slde 46
47 Wh he dsuncve model wors P l mn c A b, all = = { 0,} P Conversel, suppose,, s sasf he model some = P A l l 0 for oher ls Slde 47
48 Wh he dsuncve model wors P l mn c A b, all = l { 0,} = P Conversel, suppose,, s sasf he model some = P A l l l s are recesson drecons for oher 0 for oher ls P s l Slde 48
49 Wh he dsuncve model wors P l mn c A b, all = l { 0,} = P Conversel, suppose,, s sasf he model some = P A l l l s are recesson drecons for P 0 for oher ls Slde 49
50 Wh he dsuncve model wors P l l = + l mn c A b, all = = { 0,} Slde 50 P Conversel, suppose,, s sasf he model some = P A l l l s are recesson drecons for P l l A 0 A = A + b l 0 for oher ls
51 Wh he dsuncve model wors P l l = + l mn c A b, all = = { 0,} Slde 5 P Conversel, suppose,, s sasf he model some = P A l l l s are recesson drecons for P l l A 0 A = A + b l P S 0 for oher ls
52 Mulple dsuncons Combnng ndvdual conve hull formulaons for wo dsuncons ( A a ) ( B b ) does no necessarl produce a conve hull formulaon for he par Theorem. unless he dsuncons have no common varables. Slde 5
53 Eample: Facl locaon Capac m possble facor locaons n mares Locae facores o serve mares so as o mnmze oal fed cos and ranspor cos. C D Demand Fed cos f c Transpor cos Slde 53
54 Fed cos Facl locaon m possble facor locaons C f Slde 54 c Transpor cos n mares D Dsuncve model: mn C = 0, all z f, all z 0 = 0, all = D, all z + c Facor a locaon Amoun shpped from facor o mare No facor a locaon
55 Facl locaon Slde 55 Dsuncve model: MILP formulaon: mn C = 0, all z f, all z 0 = 0, all = D, all mn C, all = D, all {0,}, 0, all, z + c f + c
56 Uncapacaed facl locaon Begnner s msae: Model as specal case of capacaed problem mn n, all { 0,} f + c =, all Facor has ma oupu n Fracon of demand sasfed b facor Ths s no he bes model. We can oban a gher model b sarng wh dsuncve formulaon. Slde 56
57 Uncapacaed facl locaon m possble facor locaons n mares Dsuncve model: Fracon of demand sasfed b facor mn z + c Fed cos f c Transpor cos 0, all = 0, all, all z f z 0 = =, all Facor a locaon No facor a locaon Slde 57
58 Uncapacaed facl locaon Slde 58 MILP formulaon: Begnner s model: mn 0, all, mn f + c =, all {0,}, all n, all =, all {0,}, all f + c Ths s he eboo model. More consrans, bu gher relaaon.
59 Eample: Lo szng wh seup coss Ma producon level Seup cos ncurred = Demand = D 0 D D D 3 D 4 D 5 D 6 Deermne lo sze n each perod o mnmze oal producon, nvenor, and seup coss. Slde 59
60 Fed-cos varable Fed cos Producon capac Producon level v f v 0 v 0 0 C 0 C = 0 () Sar producon (ncurs seup cos) Logcal condons: () Connue producon (no seup cos) (3) Produce nohng (no producon cos) () In perod () or () n perod () In perod neher () nor () n perod Slde 60
61 () Sar producon () Connue producon (3) Produce nohng v f v 0 v 0 0 C 0 C = 0 Conve hull MILP model of dsuncon: 0 v f C 0 v 0 C v 3 3 = =, =, = = = = v v {0,}, =,,3 Slde 6
62 To smplf, defne z = = Conve hull MILP model of dsuncon: 0 v f C 0 v 0 C v 3 3 = =, =, = = = = v v {0,}, =,,3 Slde 6
63 To smplf, defne z = = Conve hull MILP model of dsuncon: 0 v f z C z v 0 0 C v 3 3 = =, =, z + = = v v z, {0,}, =,,3 Slde 63 = for sarup = for connued producon
64 Snce = 0 se 3 = + Conve hull MILP model of dsuncon: 0 v f z Cz 0 v 0 C v 3 3 = = = v = v, =, z + z, {0,}, =,,3 Slde 64
65 Snce = 0 se 3 = + Conve hull MILP model of dsuncon: 0 C ( z + ) v f z v 0 v = v = v, z + z, {0,}, =,,3 Slde 65
66 Snce v occurs posvel n he obecve funcon, 3 and v, v do no pla a role, le v = v Conve hull MILP model of dsuncon: v f z 0 C ( z + ) v 0 v = v = v, z + z, {0,}, =,,3 Slde 66
67 Snce v occurs posvel n he obecve funcon, 3 and v, v do no pla a role, le v = v Conve hull MILP model of dsuncon: v f z 0 C ( z + ) + z, {0,}, =,,3 z Slde 67
68 Formulae logcal condons: () In perod () or () n perod () In perod neher () nor () n perod v f z 0 C ( z + ) z z, {0,}, =,,3 z + z + z Slde 68
69 Add obecve funcon Un producon cos Un holdng cos n mn ( p + h s + v ) = v f z 0 C ( z + ) + z, {0,}, =,,3 z z + z z Slde 69
70 Logcal varables To ghen an MILP formulaon of A B C D E F G ( ) A B E Pu logcal consran n CNF: A B E Replace negave wh posve varables: And add conve hull formulaon of hs clause. C D E Conecure: hs does no ghen he formulaon when he dsuncons have no varables n common. Slde 70
71 Bg-M Dsuncve Formulaon Agan sar wh a dsuncon of lnear ssems. ( A b ) Bg M s when s n polhedron. M s a vecor of bounds ha maes ssem nonbndng when = 0. { } ( ) A b M, all = 0,, all M = b mn A A b l l ( l ) Slde 7
72 Bg-M Dsuncve Formulaon Agan sar wh a dsuncon of lnear ssems. ( A b ) Bg M s when s n polhedron. M s a vecor of bounds ha maes ssem nonbndng when = 0. { } ( ) A b M, all = 0,, all M = b mn A A b l l ( l ) Ever bounded MILP-represenable se has a model of hs form (as well as a conve hull dsuncve model). Slde 7
73 Eample: Healh Care Benefs Dsrbue lmed healh benefs o wo persons. Person receves ul u. u Two crera: If u u, Rawlsan: ma mn{u,u } If u u >, ularan: ma u + u u Mamze welfare of person who s more serousl ll, unless hs requres oo much sacrfce from he oher person. Slde 73
74 Eample: Healh Care Benefs Dsrbue lmed healh benefs o wo persons. Person receves ul u. u Two crera: If u u, Rawlsan: ma mn{u,u } If u u >, ularan: ma u + u Opmzaon problem: Slde 74 S u ma z { } mn u, u + f u u z u + u oherwse u, u S
75 Eample: Healh Care Benefs Dsrbue lmed healh benefs o wo persons. Person receves ul u. u Two crera: If u u, Rawlsan: ma mn{u,u } If u u >, ularan: ma u + u Opmzaon problem: Slde 75 S u ma z { } mn u, u + f u u z u + u oherwse u, u S Ensures connu
76 Eample: Healh Care Benefs Dsrbue lmed healh benefs o wo persons. Person receves ul u. u Ignorng S, we would le a conve hull MILP model of he epgraph. Can we do? No! Opmzaon problem: Slde 76 u ma z { } mn u, u + f u u z u + u oherwse u, u S
77 Eample: Healh Care Benefs Dsrbue lmed healh benefs o wo persons. Person receves ul u. u Epgraph s unon of wo polhedra: P has recesson cone {( α, β, z) z α + β, α, β 0} u Slde 77
78 Eample: Healh Care Benefs Dsrbue lmed healh benefs o wo persons. Person receves ul u. u Epgraph s unon of wo polhedra: P has recesson cone {( α, β, z) z α + β, α, β 0} P has recesson cone {(,, z) 0 z } { (,0,0),(0,,0) } Slde 78
79 Eample: Healh Care Benefs Dsrbue lmed healh benefs o wo persons. Person receves ul u. u Soluon: Add consran u u M M No need o bound u, u ndvduall M u Slde 79
80 Eample: Healh Care Benefs Dsrbue lmed healh benefs o wo persons. Person receves ul u. u Soluon: Add consran u u M M No need o bound u, u ndvduall P has recesson cone (,, z) 0 z { } M u Slde 80
81 Eample: Healh Care Benefs Dsrbue lmed healh benefs o wo persons. Person receves ul u. u Soluon: Add consran u u M M No need o bound u, u ndvduall P has recesson cone (,, z) 0 z { } So does P M u Slde 8
82 Eample: Healh Care Benefs Dsrbue lmed healh benefs o wo persons. Person receves ul u. M u Bg-M model: z u + + ( M ) z u + + ( M ) z u + u + ( ) u u M, u u M { } u, u 0, 0, M u Slde 8
83 Eample: Healh Care Benefs Dsrbue lmed healh benefs o wo persons. Person receves ul u. M u Bg-M model: z u + + ( M ) z u + + ( M ) z u + u + ( ) u u M, u u M { } u, u 0, 0, Theorem: Ths s a conve hull formulaon. M u Slde 83
84 Eample: Healh Care Benefs Dsrbue lmed healh benefs o wo persons. Person receves ul u. M u Bg-M model: z u + + ( M ) z u + + ( M ) z u + u + ( ) u u M, u u M { } u, u 0, 0, Theorem: Ths s a conve hull formulaon. M u Model s no gher f we use u, u M Slde 84
85 Eample: Healh Care Benefs Opmzaon problem for he n-person case: ma z { } n { } { } z ( n ) + nmn u + ma 0, u mn u u u M, all, u 0, u S = Slde 85
86 Eample: Healh Care Benefs Opmzaon problem for he n-person case: ma z { } n { } { } z ( n ) + nmn u + ma 0, u mn u u u M, all, u 0, u S = Bg-M dsuncve model: Slde 86 ma z z + w, all { } = w + u + ( M ), all, w u + ( ), all, = 0, all u u M, all, n u S 0,, all,
87 Eample: Healh Care Benefs Opmzaon problem for he n-person case: ma z { } n { } { } z ( n ) + nmn u + ma 0, u mn u u u M, all, u 0, u S = Bg-M dsuncve model: Slde 87 ma z z + w, all { } = w + u + ( M ), all, w u + ( ), all, = 0, all u u M, all, n u S 0,, all, Theorem: Ths s a conve hull formulaon.
88 Slde 88 General MILP Represenabl
89 Knapsac Models Ineger varables can also be used o epress counng deas. Ths s oall dfferen from he use of 0- varables o epress unons of polhedra. Eamples: Knapsac nequales Pacng and coverng Logcal clauses Cos bounds Slde 89
90 Knapsac Models Dsuncve represenabl does no accommodae napsac consrans n a naural wa. Knapsac consrans are bounded MILP represenable onl f neger varables are bounded. and onl n a echncal sense. B regardng each neger lace pon as a polhedron. Slde 90
91 General represenabl heorem Ineger varables can now be unbounded: n p R Z A subse S of s MILP represenable f S s he proecon ono of he feasble se of some MILP consran se of he form A + Bz + D b R Z, z R {0,} n p m q Some modelng varables are connuous, some neger Aular connuous varables can be used Slde 9
92 General represenabl heorem Ineger varables can be unbounded: n p R Z A subse S of s MILP represenable f S s he proecon ono of he feasble se of some MILP consran se of he form A + Bz + D b R Z, z R {0,} n p m q Assume ha A, B, D, b conss of raonal daa Slde 9
93 General represenabl heorem Ineger varables can be unbounded: n p R Z A subse S of s MILP represenable f S s he proecon ono of he feasble se of some MILP consran se of he form A + Bz + D b R Z, z R {0,} n p m q Assume ha A, B, D, b conss of raonal daa A med neger polhedron s an se of he form Slde 93 { n p R Z A b}
94 General represenabl heorem Raonal vecor d s a recesson drecon of a med n neger polhedron P R Z f s a recesson drecon of n+ p some polhedron Q R for whch P ( n p R Z ) = Q p Med neger polhedron P Slde 94
95 General represenabl heorem Raonal vecor d s a recesson drecon of a med n neger polhedron P R Z f s a recesson drecon of n+ p some polhedron Q R for whch P ( n p R Z ) = Q p Med neger polhedron P Polhedron Q Slde 95
96 General represenabl heorem Raonal vecor d s a recesson drecon of a med n neger polhedron P R Z f s a recesson drecon of n+ p some polhedron Q R for whch P ( n p R Z ) = Q p Recesson cone of Q = recesson cone of P Med neger polhedron P Polhedron Q Slde 96
97 General represenabl heorem n+ p Lemma. All polhedra nr havng he same nonemp n p nersecon whr Z have he same recesson cone. Recesson cone of Q = recesson cone of P Med neger polhedron P Polhedron Q Slde 97
98 General represenabl heorem n p Theorem. A nonemp subse of R Z s MILP represenable f and onl f s he unon of fnel man med neger polhedra n p n R Z havng he same recesson cone. Recesson cone of Q = recesson cone of P Med neger polhedron P Unon of med neger polhedra wh he same recesson cone (n hs case, he orgn) Polhedron Q Slde 98
99 Conve Hull Formulaon Sar wh a dsuncon of lnear ssems o represen he unon of med neger polhedra. The h polhedron s { R n Z p A b } ( A b ) Asde from doman of, he dsuncve model s he same as before. A b, all = = { } n p R Z, 0, Slde 99
100 Conve Hull Formulaon Sar wh a dsuncon of lnear ssems o represen he unon of med neger polhedra. The h polhedron s { R n Z p A b } ( A b ) Asde from doman of, he dsuncve model s he same as before. Ever MILP represenable se has a model of hs form. A b, all = = { } n p R Z, 0, Slde 00
101 Conve Hull Formulaon Sar wh a dsuncon of lnear ssems o represen he unon of med neger polhedra. The h polhedron s { R n Z p A b } ( A b ) Asde from doman of, he dsuncve model s he same as before. Ever MILP represenable se has a model of hs form. also a model n dsuncve bg-m form. A b, all = = { } n p R Z, 0, Slde 0
102 Conve Hull Formulaon Theorem. If each med neger polhedron has a conve hull formulaon A b, he dsuncve model s a conve hull formulaon of he dsuncon. Unon of med neger polhedra wh conve hull descrpons Conve hull relaaon Slde 0
103 Eample: Facl locaon m possble facor locaons n mares Locae facores o serve mares so as o mnmze oal facor cos and ranspor cos. C D Fed cos ncurred for each vehcle used. f Fed cos Slde 03 c K Transpor cos per vehcle
104 f Fed cos Facl locaon m possble facor locaons C Slde 04 c K n mares Transpor cos per vehcle Dsuncve model: mn C 0, all 0, all Kw =, all z z 0 f = w, all Z = D, all z + c w Facor a locaon Number of vehcles from facor o mare No facor a locaon
105 f Fed cos Facl locaon m possble facor locaons C Slde 05 c K n mares Transpor cos per vehcle Dsuncve model: mn C 0, all 0, all Kw =, all z z 0 f = w, all Z = D, all z + c w Descrbes med neger polhedron Facor a locaon Number of vehcles from facor o mare No facor a locaon
106 Facl locaon Slde 06 Dsuncve model: MILP formulaon: mn C 0, all 0, all Kw =, all z z 0 f = w, all Z = D, all mn C, all = D, all 0 K w, all, {0,}, w Z, all, z + c w f + c w
107 Wh a Sngle Recesson Cone Suppose S s represened b A + Bz + D b R Z, z R {0,} n p m q For each bnar, hs descrbes a med neger polhedron P( ). So S s a unon of med neger polhedra. Slde 07
108 Wh a sngle recesson cone Suppose S s represened b A + Bz + D b R Z, z R {0,} n p m q For each bnar, hs descrbes a med neger polhedron P( ). So S s a unon of med neger polhedra. Now s a recesson drecon of nonemp P( ) ff (,u, ) s a recesson drecon of A B D 0 n p m q u + : 0 0 u 0 R Z R 0 0 Slde 08
109 Wh a sngle recesson cone Suppose S s represened b A + Bz + D b R Z, z R {0,} n p m q For each bnar, hs descrbes a med neger polhedron P(). So S s a unon of med neger polhedra. Now s a recesson drecon of nonemp P() ff (,u, ) s a recesson drecon of A B D 0 n p m q u + : 0 0 u 0 R Z R 0 0 Tha s, ff A B D u Slde 09
110 Wh a sngle recesson cone Suppose S s represened b A + Bz + D b R Z, z R {0,} n p m q For each bnar, hs descrbes a med neger polhedron P(). So S s a unon of med neger polhedra. Now s a recesson drecon of nonemp P() ff (,u, ) s a recesson drecon of A B D 0 n p m q u + : 0 0 u 0 R Z R 0 0 Tha s, ff A B D u Bu hs s ndependen of. Slde 0
111 Eample: Fregh Pacng and Transfer Transpor pacages usng n rucs Each pacage has sze a. Each ruc has capac Q. Slde
112 Knapsac componen The rucs seleced mus have enough capac o carr he load. n = Q a = f ruc s seleced Slde
113 Dsuncve componen Cos varable Truc seleced Truc no seleced z c z 0 a Q = 0 { 0, }, all Cos of operang ruc = f pacage s loaded on ruc Slde 3
114 Dsuncve componen Cos varable Truc seleced Truc no seleced z c z 0 a Q = 0 { 0, }, all Descrbes med neger polhedron Cos of operang ruc = f pacage s loaded on ruc Slde 4
115 Dsuncve componen Truc seleced Truc no seleced z c z 0 a Q = 0 { 0, }, all 0 Conve hull MILP formulaon z a c Q Slde 5
116 The resulng model = = mn n = a Q, all 0, all, n n Q =, all, {0,} c a Dsuncve componen Logcal condon (each pacage mus be shpped) Knapsac componen Slde 6
117 The resulng model = = mn n = a Q, all 0, all, n n Q =, all, {0,} c a The s redundan bu maes he connuous relaaon gher. Ths s a modelng rc, par of he follore of modelng. Slde 7
118 The resulng model = = mn n = a Q, all 0, all, n n Q =, all, {0,} c a The s redundan bu maes he connuous relaaon gher. Ths s a modelng rc, par of he follore of modelng. Convenonal modelng wsdom would no use hs consran, because s he sum of he frs consran over. Bu radcall reduces soluon me, because generaes lfed napsac cus. Slde 8
119 Research ssues Can he smplfcaon of a conve hull MILP formulaon be auomaed? Wha are some condons under whch a bg-m dsuncve model s a conve hull formulaon? When does conve hull formulaon of logcal consrans ghen he model? How can a modelng ssem faclae and encourage prncpled modelng? Slde 9
A Tour of Modeling Techniques
A Tour of Modelng Technques John Hooker Carnege Mellon Unversy EWO Semnar February 8 Slde Oulne Med neger lnear (MILP) modelng Dsuncve modelng Knapsack modelng Consran programmng models Inegraed Models
More informationSolution in semi infinite diffusion couples (error function analysis)
Soluon n sem nfne dffuson couples (error funcon analyss) Le us consder now he sem nfne dffuson couple of wo blocks wh concenraon of and I means ha, n a A- bnary sysem, s bondng beween wo blocks made of
More informationDynamic Team Decision Theory. EECS 558 Project Shrutivandana Sharma and David Shuman December 10, 2005
Dynamc Team Decson Theory EECS 558 Proec Shruvandana Sharma and Davd Shuman December 0, 005 Oulne Inroducon o Team Decson Theory Decomposon of he Dynamc Team Decson Problem Equvalence of Sac and Dynamc
More informationCHAPTER 10: LINEAR DISCRIMINATION
CHAPER : LINEAR DISCRIMINAION Dscrmnan-based Classfcaon 3 In classfcaon h K classes (C,C,, C k ) We defned dscrmnan funcon g j (), j=,,,k hen gven an es eample, e chose (predced) s class label as C f g
More informationNotes on the stability of dynamic systems and the use of Eigen Values.
Noes on he sabl of dnamc ssems and he use of Egen Values. Source: Macro II course noes, Dr. Davd Bessler s Tme Seres course noes, zarads (999) Ineremporal Macroeconomcs chaper 4 & Techncal ppend, and Hamlon
More informationHow about the more general "linear" scalar functions of scalars (i.e., a 1st degree polynomial of the following form with a constant term )?
lmcd Lnear ransformaon of a vecor he deas presened here are que general hey go beyond he radonal mar-vecor ype seen n lnear algebra Furhermore, hey do no deal wh bass and are equally vald for any se of
More informationCombining Optimization and Constraint Programming
Combnng Opmzaon and Consran Programmng J. N. Hooker Carnege Mellon Unvers 4 h Inernaonal Conference on Operaons Research March Havana Some work s jon wh Ignaco Grossmann Carnege Mellon Unvers Hak-Jn Km
More informationScattering at an Interface: Oblique Incidence
Course Insrucor Dr. Raymond C. Rumpf Offce: A 337 Phone: (915) 747 6958 E Mal: rcrumpf@uep.edu EE 4347 Appled Elecromagnecs Topc 3g Scaerng a an Inerface: Oblque Incdence Scaerng These Oblque noes may
More informationLecture VI Regression
Lecure VI Regresson (Lnear Mehods for Regresson) Conens: Lnear Mehods for Regresson Leas Squares, Gauss Markov heorem Recursve Leas Squares Lecure VI: MLSC - Dr. Sehu Vjayakumar Lnear Regresson Model M
More informationCS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 4
CS434a/54a: Paern Recognon Prof. Olga Veksler Lecure 4 Oulne Normal Random Varable Properes Dscrmnan funcons Why Normal Random Varables? Analycally racable Works well when observaon comes form a corruped
More informationAdvanced time-series analysis (University of Lund, Economic History Department)
Advanced me-seres analss (Unvers of Lund, Economc Hsor Dearmen) 3 Jan-3 Februar and 6-3 March Lecure 4 Economerc echnues for saonar seres : Unvarae sochasc models wh Box- Jenns mehodolog, smle forecasng
More informationGraduate Macroeconomics 2 Problem set 5. - Solutions
Graduae Macroeconomcs 2 Problem se. - Soluons Queson 1 To answer hs queson we need he frms frs order condons and he equaon ha deermnes he number of frms n equlbrum. The frms frs order condons are: F K
More informationLecture 6: Learning for Control (Generalised Linear Regression)
Lecure 6: Learnng for Conrol (Generalsed Lnear Regresson) Conens: Lnear Mehods for Regresson Leas Squares, Gauss Markov heorem Recursve Leas Squares Lecure 6: RLSC - Prof. Sehu Vjayakumar Lnear Regresson
More informationIn the complete model, these slopes are ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL. (! i+1 -! i ) + [(!") i+1,q - [(!
ANALYSIS OF VARIANCE FOR THE COMPLETE TWO-WAY MODEL The frs hng o es n wo-way ANOVA: Is here neracon? "No neracon" means: The man effecs model would f. Ths n urn means: In he neracon plo (wh A on he horzonal
More informationTHE PREDICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS
THE PREICTION OF COMPETITIVE ENVIRONMENT IN BUSINESS INTROUCTION The wo dmensonal paral dfferenal equaons of second order can be used for he smulaon of compeve envronmen n busness The arcle presens he
More informationComb Filters. Comb Filters
The smple flers dscussed so far are characered eher by a sngle passband and/or a sngle sopband There are applcaons where flers wh mulple passbands and sopbands are requred Thecomb fler s an example of
More informationHIERARCHICAL DECISIONS FOR LINEAR/NON-LINEAR DISJUNCTIVE PROBLEMS
2 nd Mercosur Congress on Chemcal Engneerng 4 h Mercosur Congress on Process Sysems Engneerng HIERARCHICAL DECISIONS FOR LINEAR/NON-LINEAR DISJUNCTIVE PROLEMS Jorge M. Monagna and Aldo R. Vecche * INGAR
More informationON THE LINEAR PROGRAMMING AND GROUP RELAXATIONS OF THE UNCAPACITATED FACILITY LOCATION PROBLEM
ON THE LINEAR PROGRAMMING AND GROUP RELAXATIONS O THE UNAPAITATED AILITY LOATION PROLEM MOHAMMAD KHALIL A THESIS PRESENTED TO THE GRADUATE SHOOL O THE UNIVERSITY O LORIDA IN PARTIAL ULILLMENT O THE REQUIREMENTS
More informationTSS = SST + SSE An orthogonal partition of the total SS
ANOVA: Topc 4. Orhogonal conrass [ST&D p. 183] H 0 : µ 1 = µ =... = µ H 1 : The mean of a leas one reamen group s dfferen To es hs hypohess, a basc ANOVA allocaes he varaon among reamen means (SST) equally
More information[ ] 2. [ ]3 + (Δx i + Δx i 1 ) / 2. Δx i-1 Δx i Δx i+1. TPG4160 Reservoir Simulation 2018 Lecture note 3. page 1 of 5
TPG460 Reservor Smulaon 08 page of 5 DISCRETIZATIO OF THE FOW EQUATIOS As we already have seen, fne dfference appromaons of he paral dervaves appearng n he flow equaons may be obaned from Taylor seres
More informationUNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 2017 EXAMINATION
INTERNATIONAL TRADE T. J. KEHOE UNIVERSITAT AUTÒNOMA DE BARCELONA MARCH 27 EXAMINATION Please answer wo of he hree quesons. You can consul class noes, workng papers, and arcles whle you are workng on he
More informationChapter 6: AC Circuits
Chaper 6: AC Crcus Chaper 6: Oulne Phasors and he AC Seady Sae AC Crcus A sable, lnear crcu operang n he seady sae wh snusodal excaon (.e., snusodal seady sae. Complee response forced response naural response.
More informationLecture 18: The Laplace Transform (See Sections and 14.7 in Boas)
Lecure 8: The Lalace Transform (See Secons 88- and 47 n Boas) Recall ha our bg-cure goal s he analyss of he dfferenal equaon, ax bx cx F, where we emloy varous exansons for he drvng funcon F deendng on
More informationModeling and Solving of Multi-Product Inventory Lot-Sizing with Supplier Selection under Quantity Discounts
nernaonal ournal of Appled Engneerng Research SSN 0973-4562 Volume 13, Number 10 (2018) pp. 8708-8713 Modelng and Solvng of Mul-Produc nvenory Lo-Szng wh Suppler Selecon under Quany Dscouns Naapa anchanaruangrong
More informationCH.3. COMPATIBILITY EQUATIONS. Continuum Mechanics Course (MMC) - ETSECCPB - UPC
CH.3. COMPATIBILITY EQUATIONS Connuum Mechancs Course (MMC) - ETSECCPB - UPC Overvew Compably Condons Compably Equaons of a Poenal Vecor Feld Compably Condons for Infnesmal Srans Inegraon of he Infnesmal
More informationNormal Random Variable and its discriminant functions
Noral Rando Varable and s dscrnan funcons Oulne Noral Rando Varable Properes Dscrnan funcons Why Noral Rando Varables? Analycally racable Works well when observaon coes for a corruped snle prooype 3 The
More informationLet s treat the problem of the response of a system to an applied external force. Again,
Page 33 QUANTUM LNEAR RESPONSE FUNCTON Le s rea he problem of he response of a sysem o an appled exernal force. Agan, H() H f () A H + V () Exernal agen acng on nernal varable Hamlonan for equlbrum sysem
More informationEEL 6266 Power System Operation and Control. Chapter 5 Unit Commitment
EEL 6266 Power Sysem Operaon and Conrol Chaper 5 Un Commmen Dynamc programmng chef advanage over enumeraon schemes s he reducon n he dmensonaly of he problem n a src prory order scheme, here are only N
More informationOrdinary Differential Equations in Neuroscience with Matlab examples. Aim 1- Gain understanding of how to set up and solve ODE s
Ordnary Dfferenal Equaons n Neuroscence wh Malab eamples. Am - Gan undersandng of how o se up and solve ODE s Am Undersand how o se up an solve a smple eample of he Hebb rule n D Our goal a end of class
More informationMechanics Physics 151
Mechancs Physcs 5 Lecure 0 Canoncal Transformaons (Chaper 9) Wha We Dd Las Tme Hamlon s Prncple n he Hamlonan formalsm Dervaon was smple δi δ Addonal end-pon consrans pq H( q, p, ) d 0 δ q ( ) δq ( ) δ
More informationPHYS 1443 Section 001 Lecture #4
PHYS 1443 Secon 001 Lecure #4 Monda, June 5, 006 Moon n Two Dmensons Moon under consan acceleraon Projecle Moon Mamum ranges and heghs Reerence Frames and relae moon Newon s Laws o Moon Force Newon s Law
More informationOP = OO' + Ut + Vn + Wb. Material We Will Cover Today. Computer Vision Lecture 3. Multi-view Geometry I. Amnon Shashua
Comuer Vson 27 Lecure 3 Mul-vew Geomer I Amnon Shashua Maeral We Wll Cover oa he srucure of 3D->2D rojecon mar omograh Marces A rmer on rojecve geomer of he lane Eolar Geomer an Funamenal Mar ebrew Unvers
More informationGENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS. Youngwoo Ahn and Kitae Kim
Korean J. Mah. 19 (2011), No. 3, pp. 263 272 GENERATING CERTAIN QUINTIC IRREDUCIBLE POLYNOMIALS OVER FINITE FIELDS Youngwoo Ahn and Kae Km Absrac. In he paper [1], an explc correspondence beween ceran
More informationIntroduction to Compact Dynamical Modeling. III.1 Reducing Linear Time Invariant Systems. Luca Daniel Massachusetts Institute of Technology
SF & IH Inroducon o Compac Dynamcal Modelng III. Reducng Lnear me Invaran Sysems Luca Danel Massachuses Insue of echnology Course Oulne Quck Sneak Prevew I. Assemblng Models from Physcal Problems II. Smulang
More information( ) [ ] MAP Decision Rule
Announcemens Bayes Decson Theory wh Normal Dsrbuons HW0 due oday HW o be assgned soon Proec descrpon posed Bomercs CSE 90 Lecure 4 CSE90, Sprng 04 CSE90, Sprng 04 Key Probables 4 ω class label X feaure
More informationMulti-Fuel and Mixed-Mode IC Engine Combustion Simulation with a Detailed Chemistry Based Progress Variable Library Approach
Mul-Fuel and Med-Mode IC Engne Combuson Smulaon wh a Dealed Chemsry Based Progress Varable Lbrary Approach Conens Inroducon Approach Resuls Conclusons 2 Inroducon New Combuson Model- PVM-MF New Legslaons
More information(,,, ) (,,, ). In addition, there are three other consumers, -2, -1, and 0. Consumer -2 has the utility function
MACROECONOMIC THEORY T J KEHOE ECON 87 SPRING 5 PROBLEM SET # Conder an overlappng generaon economy le ha n queon 5 on problem e n whch conumer lve for perod The uly funcon of he conumer born n perod,
More informationOn One Analytic Method of. Constructing Program Controls
Appled Mahemacal Scences, Vol. 9, 05, no. 8, 409-407 HIKARI Ld, www.m-hkar.com hp://dx.do.org/0.988/ams.05.54349 On One Analyc Mehod of Consrucng Program Conrols A. N. Kvko, S. V. Chsyakov and Yu. E. Balyna
More information( t) Outline of program: BGC1: Survival and event history analysis Oslo, March-May Recapitulation. The additive regression model
BGC1: Survval and even hsory analyss Oslo, March-May 212 Monday May 7h and Tuesday May 8h The addve regresson model Ørnulf Borgan Deparmen of Mahemacs Unversy of Oslo Oulne of program: Recapulaon Counng
More informationCS286.2 Lecture 14: Quantum de Finetti Theorems II
CS286.2 Lecure 14: Quanum de Fne Theorems II Scrbe: Mara Okounkova 1 Saemen of he heorem Recall he las saemen of he quanum de Fne heorem from he prevous lecure. Theorem 1 Quanum de Fne). Le ρ Dens C 2
More informationAppendix H: Rarefaction and extrapolation of Hill numbers for incidence data
Anne Chao Ncholas J Goell C seh lzabeh L ander K Ma Rober K Colwell and Aaron M llson 03 Rarefacon and erapolaon wh ll numbers: a framewor for samplng and esmaon n speces dversy sudes cology Monographs
More information. The geometric multiplicity is dim[ker( λi. number of linearly independent eigenvectors associated with this eigenvalue.
Lnear Algebra Lecure # Noes We connue wh he dscusson of egenvalues, egenvecors, and dagonalzably of marces We wan o know, n parcular wha condons wll assure ha a marx can be dagonalzed and wha he obsrucons
More informationChapter 6 DETECTION AND ESTIMATION: Model of digital communication system. Fundamental issues in digital communications are
Chaper 6 DEECIO AD EIMAIO: Fundamenal ssues n dgal communcaons are. Deecon and. Esmaon Deecon heory: I deals wh he desgn and evaluaon of decson makng processor ha observes he receved sgnal and guesses
More informationDEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL
DEEP UNFOLDING FOR MULTICHANNEL SOURCE SEPARATION SUPPLEMENTARY MATERIAL Sco Wsdom, John Hershey 2, Jonahan Le Roux 2, and Shnj Waanabe 2 Deparmen o Elecrcal Engneerng, Unversy o Washngon, Seale, WA, USA
More information. The geometric multiplicity is dim[ker( λi. A )], i.e. the number of linearly independent eigenvectors associated with this eigenvalue.
Mah E-b Lecure #0 Noes We connue wh he dscusson of egenvalues, egenvecors, and dagonalzably of marces We wan o know, n parcular wha condons wll assure ha a marx can be dagonalzed and wha he obsrucons are
More informationLecture 11 SVM cont
Lecure SVM con. 0 008 Wha we have done so far We have esalshed ha we wan o fnd a lnear decson oundary whose margn s he larges We know how o measure he margn of a lnear decson oundary Tha s: he mnmum geomerc
More informationReactive Methods to Solve the Berth AllocationProblem with Stochastic Arrival and Handling Times
Reacve Mehods o Solve he Berh AllocaonProblem wh Sochasc Arrval and Handlng Tmes Nsh Umang* Mchel Berlare* * TRANSP-OR, Ecole Polyechnque Fédérale de Lausanne Frs Workshop on Large Scale Opmzaon November
More informationLinear Response Theory: The connection between QFT and experiments
Phys540.nb 39 3 Lnear Response Theory: The connecon beween QFT and expermens 3.1. Basc conceps and deas Q: ow do we measure he conducvy of a meal? A: we frs nroduce a weak elecrc feld E, and hen measure
More informationSingle-Allocation Hub Network Design Model with Consolidated Traffic Flows
See dscussons, sas, and auhor profles for hs publcaon a: hps://www.researchgae.ne/publcaon/235733752 Sngle-Allocaon Hub Nework Desgn Model wh Consoldaed Traffc Flows ARTICLE n TRANSPORTATION RESEARCH RECORD
More informationV.Abramov - FURTHER ANALYSIS OF CONFIDENCE INTERVALS FOR LARGE CLIENT/SERVER COMPUTER NETWORKS
R&RATA # Vol.) 8, March FURTHER AALYSIS OF COFIDECE ITERVALS FOR LARGE CLIET/SERVER COMPUTER ETWORKS Vyacheslav Abramov School of Mahemacal Scences, Monash Unversy, Buldng 8, Level 4, Clayon Campus, Wellngon
More informationTesting a new idea to solve the P = NP problem with mathematical induction
Tesng a new dea o solve he P = NP problem wh mahemacal nducon Bacground P and NP are wo classes (ses) of languages n Compuer Scence An open problem s wheher P = NP Ths paper ess a new dea o compare he
More informationAdvanced Machine Learning & Perception
Advanced Machne Learnng & Percepon Insrucor: Tony Jebara SVM Feaure & Kernel Selecon SVM Eensons Feaure Selecon (Flerng and Wrappng) SVM Feaure Selecon SVM Kernel Selecon SVM Eensons Classfcaon Feaure/Kernel
More informationCS 268: Packet Scheduling
Pace Schedulng Decde when and wha pace o send on oupu ln - Usually mplemened a oupu nerface CS 68: Pace Schedulng flow Ion Soca March 9, 004 Classfer flow flow n Buffer managemen Scheduler soca@cs.bereley.edu
More informationJ i-1 i. J i i+1. Numerical integration of the diffusion equation (I) Finite difference method. Spatial Discretization. Internal nodes.
umercal negraon of he dffuson equaon (I) Fne dfference mehod. Spaal screaon. Inernal nodes. R L V For hermal conducon le s dscree he spaal doman no small fne spans, =,,: Balance of parcles for an nernal
More informationCS 536: Machine Learning. Nonparametric Density Estimation Unsupervised Learning - Clustering
CS 536: Machne Learnng Nonparamerc Densy Esmaon Unsupervsed Learnng - Cluserng Fall 2005 Ahmed Elgammal Dep of Compuer Scence Rugers Unversy CS 536 Densy Esmaon - Cluserng - 1 Oulnes Densy esmaon Nonparamerc
More informationMath 128b Project. Jude Yuen
Mah 8b Proec Jude Yuen . Inroducon Le { Z } be a sequence of observed ndependen vecor varables. If he elemens of Z have a on normal dsrbuon hen { Z } has a mean vecor Z and a varancecovarance marx z. Geomercally
More informationOnline Supplement for Dynamic Multi-Technology. Production-Inventory Problem with Emissions Trading
Onlne Supplemen for Dynamc Mul-Technology Producon-Invenory Problem wh Emssons Tradng by We Zhang Zhongsheng Hua Yu Xa and Baofeng Huo Proof of Lemma For any ( qr ) Θ s easy o verfy ha he lnear programmng
More informationClustering (Bishop ch 9)
Cluserng (Bshop ch 9) Reference: Daa Mnng by Margare Dunham (a slde source) 1 Cluserng Cluserng s unsupervsed learnng, here are no class labels Wan o fnd groups of smlar nsances Ofen use a dsance measure
More information2/20/2013. EE 101 Midterm 2 Review
//3 EE Mderm eew //3 Volage-mplfer Model The npu ressance s he equalen ressance see when lookng no he npu ermnals of he amplfer. o s he oupu ressance. I causes he oupu olage o decrease as he load ressance
More informationMulti-Product Multi-Constraint Inventory Control Systems with Stochastic Replenishment and Discount under Fuzzy Purchasing Price and Holding Costs
Amercan Journal of Appled Scences 6 (): -, 009 ISSN 546-939 009 Scence Publcaons Mul-Produc Mul-Consran Invenory Conrol Sysems wh Sochasc eplenshmen and scoun under Fuzzy Purchasng Prce and Holdng Coss
More informationBundling with Customer Self-Selection: A Simple Approach to Bundling Low Marginal Cost Goods On-Line Appendix
Bundlng wh Cusomer Self-Selecon: A Smple Approach o Bundlng Low Margnal Cos Goods On-Lne Appendx Lorn M. H Unversy of Pennsylvana, Wharon School 57 Jon M. Hunsman Hall Phladelpha, PA 94 lh@wharon.upenn.edu
More informationFI 3103 Quantum Physics
/9/4 FI 33 Quanum Physcs Aleander A. Iskandar Physcs of Magnesm and Phooncs Research Grou Insu Teknolog Bandung Basc Conces n Quanum Physcs Probably and Eecaon Value Hesenberg Uncerany Prncle Wave Funcon
More informationIncluding the ordinary differential of distance with time as velocity makes a system of ordinary differential equations.
Soluons o Ordnary Derenal Equaons An ordnary derenal equaon has only one ndependen varable. A sysem o ordnary derenal equaons consss o several derenal equaons each wh he same ndependen varable. An eample
More informationLecture 2 L n i e n a e r a M od o e d l e s
Lecure Lnear Models Las lecure You have learned abou ha s machne learnng Supervsed learnng Unsupervsed learnng Renforcemen learnng You have seen an eample learnng problem and he general process ha one
More informationChapter Lagrangian Interpolation
Chaper 5.4 agrangan Inerpolaon Afer readng hs chaper you should be able o:. dere agrangan mehod of nerpolaon. sole problems usng agrangan mehod of nerpolaon and. use agrangan nerpolans o fnd deraes and
More informationEuropean Journal of Operational Research
European Journal of Operaonal Research 267 2018 86 95 Conens lss avalable a ScenceDrec European Journal of Operaonal Research journal homepage: www.elsever.com/locae/ejor Producon, Manufacurng and Logscs
More informationABSTRACT. KEYWORDS Hybrid, Genetic Algorithm, Shipping, Dispatching, Vehicle, Time Windows INTRODUCTION
A HYBRID GENETIC ALGORITH FOR A DYNAIC INBOUND ORDERING AND SHIPPING AND OUTBOUND DISPATCHING PROBLE WITH HETEROGENEOUS VEHICLE TYPES AND DELIVERY TIE WINDOWS by Byung Soo Km, Woon-Seek Lee, and Young-Seok
More informationOnline Appendix for. Strategic safety stocks in supply chains with evolving forecasts
Onlne Appendx for Sraegc safey socs n supply chans wh evolvng forecass Tor Schoenmeyr Sephen C. Graves Opsolar, Inc. 332 Hunwood Avenue Hayward, CA 94544 A. P. Sloan School of Managemen Massachuses Insue
More informationAn introduction to Support Vector Machine
An nroducon o Suppor Vecor Machne 報告者 : 黃立德 References: Smon Haykn, "Neural Neworks: a comprehensve foundaon, second edon, 999, Chaper 2,6 Nello Chrsann, John Shawe-Tayer, An Inroducon o Suppor Vecor Machnes,
More informationRobustness Experiments with Two Variance Components
Naonal Insue of Sandards and Technology (NIST) Informaon Technology Laboraory (ITL) Sascal Engneerng Dvson (SED) Robusness Expermens wh Two Varance Componens by Ana Ivelsse Avlés avles@ns.gov Conference
More information10. A.C CIRCUITS. Theoretically current grows to maximum value after infinite time. But practically it grows to maximum after 5τ. Decay of current :
. A. IUITS Synopss : GOWTH OF UNT IN IUIT : d. When swch S s closed a =; = d. A me, curren = e 3. The consan / has dmensons of me and s called he nducve me consan ( τ ) of he crcu. 4. = τ; =.63, n one
More informationPlanar truss bridge optimization by dynamic programming and linear programming
IABSE-JSCE Jon Conference on Advances n Brdge Engneerng-III, Augus 1-, 015, Dhaka, Bangladesh. ISBN: 978-984-33-9313-5 Amn, Oku, Bhuyan, Ueda (eds.) www.abse-bd.org Planar russ brdge opmzaon by dynamc
More informationChapters 2 Kinematics. Position, Distance, Displacement
Chapers Knemacs Poson, Dsance, Dsplacemen Mechancs: Knemacs and Dynamcs. Knemacs deals wh moon, bu s no concerned wh he cause o moon. Dynamcs deals wh he relaonshp beween orce and moon. The word dsplacemen
More informationMachine Learning 2nd Edition
INTRODUCTION TO Lecure Sldes for Machne Learnng nd Edon ETHEM ALPAYDIN, modfed by Leonardo Bobadlla and some pars from hp://www.cs.au.ac.l/~aparzn/machnelearnng/ The MIT Press, 00 alpaydn@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/mle
More informationOutline. Energy-Efficient Target Coverage in Wireless Sensor Networks. Sensor Node. Introduction. Characteristics of WSN
Ener-Effcen Tare Coverae n Wreless Sensor Newors Presened b M Trà Tá -4-4 Inroducon Bacround Relaed Wor Our Proosal Oulne Maxmum Se Covers (MSC) Problem MSC Problem s NP-Comlee MSC Heursc Concluson Sensor
More information( ) lamp power. dx dt T. Introduction to Compact Dynamical Modeling. III.1 Reducing Linear Time Invariant Systems
SF & IH Inroducon o Compac Dynamcal Modelng III. Reducng Lnear me Invaran Sysems Luca Danel Massachuses Insue of echnology Movaons dx A x( + b u( y( c x( Suppose: we are jus neresed n ermnal.e. npu/oupu
More informationRelative controllability of nonlinear systems with delays in control
Relave conrollably o nonlnear sysems wh delays n conrol Jerzy Klamka Insue o Conrol Engneerng, Slesan Techncal Unversy, 44- Glwce, Poland. phone/ax : 48 32 37227, {jklamka}@a.polsl.glwce.pl Keywor: Conrollably.
More information( ) () we define the interaction representation by the unitary transformation () = ()
Hgher Order Perurbaon Theory Mchael Fowler 3/7/6 The neracon Represenaon Recall ha n he frs par of hs course sequence, we dscussed he chrödnger and Hesenberg represenaons of quanum mechancs here n he chrödnger
More informationLearning Objectives. Self Organization Map. Hamming Distance(1/5) Introduction. Hamming Distance(3/5) Hamming Distance(2/5) 15/04/2015
/4/ Learnng Objecves Self Organzaon Map Learnng whou Exaples. Inroducon. MAXNET 3. Cluserng 4. Feaure Map. Self-organzng Feaure Map 6. Concluson 38 Inroducon. Learnng whou exaples. Daa are npu o he syse
More informationBayes rule for a classification problem INF Discriminant functions for the normal density. Euclidean distance. Mahalanobis distance
INF 43 3.. Repeon Anne Solberg (anne@f.uo.no Bayes rule for a classfcaon problem Suppose we have J, =,...J classes. s he class label for a pxel, and x s he observed feaure vecor. We can use Bayes rule
More informationSurvival Analysis and Reliability. A Note on the Mean Residual Life Function of a Parallel System
Communcaons n Sascs Theory and Mehods, 34: 475 484, 2005 Copyrgh Taylor & Francs, Inc. ISSN: 0361-0926 prn/1532-415x onlne DOI: 10.1081/STA-200047430 Survval Analyss and Relably A Noe on he Mean Resdual
More informationThe Dynamic Programming Models for Inventory Control System with Time-varying Demand
The Dynamc Programmng Models for Invenory Conrol Sysem wh Tme-varyng Demand Truong Hong Trnh (Correspondng auhor) The Unversy of Danang, Unversy of Economcs, Venam Tel: 84-236-352-5459 E-mal: rnh.h@due.edu.vn
More informationEcon107 Applied Econometrics Topic 5: Specification: Choosing Independent Variables (Studenmund, Chapter 6)
Econ7 Appled Economercs Topc 5: Specfcaon: Choosng Independen Varables (Sudenmund, Chaper 6 Specfcaon errors ha we wll deal wh: wrong ndependen varable; wrong funconal form. Ths lecure deals wh wrong ndependen
More informationShould Exact Index Numbers have Standard Errors? Theory and Application to Asian Growth
Should Exac Index umbers have Sandard Errors? Theory and Applcaon o Asan Growh Rober C. Feensra Marshall B. Rensdorf ovember 003 Proof of Proposon APPEDIX () Frs, we wll derve he convenonal Sao-Vara prce
More informationEP2200 Queuing theory and teletraffic systems. 3rd lecture Markov chains Birth-death process - Poisson process. Viktoria Fodor KTH EES
EP Queung heory and eleraffc sysems 3rd lecure Marov chans Brh-deah rocess - Posson rocess Vora Fodor KTH EES Oulne for oday Marov rocesses Connuous-me Marov-chans Grah and marx reresenaon Transen and
More information@FMI c Kyung Moon Sa Co.
Annals of Fuzzy Mahemacs and Informacs Volume 8, No. 2, (Augus 2014), pp. 245 257 ISSN: 2093 9310 (prn verson) ISSN: 2287 6235 (elecronc verson) hp://www.afm.or.kr @FMI c Kyung Moon Sa Co. hp://www.kyungmoon.com
More informationDiscrete Markov Process. Introduction. Example: Balls and Urns. Stochastic Automaton. INTRODUCTION TO Machine Learning 3rd Edition
EHEM ALPAYDI he MI Press, 04 Lecure Sldes for IRODUCIO O Machne Learnng 3rd Edon alpaydn@boun.edu.r hp://www.cmpe.boun.edu.r/~ehem/ml3e Sldes from exboo resource page. Slghly eded and wh addonal examples
More informationMachine Learning Linear Regression
Machne Learnng Lnear Regresson Lesson 3 Lnear Regresson Bascs of Regresson Leas Squares esmaon Polynomal Regresson Bass funcons Regresson model Regularzed Regresson Sascal Regresson Mamum Lkelhood (ML)
More informationComputing Relevance, Similarity: The Vector Space Model
Compung Relevance, Smlary: The Vecor Space Model Based on Larson and Hears s sldes a UC-Bereley hp://.sms.bereley.edu/courses/s0/f00/ aabase Managemen Sysems, R. Ramarshnan ocumen Vecors v ocumens are
More informationTHERMODYNAMICS 1. The First Law and Other Basic Concepts (part 2)
Company LOGO THERMODYNAMICS The Frs Law and Oher Basc Conceps (par ) Deparmen of Chemcal Engneerng, Semarang Sae Unversy Dhon Harano S.T., M.T., M.Sc. Have you ever cooked? Equlbrum Equlbrum (con.) Equlbrum
More informationEqualization on Graphs: Linear Programming and Message Passing
Equalzaon on Graphs: Lnear Programmng and Message Passng Mohammad H. Taghav and Paul H. Segel Cener for Magnec Recordng Research Unversy of Calforna, San Dego La Jolla, CA 92093-0401, USA Emal: (maghav,
More informationVariants of Pegasos. December 11, 2009
Inroducon Varans of Pegasos SooWoong Ryu bshboy@sanford.edu December, 009 Youngsoo Cho yc344@sanford.edu Developng a new SVM algorhm s ongong research opc. Among many exng SVM algorhms, we wll focus on
More informationP R = P 0. The system is shown on the next figure:
TPG460 Reservor Smulaon 08 page of INTRODUCTION TO RESERVOIR SIMULATION Analycal and numercal soluons of smple one-dmensonal, one-phase flow equaons As an nroducon o reservor smulaon, we wll revew he smples
More informationABSTRACT KEYWORDS. Bonus-malus systems, frequency component, severity component. 1. INTRODUCTION
EERAIED BU-MAU YTEM ITH A FREQUECY AD A EVERITY CMET A IDIVIDUA BAI I AUTMBIE IURACE* BY RAHIM MAHMUDVAD AD HEI HAAI ABTRACT Frangos and Vronos (2001) proposed an opmal bonus-malus sysems wh a frequency
More informationCHAPTER 5: MULTIVARIATE METHODS
CHAPER 5: MULIVARIAE MEHODS Mulvarae Daa 3 Mulple measuremens (sensors) npus/feaures/arbues: -varae N nsances/observaons/eamples Each row s an eample Each column represens a feaure X a b correspons o he
More informationDual Approximate Dynamic Programming for Large Scale Hydro Valleys
Dual Approxmae Dynamc Programmng for Large Scale Hydro Valleys Perre Carpener and Jean-Phlppe Chanceler 1 ENSTA ParsTech and ENPC ParsTech CMM Workshop, January 2016 1 Jon work wh J.-C. Alas, suppored
More informationSupporting information How to concatenate the local attractors of subnetworks in the HPFP
n Effcen lgorh for Idenfyng Prry Phenoype rcors of Lrge-Scle Boolen Newor Sng-Mo Choo nd Kwng-Hyun Cho Depren of Mhecs Unversy of Ulsn Ulsn 446 Republc of Kore Depren of Bo nd Brn Engneerng Kore dvnced
More informationXiangwen Li. March 8th and March 13th, 2001
CS49I Approxaton Algorths The Vertex-Cover Proble Lecture Notes Xangwen L March 8th and March 3th, 00 Absolute Approxaton Gven an optzaton proble P, an algorth A s an approxaton algorth for P f, for an
More informationControl Systems. Mathematical Modeling of Control Systems.
Conrol Syem Mahemacal Modelng of Conrol Syem chbum@eoulech.ac.kr Oulne Mahemacal model and model ype. Tranfer funcon model Syem pole and zero Chbum Lee -Seoulech Conrol Syem Mahemacal Model Model are key
More informationPanel Data Regression Models
Panel Daa Regresson Models Wha s Panel Daa? () Mulple dmensoned Dmensons, e.g., cross-secon and me node-o-node (c) Pongsa Pornchawseskul, Faculy of Economcs, Chulalongkorn Unversy (c) Pongsa Pornchawseskul,
More information