( ) ? () 1.1 ( 3 ) j x j 10 j 1 10 j = 1,..., 10 x 1 + x x 10 =
|
|
|
- あきひさ しもかさ
- 7 years ago
- Views:
Transcription
1 5 1! (Linear Programming, LP) LP OR LP ( ) ( ) 1.1
2 ( ) ? () 1.1 ( 3 ) j x j 10 j 1 10 j = 1,..., 10 x 1 + x x 10 = 900 [] x 1 120, x 2 120, x [] x 4 80, x 5 80, x 6 80 [] x 7 40, x 8 40, x 9 40, x []
3 x x x x x x x x x x 10 minimize 110x x x x x x x x x x 10 subject to x 1 + x x 10 = 900 x j 120, j = 1, 2, 3 x j 80, j = 4, 5, 6 x j 40, j = 7, 8, 9, 10 (1.1) () ( ) (1.1) (1.1) 1.1 (1.1) y 1 y 2 y 3
4 y 1 x 1 1.2y 1 0.8y 1 x 2 1.2y 1 0.8y 1 x 3 1.2y 1 0.8y 2 x 4 1.2y 2 0.8y 2 x 5 1.2y 2 0.8y 2 x 6 1.2y 2 0.8y 3 x 7 1.2y 3 0.8y 3 x 8 1.2y 3 0.8y 3 x 9 1.2y 3 0.8y 3 x y 3 y 1 = 3y 3 y 2 = 2y 3 minimize 110x x x x x x x 7 +88x x x 10 subject to x 1 + x x 10 = y 1 x 1 1.2y 1 0.8y 1 x 2 1.2y 1 0.8y 1 x 3 1.2y 1 0.8y 2 x 4 1.2y 2 0.8y 2 x 5 1.2y 2 0.8y 2 x 6 1.2y 2 0.8y 3 x 7 1.2y 3 0.8y 3 x 8 1.2y 3 0.8y 3 x 9 1.2y 3 0.8y 3 x y 3 y 1 = 3y 3 y 2 = 2y 3 (1.2) (1.2) (1.1) (1.1) (1.2) 1.2 ( ) x x x 1 1 1
5 (standard form) maximize c 1 x 1 + c 2 x c n x n subject to a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2 (1.3). a m1 x 1 + a m2 x a mn x n = b m x 1 0, x 2 0,..., x n 0 x 1, x 2,..., x n ( ) (decision variable) (b 1,..., b m ) (right hand side) a 11 a 12 a 1n a 21 a 22 a 2n..... a m1 a m2 a mn x 1 0, x 2 0,..., x n 0 (nonnegativity constraint) (x 1,..., x n ) (1.3)) maximize subject to n j=1 c jx j n j=1 a ijx j = b i, x j 0, i = 1,..., m j = 1,..., n (1.4) maximize subject to c x Ax = b x 0 (1.5) x = (x 1,..., x n ) c = (c 1,..., c n ) b = (b 1,..., b m ) A = a 11 a 12 a 1n a 21 a 22 a 2n..... a m1 a m2 a mn
6 10 1 maximize c 1 x 1 + c 2 x c n x n subject to a 11 x 1 + a 12 x a 1n x n b 1 a 21 x 1 + a 22 x a 2n x n b 2 (1.6). a m1 x 1 + a m2 x a mn x n b m x 1 0, x 2 0,..., x n 0 x n+1, x n+2,..., x n+m maximize c 1 x 1 + c 2 x c n x n subject to a 11 x 1 + a 12 x a 1n x n + x n+1 = b 1 a 21 x 1 + a 22 x a 2n x n + x n+2 = b 2. a m1 x 1 + a m2 x a mn x n + x n+m = b m x 1 0,..., x n 0, x n+1 0,..., x n+m 0 (1.7) (1.8) x 1 maximize c 1 x 1 + c 2 x c n x n subject to a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2. a m1 x 1 + a m2 x a mn x n = b m x 2 0,..., x n 0 (1.8) (1.8) x 1 = x + 1 x 1 ( x + 1 0, x 1 0) maximize c 1 x + 1 c 1x 1 + c 2x c n x n subject to a 11 x + 1 a 11x 1 + a 12x a 1n x n = b 1 a 21 x + 1 a 21x 1 + a 22x a 2n x n = b 2. a m1 x + 1 a m1x 1 + a m2x 2 + a mn x n = b m x + 1 0, x 1 0,..., x n 0 (1.9)
7 max 3x 1 + 2x 2-4x 3 s.t. -x 1 + x 3 2 x 1 + 2x 2 + x 3 5 x 1 0; -4 x 2 5; x max x 1 + x 2 + x 3 s.t. 2x 1 - x 2 + 3x 3 + x 4 = 6 -x 1-4x 2 + 2x 3 + x 5 = 5 x 1 ; x 2 ; x 3 ; x 4 ; x (diet problem)? g B1 C (kcal) (g) (g) (g) (g) (g) (g) (mg) (mg) (mg) (100g ) ( ) B1 C 1 (
8 g 0.5mg 50mg j (j = 1,..., 7) x j (100g) x 1,..., x 7 B1 1.9x x x x x x x 7 C 0.08x x x x x x x x x x x x x x x x x x x x x 7 min 136.5x x x x x x x 7 subject to 1.9x x x x x x x x x x x x x x x x x x x x x 7 50 x j 0, j = 1,..., 7 (1.10) (1.10) x 1 = x 2 = 0.0 x 3 = 0.0 x 4 = 0.0 x 5 = 0.0 x 6 = x 7 = Stigler[8] Stigler 77 A B1 B2 C ( 1.4) No one recommends these diets for anyone, let alone everyone. Dantzig (simplex method) Dantzig 500 ([2]) ( ) 1 70(55)g B1 1.1(0.8)mg C 100(100)mg
9 Stigler 535 lb. 107 lb. 13 lb. 134 lb. 25 lb. 500 ( 1890L 3 ) (bran) 2 ( 900g) 4 (blackstrap molasses) 2 ( 900g) Dantzig Fletcher, Soden, Zinober[6] LP Dantzig 3
10 (g) 1( ) (200) ( / ) A B C ( ) [] 1 x 1 2 x 2 1 x 3 2 x 4 x 5 A B C y 1 y 2 y 3 max 45x x x x x 5 s.t. 4.5x x x x x 5 y x x x x x 5 y x x x 5 y 3 0 2y 1 + 4y 2 + 8y x 1, x 2, x 3, x 4, x 5, y 1, y 2, y 3 0
11 [11] 5 100a [] x 1 (a) x 2 (a) x 3 (a) x 4 (a) max 29.8x x x x 4 s.t. x 1 + x 2 + x 3 + x 4 = x x x x x x x x j 0, j = 1,..., A B C ( 15 ) []
12 16 1 A x 1 x 2 x 3 B y 1 y 2 y 3 C z 1 z 2 z 3 A B C u A, u B, u C 6 u A = x x x 3 u B = y y y 3 u C = z z z 3 max u A + u B + u C s.t. u A x x 2 1 u B y y 2 1 u C z z 2 1 x 1 + y 1 + z 1 = 20 x 2 + y 2 + z 2 = 20 x 3 + y 3 + z 3 = 5 x j 0, j = 1, 2, 3 y j 0, j = 1, 2, 3 z j 0, j = 1, 2, x 3 = y 3 = z 3 = 0 (1.11) LP A C () (1.11) x 1 + x 2 + x 3 = 15 y 1 + y 2 + y 3 = 15 z 1 + z 2 + z 3 = A B C numeraire
13 K4 A 8% B 4% C 2% 4 1g g 1 A B C 0.03g 0.02g 0.01g 1.10 ( /g) A B C kg 1.5 A B C D P 1 d 1 P 2 d 2 p c 1 p c 2 p m 1 p m 2 P i (i = 1; 2) A B C D a A i a B i a C i a D i A B C D q A q B q C q D b kg 20kg 30kg 2 20% 10% 10% ( ) 1kg kg kg ( ) kg ( 2 140kg )
14 K kg : 1kg : 1kg : 1kg : 1kg : 1kg : 1kg : 1kg : kg kg 0.3 kg kg 1500kg 3. 1kg 200 1kg 300 ( ) 4. 1kg
15 [ ] w t t (t = 1,..., 5) x t t (t = 2,..., 5) y t t (t = 2,..., 5) z t t (t = 1,..., 5) u t t (t = 1,..., 5) v t t (t = 1,..., 5)
16 20 1 [] min v 1 + v 2 + v 3 + v 4 + v 5 s.t w 1 u w t x t u t 0, t = 2,..., 5 u 1 v 1 5, v 1 12 u 2 v 2 4, v 2 12 u 3 v 3 4, v 3 12 u 4 v 4 3, v 4 5 u 5 v 5 2, v 5 5 w 1 z 1 = 0 w t + 0.9z t 1 10x t z t = 0, t = 2,..., 5 10x t 0.9z t 1 0, t = 2,..., 5 w 5 = 0, z 5 = 0 x 2 y 2 = 0 x t + y t 1 y t = 0, t = 3,..., 5 y w t 0, t = 1,..., 4 x t 0, t = 2,..., 5 y t 0, t = 2,..., 5 z t 0, t = 1,..., 5 u t 0, t = 1,..., 5 v t 0, t = 1,..., 5 (1.12) (u t ) (v t ) (w t ) (x t ) (y t ) (z t ) (1.12) 1.13 [ ] T L t (t = 1,..., T) T t (t = 1,..., T) B j (j = 1,..., n) ( ) c jt B j 1 p j t i t []
17 B j x j t v t min s.t. n j=1 p jx j n j=1 c jtx j + (1 + i t )v t 1 v t = L t, t = 1,..., T v 0 = 0 x j 0, j = 1,..., n v t 0, t = 1,..., T 1.14 Σc x jt j (1+i t )v t-1 v t L t 1.8 [] = 0:8 [ ] + 0:2 [ ] - 0:05 [] max x 1 + x 2 s.t. x 1 + 2x 2 3 x 1 0, x 2 0 (1.13)
18 22 1 x 1 + 2x 2 3 x 1 + 2x 2 0 (1.13) (x 1, x 2 ) (infeasible) (feasible) (feasible solution) (1.13) max x 1 + x 2 s.t. x 1 + 2x 2 3 x 1 0, x 2 0 (1.14) (1.14) (x 1, x 2 ) = (1, 1) (x 1, x 2 ) = (1, 1) = 2 1 t (1 + t, 1) (1 + t) = 1 t 3 (1 + t) + 1 = 2 + t t t 7 (unbounded) ^x d t ^x + td ^x ^x + td (1.14) max x 1 + x 2 s.t. x 1 + 2x 2 3 x 1 0, x 2 0 (1.15) (1.15) (1.14) d = (1, 0) (1.15) (0, 1.5) (infeasible) (feasible) (feasible solution) ( ) ( ) 7
19 LP (c 1, c 2 ) max c 1 x 1 + c 2 x 2 s. t. x 1 + x 2 6 2x 1 + x 2 10 x 2 3 x 1, x 2 0 (1.16) (1.16) ( x 1 x 2 ) S S x 1 x S x 2 A (0,3) E (3,3) (3.5,3) S B (4,2) C O D 0 (5,0) (6,0) F x 1 (c 1, c 2 ) ( )
20 S (1) x 2 (C1,C2) 0 x S (2) x 2 0 x 1 (C1,C2)
21 ( (1.17)) 1.19 max c 1 x 1 + c 2 x 2 s. t. x 1 + x 2 6 2x 1 + x 2 10 x 2 3 x 1, x 2 0 (1.17) 1.19 x 2 (C1,C2) 0 x max x 1 - x 2 s. t. 2x 1-3x 2-3 x 1 - x x 1 ; x 2 0 [] x 1 -x 2 x 1 - x 2 = 3-3 (3; 3)
22 (1.16) (c 1, c 2 ) = (3, 2) (1.18) max 3x 1 + 2x 2 s. t. x 1 + x 2 + x 3 = 6 2x 1 + x 2 + x 4 = 10 (1.18) x 2 + x 5 = 3 x 1, x 2, x 3, x 4, x x 1 + x 2 +x 3 = 6 2x 1 + x 2 +x 4 = 10 x 2 +x 5 = 3 (1.19) (1.19) 5 3 x 2 x 4 (1.19) 1 x 1 = x 2 x x 1 +x 2 +x 3 = 6 x 2 2x 3 +x 4 = 2 x 2 +x 5 = 3 (1.20) (1.20) 2 x 3 = 0.5x x x x x 4 = 5 x 2 2x 3 +x 4 = 2 x 2 +x 5 = 3 (1.21) (1.18) z = 3x 1 + 2x 2 (1.21) 1 x 1 z = 3 (5 0.5x 2 0.5x 4 ) + 2x 2 = x 2 1.5x 4 (1.22) x 2 x 4 (1.21) (1.22) x 2, x 4 z = x 2 1.5x 4 x 1 = 5 0.5x 2 0.5x 4 x 3 = 1 0.5x x 4 x 5 = 3 x 2 (1.23)
23 (1.18) z z = 3x 1 + 2x 2 x 1 + x 2 + x 3 = 6 2x 1 + x 2 + x 4 = 10 (1.24) x 2 + x 5 = 3 (1.23) (1.24) 1.10 (1.24) (x 1 ; x 2 ; : : : ; x 5 ) (1.23) (1.23) (x 1 ; x 2 ; : : : ; x 5 ) (1.24) (1.23) z, x 1, x 3, x 5 x 2 x 4 x 2 x 4 z, x 1, x 3, x 5 8 x 1, x 3, x 5 (basic variable) x 2, x 4 (nonbasic variable) 0 (1.23) x 2 = x 4 = 0 x 1 = 5, x 3 = 1, x 5 = 3, z = 15 (1.24) (1.24) x 2 = x 4 = 0 x 1 + x 3 = 6 2x 1 + x 4 = 10 x 5 = 3 x 1 = 5, x 3 = 1, x 5 = 3 z = 3x 1 + 2x 2 z = 15 0 (basic solution) (feasible basic solution) (1.23) x 1 = 5, x 2 = 0, x 3 = 1, x 4 = 0, x 5 = 3 ( ) x 1 x 2 (x 1, x 2 ) = (5, 0) 1.16 D 8 (dictionary)
24 28 1 x 3 x 4 z = 16 x 3 x 4 x 1 = 4 +x 3 x 4 x 2 = 2 2x 3 +x 4 x 5 = 1 +2x 3 x 4 (1.25) x 1 = 4, x 2 = 2, x 3 = 0, x 4 = 0, x 5 = 1 x 1 -x 2 (x 1, x 2 ) = (4, 2) C 1.11 x 1 ; : : : ; x [ ] S D C z = x 2 1.5x 4 x 1 = 5 0.5x 2 0.5x 4 x 3 = 1 0.5x x 4 x 5 = 3 x 2 (1.23) z = 16 x 3 x 4 x 1 = 4 +x 3 x 4 x 2 = 2 2x 3 +x 4 x 5 = 1 +2x 3 x 4 (1.25) (1.23) ( ) x 2, x 4 0 (1.23) z = x 2 1.5x 4 x x 2 0 x 4 0 x 2 0 t z = t x 1 = 5 0.5t x 3 = 1 0.5t x 5 = 3 t (1.26)
25 t z = t t t x 1, x 3, x 5 t t = 2 x 3 = 0 (1.23) 3 x 3 = 1 0.5x x 4 (1.25) (1.23) x 2 (1.25) (1.23) x 3 (1.25) (1.25) (1.23) x 4 ( ) 0? 1.16? (1.23) (1.25) (1.25) z = 16 x 3 x 4 x 3 x 4 0 (1.25) (1.25) (^x 1,..., ^x 5 ) (1.18) (1.25) z = 3^x 1 + 2^x 2 = 16 ^x 3 ^x 4 9 ^x 3 0, ^x 4 0 z = 3^x 1 + 2^x (5; 0; 1; 0; 3) (0; 0; 6; 10; 3) (3; 3; 0; 1; 0)
26 30 1 (simplex method) max 3x 1 + 2x 2 s. t. x 1 + x 2 6 2x 1 + x 2 10 x 2 3 x 1, x 2 0 (1.27) (1.16) z = 16 x 3 x 4 x 1 = 4 +x 3 x 4 x 2 = 2 2x 3 +x 4 x 5 = 1 +2x 3 x 4 (1.25)
27 (1.25) z = 16 x 3 x 4 z = 3x 1 + 2x 2 z = 3x 1 + 2x 2 = 3(4 + x 3 x 4 ) + 2(2 2x 3 + x 4 ) z = 3x x 2 = 3(4 + x 3 x 4 ) + 2.5(2 2x 3 + x 4 ) = 17 2x 3 0.5x ? z = 20 5x 3 +x 4 x 1 = 4 +x 3 x 4 x 2 = 2 2x 3 +x 4 x 5 = 1 +2x 3 x 4 (1.28) x 4 x 4 0 x 1, x 2, x 4 z = 21 3x 3 x 5 x 1 = 3 x 3 +x 5 x 2 = 3 x 5 x 4 = 1 +2x 3 x 5 f (1.29)
28 32 1 y 1 y 2 y 3 6y y 2 + 3y y 1 + y 2 + y 3 2 y 1 + y 2 + y 3 2 y 1 + 2y 2 3 min 6y y 2 + 3y 3 s. t. y 1 + 2y 2 3 y 1 + y 2 + y 3 2 y 1, y 2, y 3 0 (1.30) y 1 = 1 y 2 = 1 y 3 = 0 ( ) 16 (1.30) (shadow price) (1.30) (1.27) (1.30) (1.31) maximize c 1 x 1 + c 2 x c n x n subject to a 11 x 1 + a 12 x a 1n x n b 1 a 21 x 1 + a 22 x a 2n x n b 2. a m1 x 1 + a m2 x a mn x n b m x j 0, j = 1,..., n (1.31) (1.32) (1.31) (dual problem) minimize b 1 y 1 + b 2 y b m y m subject to a 11 y 1 + a 21 y a m1 y m c 1 a 12 y 1 + a 22 y a m2 y m c 2. a 1n y 1 + a 2n y a mn y m c n y i 0, i = 1,..., m (1.32)
( ) () () ( ) () () () ()
5 1! (Linear Programming, LP) LP OR LP 1.1 1.1.1 1. 2. 3. 4. 4 5. 1000 4 1.1? 1.2 1 1 http://allrecipes.com/ 6 1 1.1 ( ) () 1 0.5 1 0.75 200 () 1.5 1 0.5 1 50 ( ) 2 2 1 30 () 2.25 0.5 2 2.25 30 () 2 100
2 1/2 1/4 x 1 x 2 x 1, x 2 9 3x 1 + 2x 2 9 (1.1) 1/3 RDA 1 15 x /4 RDA 1 6 x /6 1 x 1 3 x 2 15 x (1.2) (1.3) (1.4) 1 2 (1.5) x 1
1 1 [1] 1.1 1.1. TS 9 1/3 RDA 1/4 RDA 1 1/2 1/4 50 65 3 2 1/15 RDA 2/15 RDA 1/6 RDA 1 1/6 1 1960 2 1/2 1/4 x 1 x 2 x 1, x 2 9 3x 1 + 2x 2 9 (1.1) 1/3 RDA 1 15 x 1 + 2 1/4 RDA 1 6 x 1 1 4 1 1/6 1 x 1 3
106 4 4.1 1 25.1 25.4 20.4 17.9 21.2 23.1 26.2 1 24 12 14 18 36 42 24 10 5 15 120 30 15 20 10 25 35 20 18 30 12 4.1 7 min. z = 602.5x 1 + 305.0x 2 + 2
105 4 0 1? 1 LP 0 1 4.1 4.1.1 (intger programming problem) 1 0.5 x 1 = 447.7 448 / / 2 1.1.2 1. 2. 1000 3. 40 4. 20 106 4 4.1 1 25.1 25.4 20.4 17.9 21.2 23.1 26.2 1 24 12 14 18 36 42 24 10 5 15 120 30
最適化手法 第1回 [3mm] 整数計画法 (1) [3mm]
![最適化手法 第1回 [3mm] 整数計画法 (1) [3mm]](/thumbs/93/112182844.jpg "最適化手法 第1回 [3mm] 整数計画法 (1) [3mm]")
1 (1) & 2014 4 9 ( ) (1) 2014 4 9 1 / 39 2013 ( ) (1) 2014 4 9 2 / 39 OR 1 OR 2 OR Excel ( ) (1) 2014 4 9 3 / 39 1 (4 9 ) 2 (4 16 ) 3 (4 23 ) 4 (4 30 ) 5 (5 7 ) 6 (5 14 ) 7 1 (5 21 ) ( ) (1) 2014 4 9 4
f(x) x S (optimal solution) f(x ) (optimal value) f(x) (1) 3 GLPK glpsol -m -d -m glpsol -h -m -d -o -y --simplex ( ) --interior --min --max --check -
GLPK by GLPK http://mukun mmg.at.infoseek.co.jp/mmg/glpk/ 17 7 5 : update 1 GLPK GNU Linear Programming Kit GNU LP/MIP ILOG AMPL(A Mathematical Programming Language) 1. 2. 3. 2 (optimization problem) X
. p.1/34
. p.1/34 (Optimization) (Mathematical Programming),,. p.2/34 1 1.1 1.2 1.3 2 2.1 2.2 2.3 2.4 2.5 3 4 5. p.3/34 1 1.1 1.2 1.3 2 2.1 2.2 2.3 2.4 2.5 3 4 5. p.4/34 4x + 2y 6, 2x + y 6, x 0, y 0 x, yx + yx,
nakata/nakata.html p.1/20
http://www.me.titech.ac.jp/ nakata/nakata.html p.1/20 1-(a). Faybusovich(1997) Linear systems in Jordan algebras and primal-dual interior-point algorithms,, Euclid Jordan p.2/20 Euclid Jordan V Euclid
*2015カタログ_ブック.indb
-319 -320 -321 -322-40 1600-20 0 20 40 60 80 100 1600 1000 600 400 200 100 60 40 20 VG 22 VG 32 VG 46 VG 68 VG 100 36 16 ν opt. 10 5 5-40 -25-10 0 10 30 50 70 90 115 t min = -40 C t max = +115 C 0.5 0.4
数理計画法入門 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 初版 1 刷発行時のものです.
数理計画法入門 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/092181 このサンプルページの内容は, 初版 1 刷発行時のものです. i 1947 G.B. Dantzig 3 (1) (2) (3) (4) Microsoft Excel Web 4 1 2 2 2 2 3 ii 4
OR 2 Excel 2 3.. 4. OK. 1a: Excel2007 Office. Excel2003 1.. 1b. 2.. 3. OK. 2.,,. ツール アドイン 1b: Excel2003 :,.,.,.,,,.,,. 1. Excel2003.
OR 2 Excel 1 2 2.1 Excel.,. 2.2, x mathematical programming optimization problem, OR 1., 1 : f(x) h i (x) = 0, i = 1,..., m, g j (x) 0, j = 1,..., l, f(x) h i (x) = 0, i = 1,..., m, g j (x) 0, j = 1,...,
untitled
,, 2 2.,, A, PC/AT, MB, 5GB,,,, ( ) MB, GB 2,5,, 8MB, A, MB, GB 2 A,,,? x MB, y GB, A (), x + 2y () 4 (,, ) (hanba@eee.u-ryukyu.ac.jp), A, x + 2y() x y, A, MB ( ) 8 MB ( ) 5GB ( ) ( ), x x x 8 (2) y y
Microsoft Word - .....J.^...O.|Word.i10...j.doc
P 1. 2. R H C H, etc. R' n R' R C R'' R R H R R' R C C R R C R' R C R' R C C R 1-1 1-2 3. 1-3 1-4 4. 5. 1-5 5. 1-6 6. 10 1-7 7. 1-8 8. 2-1 2-2 2-3 9. 2-4 2-5 2-6 2-7 10. 2-8 10. 2-9 10. 2-10 10. 11. C
…p…^†[…fiflF”¯ Pattern Recognition
Pattern Recognition Shin ichi Satoh National Institute of Informatics June 11, 2019 (Support Vector Machines) (Support Vector Machines: SVM) SVM Vladimir N. Vapnik and Alexey Ya. Chervonenkis 1963 SVM
Microsoft Word - 表紙資料２－４
(1) / 130 g 25 g 520% 170 g 30 g 560% 70 mg 600 mg 11.6% 0 10.5 mg 0% (1) (2) / 50100 g 25 g 200400% 50100 g 30 g 167333% 5001000 mg 600 mg 83167% 1020 mg 10.5 mg 95190% (2) / (1) 45.6 g 30 g 152% (2)
橡matufw
3 10 25 3 18 42 1 2 6 2001 8 22 3 03 36 3 4 A 2002 2001 1 1 2014 28 26 5 9 1990 2000 2000 12 2000 12 12 12 1999 88 5 2014 60 57 1996 30 25 205 0 4 120 1,5 A 1995 3 1990 30 6 2000 2004 2000 6 7 2001 5 2002
O
11 2 1 2 1 1 2 1 80 2 160 3 4 17 257 1 2 1 2 3 3 1 2 138 1 1 170 O 3 5 1 5 6 139 1 A 5 2.5 A 1 A 1 1 3 20 5 A 81 87 67 A 140 11 12 2 1 1 1 12 22 1 10 1 13 A 2 3 2 6 1 B 2 B B B 1 2 B 100 B 10 B 3 3 B 1
16 41 17 22 12 10
1914 11 1897 99 16 41 17 22 12 10 11 10 18 11 2618 12 22 28 15 1912 13 191516 2,930 1914 5,100 43 1.25 11 14 25 34364511 7.54 191420 434849 72 191536 1739 17 1918 1915 60 1913 70 10 10 10 99.5 1898 19034.17.6
製品案内 価格表 2014/4/1
4 (17) 3 43 5/20370/ 231(504,150) 11 12 10 14-16 10 3 100 17 100kg 5-6 3 13 3 18 18 # # # # #$$ %&$ ' ()* +,-% ' #). +,-%'% / ' # # #$ %&&&'( %)* +'(#$ #$ %&&&'( ++,-). +'(#$ #$ /'( + /0)- +'(#$ %&&&'(
３．ごみの減量方法.PDF
- 7 - - 8 - - 9 - - 10 - - 11 - - 12 - ( 100 ( 100 - 13-123,550,846 111,195,762 92,663,135 ( 12 25 37 49.2 16 33 49 65.6 15 30 44 59.0 2.5kg) ( 5kg) ( 7.5kg) ( k ( 123,550,846 111,195,762 92,663,135 (
s t 1, 2,..., 10 s t a, b,..., k t s 1, 2,..., 10 1 a, b,..., k 1 s t ts 1 0 ( 2.25) ½ ¾ ½¼ x 1j = 1 x 2c = 1 x 3e = 1
72 2 2 2 2.24 2 s t, 2,..., 0 s t a, b,..., k t s, 2,..., 0 a, b,..., k s t 0 ts 0 ( 2.25) 2.24 2 ½ ¾ ½¼ x j = x 2c = x 3e = x 4s = x 5g = x 6i = x 7d = x 8h = x 9f = x 0k = x ta = x tb = x ts = 9 2.26
232528 152810 232513 -1- -2- -3- -4- -5- -6- -7- -8- -9- -10- -11- -12- -13- -14- -15- -16- -17- -18- -19- -20- -21- -22- -23- -24- -25- -26- -27- -28- -29- -30- -31- -32- -33- -34- -35- -36- -37- -38-
225 225 232528 152810 225 232513 -1- -2- -3- -4- -5- -6- -7- -8- -9- -10- -11- -12- -13- -14- -15- -16- -17- -18- -19- -20- -21- -22- -23- -24- -25- -26- -27- -28- -29- -30- -31- -32- -33- -34- -35- -36-
31 gh gw
30 31 gh gw 32 33 1406 1421 640 0 (mm) (mm) MAX1513 MIN349 MIN280 MAX900 gh gw 34 gh gh gw gw gh gh gw gw gh gh gw gw 35 175 176 177 178 179 180 181 195 196 197 198 202 203 2 1 L L L2 L2 L2 L 2 2 1 L L
152273335 1 123 11531 2 5 24 31 2 154301482 1551 JAS 100 2000 105 1101 1 2JAS 1-2 1
152273335 1 123 11531 2 5 24 31 2 154301482 1551 JAS 100 2000 105 1101 1 2JAS 1-2 1 JAS 1-2 1-2 112 13 1-11-13 100870mg 100830mg11000 1100020.002 2 50 100 2 100 500 2 100 109252165 4514782 7 2.0kg 2-19220.05kg0.2kg
untitled
186 17 100160250 1 10.1 55 2 18.5 6.9 100 38 17 3.2 17 8.4 45 3.9 53 1.6 22 7.3 100 2.3 31 3.4 47 OR OR 3 1.20.76 63.4 2.16 4 38,937101,118 17 17 17 5 1,765 1,424 854 794 108 839 628 173 389 339 57 6 18613
untitled
1. 3 14 2. 1 12 9 7.1 3. 5 10 17 8 5500 4. 6 11 5. 1 12 101977 1 21 45.31982.9.4 79.71996 / 1997 89.21983 41.01902 6. 7 5 10 2004 30 16.8 37.5 3.3 2004 10.0 7.5 37.0 2004 8. 2 7 9. 6 11 46 37 25 55 10.
Solution Report
CGE 3 GAMS * Date: 2018/07/24, Version 1.1 1 2 2 GAMSIDE 3 2.1 GAMS................................. 3 2.2 GAMSIDE................................ 3 2.3 GAMSIDE............................. 7 3 GAMS 11
untitled
Life Cycle Assessment (1998719993) (1998419991) (199913) 14 29 29 30 30 34 37 44 60 61 62 62 67 70 82 84 85 86 () ()() 1 PET 2.1.1 2.1-1 PTA 1997 72.6%2.6 97 4 2.1.2 2.1-2 1997 79.6% 2.3 2 2.1.3 PET 2.1-3
3 65 1 4 5 67 1 2 5 5 3 6 68 23 69 2 6 8m 10m 1. 2. 3. 70 66 600km 11 3 16 21 3 0 3m 2m 0 5m 71 11 3 17 0 5 0 0 72 73 74 75 3 76 77 4 78 79 5 80 81 82 83 2 83 . 84 6 a b c d e f g a b c 3 85 16 86 87 7
../dvi98/me98enve.dvi
Chapter 5 1 2 CHAPTER 5. 5.1 8 (x ) 2 +(y + ) 2 1=j 2 R9 x + y = x + y = p 2 x + y = p 2 ff(x; y; ) =j 2 Rg ( f(x; y; ) = @ @ f(x; y; ) = (5:1) f 3 (x; y) = f 3 (x; y) ==)9 : f(x; y; ) = @f @x @f @y 1
離散最適化基礎論 第 11回 組合せ最適化と半正定値計画法
11 okamotoy@uec.ac.jp 2019 1 25 2019 1 25 10:59 ( ) (11) 2019 1 25 1 / 38 1 (10/5) 2 (1) (10/12) 3 (2) (10/19) 4 (3) (10/26) (11/2) 5 (1) (11/9) 6 (11/16) 7 (11/23) (11/30) (12/7) ( ) (11) 2019 1 25 2
1 8 7 30 8 15 12 11 30 12 15 18 18 00 18 30 10 15 19 30 9 45 13 45 11 30 18 9 15 30 30 1 1 2
7 19 20 30 1 1 8 7 30 8 15 12 11 30 12 15 18 18 00 18 30 10 15 19 30 9 45 13 45 11 30 18 9 15 30 30 1 1 2 3 10 11 12 13 4 6 6 14 15 16 17 18 5 1 1 6 2 7 () 8 9 10 - 1 - - 2 - - 3 - - 4 - - 5 - - 6 - -
4. 5.
1. 2. 20 3. 4. 5. ) N ) 6. ) 7. 8. JA 1. 30 CO2 18 2. 20 3. 4. 5. 5.1 cm 5.2 5.2.1 1 17kg 119kg11 5.2.2 60 750 2 2 5.2.3 30m 5.2.4 3 200g 6. 1 500 200 3 2 16 600 21 /10067kg/198kg10037 2025 3 4 3 3 6 102
1 2 3 4 5 68g 9g 2g 0.2mg 0.8mg 316kcal 316cal 326kcal 326cal 6 010 3035 15 5355 30 120 20 7 8 9 10 11 () () () 12 1 3 1 5 1 80kcal 20 30 20 30 1 9 7.5 13 7.58.5 910.5 1213.5 11.512.5 14 15 79 23 1520
.N...[..7...doc
1 2 3 STEP1 4 STEP2 STEP3 5 6 7 8 9 1 Solution of Solution of Solution of Solution of Solution of Solution of Solution of Solution of Solution of Solution of Solution of Solution of Solution of Solution
untitled
~ ~ ~ ~ ~ 22 14 10 50cm 2124 15 21 29.5 11, 12 12 20 4040 10 60 60 10 20 20 11 ç ç çç 6070 ç ç çç p. ç çç 4.5cm2.5cm 25 http://www.crdc.gifu-u.ac.jp/edsoftol/water/
3 3.2 4.9 0.5 1 0.25 1.7 0.75 1.8 2.9 2.5 SW2 SW1 SW2 SW1 1.4 1.4 For reflow soldering 1.5 3.4 1.5 0.7 1.1 1.1 0.35 0.55 3.5 0.55 (0.35) 3.2 2.4 3.7 2.1 3.3 For reflow soldering 1.0 1.1 (D) 0.7 2.7 0.7
n 2 n (Dynamic Programming : DP) (Genetic Algorithm : GA) 2 i
15 Comparison and Evaluation of Dynamic Programming and Genetic Algorithm for a Knapsack Problem 1040277 2004 2 25 n 2 n (Dynamic Programming : DP) (Genetic Algorithm : GA) 2 i Abstract Comparison and
数値計算：有限要素法
( ) 1 / 61 1 2 3 4 ( ) 2 / 61 ( ) 3 / 61 P(0) P(x) u(x) P(L) f P(0) P(x) P(L) ( ) 4 / 61 L P(x) E(x) A(x) x P(x) P(x) u(x) P(x) u(x) (0 x L) ( ) 5 / 61 u(x) 0 L x ( ) 6 / 61 P(0) P(L) f d dx ( EA du dx
cable_nyuko_070605.indd
Solution Now Solution Now 01 Solution Now 02 Solution Now 03 Solution Now 04 Solution Now Solution Now 01 Solution Now 02 Solution Now 03 Solution Now 04 Solution Now Solution
-1-19 753-0214 TEL 083-927-7031083-927-7029 FAX 083-927-0214 e-mail a17201@pref.yamaguchi.lg.jp - 2 - -3-. 20kg 60% 2kg 2 3 -4-30 3 15 3-0.05 0.4 NaOH 0.5 20 -5-. 1 1,757g 69% 30 -6- -7- -8- C C H17 18
薬局におけるインシデント事例の集計･分析結果
13 11 14 31 13 11 14 31 13 11 14 31 10 13 13 e-mail 18 4,000 13 14 H13.4.1 11.17 11.18 H14.3.31 13 14 31-1- 600 400 (18.4 17.7 17.0 16.0 15.2 8.2 1.0 2 11 10 12 15 3 1015203040 69.5 7.8 22.7 4 (42.5) 34.3
香南市・香美市のニラ
ROTTLER Chinese chives Alliaceae Allium 133 33 33 33 133 41 36 12 1 ha2 3 JA 4 1 H17 23 2010 4 JA 22 40,000~50,000 10a 4 100 5 120 6~8 120~150 20,000~30,000 10a 810 30 911 47 40 123 50 10a kg 4,000kg
朕醩佑宖醸æ−žã†®ã†�ã‡†ã†®æ··å’‹æŁ´æŁ°è¨‹çfl»ã…¢ã…⁄ã…«
1 / 34 Li-Yao,, Li-Yao The Life-Cycle Effects of House Price Changes (Li-Yao ),,,, ( ) 1 ω ( ) ω 1 γ Ct Ht t T βt U(C t, H t, N t) = N t N t t T βt N t 1 γ H t : t C t : t β : ω : γ : W. Li, R. Yao, The
n 2 + π2 6 x [10 n x] x = lim n 10 n n 10 k x 1.1. a 1, a 2,, a n, (a n ) n=1 {a n } n=1 1.2 ( ). {a n } n=1 Q ε > 0 N N m, n N a m
![n 2 + π2 6 x [10 n x] x = lim n 10 n n 10 k x 1.1. a 1, a 2,, a n, (a n ) n=1 {a n } n=1 1.2 ( ). {a n } n=1 Q ε > 0 N N m, n N a m](/thumbs/94/118912662.jpg "n 2 + π2 6 x [10 n x] x = lim n 10 n n 10 k x 1.1. a 1, a 2,, a n, (a n ) n=1 {a n } n=1 1.2 ( ). {a n } n=1 Q ε > 0 N N m, n N a m")
1 1 1 + 1 4 + + 1 n 2 + π2 6 x [10 n x] x = lim n 10 n n 10 k x 1.1. a 1, a 2,, a n, (a n ) n=1 {a n } n=1 1.2 ( ). {a n } n=1 Q ε > 0 N N m, n N a m a n < ε 1 1. ε = 10 1 N m, n N a m a n < ε = 10 1 N
0 (1 ) 0 (1 ) 01 Excel Excel ( ) = Excel Excel =5+ 5 + 7 =5-5 3 =5* 5 10 =5/ 5 5 =5^ 5 5 ( ), 0, Excel, Excel 13E+05 13 10 5 13000 13E-05 13 10 5 0000
1 ( S/E) 006 7 30 0 (1 ) 01 Excel 0 7 3 1 (-4 ) 5 11 5 1 6 13 7 (5-7 ) 9 1 1 9 11 3 Simplex 1 4 (shadow price) 14 5 (reduced cost) 14 3 (8-10 ) 17 31 17 3 18 33 19 34 35 36 Excel 3 4 (11-13 ) 5 41 5 4
) km 200 m ) ) ) ) ) ) ) kg kg ) 017 x y x 2 y 5x 5 y )
001 ) g 20 g 5 300 g 7 002 720 g 2 ) g 003 0.8 m 2 ) cm 2 004 12 15 1 3 1 ) 005 5 0.8 0.4 ) 6 006 5 2 3 66 ) 007 1 700 12 ) 008 0.315 ) 009 500 g ) kg 0.2 t 189 kg 17.1 kg 010 5 1 2 cm 3 cm )km 2-1 - 011
SW1500_UMJ
2 1 2 3 4 5 6 9 10 SW1500 分 解 電 源 プラグ を 抜 く 100V 1 30 8 48 48 46 2 1 3 ABS MAX MAX MIN 5OFF AS 1 80mm65mm ON/OFF SW1500 AC100V 1.2m 5060Hz 40W 43KHz PZ2 SUS303t0.8mm 570cc 230cc 113mm217mm120mm 56mm182mm86mm
23_33.indd
23 2TB 1TB 6TB 3TB 2TB 3TB 3TB 2TB 2TB 1TB 1TB 500GB 4TB 1TB 1TB 500GB 2TB 2TB 1TB 1TB RT RT RT RT RT RT RT MAC 10. 10. 10.6 10.5 MAC 10. 10. 10.6 10.5 MAC 10. 10.6 10.5 MAC 10. 10. 10.6 10.5 MAC 10. 10.6
50. (km) A B C C 7 B A 0
49... 5 A B C. (. )?.. A A B C. A 4 0 50. (km) A B C..9 7. 4.5.9. 5. 7.5.0 4..4 7. 5.5 5.0 4. 4.. 8. 7 8.8 9.8. 8 5. 5.7.7 9.4 4. 4.7 0 4. 7. 8.0 4.. 5.8.4.8 8.5. 8 9 5 C 7 B 5 8 7 4 4 A 0 0 0 4 5 7 8
◎【教】⑯梅津正美先生【本文】／【教】⑯梅津正美先生【本文】
A A A pp H boshu/h17/1-sya.pdf C.http : //www.pref.mie.jp/kokokyo/ pp pp JA p pp pp pp pppppp pp C pp pp pp NOpp pp pp p p p A Method of Test Constitution in Social Studies Education : To Evaluate Scholastic
8 OR (a) A A 3 1 B 7 B (game theory) (a) (b) 8.1: 8.1(a) (b) strategic form game extensive form game 1
8 OR 8.1 8.1.1 8.1(a) A A 3 1 B 7 B (game theory) (a) (b) 8.1: 8.1(a) (b) strategic form game extensive form game 1 2 [5] player 2 1 noncooperative game 2 cooperative game8.4 8.1.2 2 8.1.1 ( ). A B A B
OR#5.key
オペレーションズ リサーチ１ Operations Research 前学期 月曜 ３限(3:00-4:30) 8 整数計画モデル Integer Programming 経営Ａ棟１０６教室 山本芳嗣 筑波大学 大学院 システム情報工学研究科 整数計画問題 2 凸包 最小の凸集合 線形計画問題 変数の整数条件 ctx Ax b x 0 xj は整数 IP LP 3 4 Bx d!!!!!? P NP
転がり軸受 総合カタログ
K 4 21 AU L TDO TD 10500 mm 1 10220 mm 10130 mm 19 mm 19 mm 1075 mm 4 5 1 ZZ 2RU 2RS 2RK 2RD JIS 1512 ML JIS 1514-1 A60 A63 7-3 JIS 1520 A102 10-2 A102 10-3 A105 10-7 ZZ 2RU (a) 1) (b) (c) (d) 2) (e) (f)
例題で学ぶオペレーションズ リサーチ入門 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. このサンプルページの内容は, 初版 1 刷発行時のものです.
例題で学ぶオペレーションズ リサーチ入門 サンプルページ この本の定価 判型などは, 以下の URL からご覧いただけます. http://www.morikita.co.jp/books/mid/009641 このサンプルページの内容は, 初版 1 刷発行時のものです. i OR OR OR OR OR OR OR OR OR 2015 5 ii 1 OR 1 1.1 OR... 1 1.2 OR...
第3章 非線形計画法の基礎
3 February 25, 2009 1 Armijo Wolfe Newton 2 Newton Lagrange Newton 2 SQP 2 1 2.1 ( ) S R n (n N) f (x) : R n x f R x S f (x ) = min x S R n f (x) (nonlinear programming) x 0 S k = 0, 1, 2, h k R n ɛ k
(1.2) T D = 0 T = D = 30 kn 1.2 (1.4) 2F W = 0 F = W/2 = 300 kn/2 = 150 kn 1.3 (1.9) R = W 1 + W 2 = = 1100 N. (1.9) W 2 b W 1 a = 0
1 1 1.1 1.) T D = T = D = kn 1. 1.4) F W = F = W/ = kn/ = 15 kn 1. 1.9) R = W 1 + W = 6 + 5 = 11 N. 1.9) W b W 1 a = a = W /W 1 )b = 5/6) = 5 cm 1.4 AB AC P 1, P x, y x, y y x 1.4.) P sin 6 + P 1 sin 45
( ) a C n ( R n ) R a R C n. a C n (or R n ) a 0 2. α C( R ) a C n αa = α a 3. a, b C n a + b a + b ( ) p 8..2 (p ) a = [a a n ] T C n p n a
![( ) a C n ( R n ) R a R C n. a C n (or R n ) a 0 2. α C( R ) a C n αa = α a 3. a, b C n a + b a + b ( ) p 8..2 (p ) a = [a a n ] T C n p n a](/thumbs/91/106692724.jpg "( ) a C n ( R n ) R a R C n. a C n (or R n ) a 0 2. α C( R ) a C n αa = α a 3. a, b C n a + b a + b ( ) p 8..2 (p ) a = [a a n ] T C n p n a")
9 8 m n mn N.J.Nigham, Accuracy and Stability of Numerical Algorithms 2nd ed., (SIAM) x x = x2 + y 2 = x + y = max( x, y ) x y x () (norm) (condition number) 8. R C a, b C a b 0 a, b a = a 0 0 0 n C n
> > <., vs. > x 2 x y = ax 2 + bx + c y = 0 2 ax 2 + bx + c = 0 y = 0 x ( x ) y = ax 2 + bx + c D = b 2 4ac (1) D > 0 x (2) D = 0 x (3
13 2 13.0 2 ( ) ( ) 2 13.1 ( ) ax 2 + bx + c > 0 ( a, b, c ) ( ) 275 > > 2 2 13.3 x 2 x y = ax 2 + bx + c y = 0 2 ax 2 + bx + c = 0 y = 0 x ( x ) y = ax 2 + bx + c D = b 2 4ac (1) D >
6 12 10661 93100 227213202 222208197 85kg cm 20 64.521 106856142 2 1 4 3 9767 100 35 cm 7747 208198 90kg 23 5828 10661 93100 cm 227213202 10639 61 64.521 85kg 78kg 70kg 61 100 197204.5 cm 15 61
10 44 1.2 5 4 5 3 6-1 - 1 2 3 4 5 1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8 9 10 TEL TEL 1 2 TEL FAX TEL FAX TEL FAX 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 1 2 3 4 5 6 ( ) ( ) 2
<82D282A982C1746F95F18D908F57967B95B E696E6464>
1 2 (90cm 70cm 2015) 3 (68cm 28cm 30cm 12kg 2015) (77.5 109.5cm 2015) 4 (22cm 50cm 50cm 4.6kg 2015) (45cm 62.5cm 2015) (47.4cm 62.5cm 2014) 5 (28.5cm 23.5cm) (45cm 62cm 2015) (97cm 107cm 2015) 6 7 8 9
80024622 1996 Science for Open and Environmental Systems 80024622 KIKUCHI, Atsushi Optimal Asset Allocation with Real Estate The institutional investors such as life insurance companies, trust banks, and
% %
4 8 4 5 414.5 172.1 41.5% 39.8 10% 17 186.4 70.8 4 9 10 11 3 1-1 - 2-2 - - 3 - 10% - 4 - 4060% 5560% 60% 40% 3040 1520 1015 411 7 4 11 610 7080 5060 100 3040 13-5 - 1015 4045 3.04.0 5.06.0 1.52.0 1.01.5
MY16_R8_DI_ indd
R8 Audi R8 Coupé Data Information Audi R8 Specifications mm 4,426 1,940 1,240 4,426 1,940 1,240 mm 2,650 2,650 : mm 1,638 1,638 : mm 1,599 1,599 kg 1,670 1,630 4WD 4WD cc 5,204 5,204 V 10 DOHC V 10 DOHC
2004 10 2004 1984 2 1986 4 20 60 1 3 1 1 1 13,300 2 2 2 3 1 2004 2009 2 1 1 2 1 1985 97JR JT NTT 2002 96 97 4 JR JT 97 3 JR 19 29 JT 2.4 2.5 JR JT NTT JR JT NTT 2 97 4 JR 20.09 JT 19.92 NTT 17.35 17.35
180 140 22
21 180 140 22 23 25 50 1 3 350 140 500cm 600 140 24 25 26 27 28 29 30 31 1/12 8.3 1/15 6.7 10 1/8 12.5 1/20 140 90 75 150 60 150 10 30 15 35 2,000 30 32 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 % 100 50 33.3
or57_4_175.dvi
c Excel Excel Excel Excel Microsoft Excel 1. OR Microsoft Excel Excel 1 Excel Excel Excel or 2007 Excel OR Excel Excel LP Excel LP Excel 112 8551 1 13 27 1 Excel Excel Excel 2010 Excel OpenOffice Calc