File tree Expand file tree Collapse file tree
Expand file tree Collapse file tree Original file line number Diff line number Diff line change 3737\end {cases}
3838$$
3939Zapišimo celoštevilski linearni program.
40- \begin {alignat* }{2}
41- \max \ (213x_1 + 208x_2 + 203x_3 + 192x_4 + 196x_5 + 197x_6 +
42- 200x_7 + 195x_8 && \text {p.p.} \\
40+ \begin {multline* }
41+ \begin {alignedat }{3}
42+ \max \quad 213x_1 &+ 208x_2 &&+ 203x_3 &&+ 192x_4 \\
43+ + 196x_5 &+ 197x_6 &&+ 200x_7 &&+ 195x_8
44+ \quad \text {p.p.}
45+ \end {alignedat } \\
46+ \begin {alignedat }{2}
4347\forall i \in \{ 1, \dots , 8\} : &\ &
44- 0 \le x_i &\le 1, \quad x_i \in \Z \\
45- \opis {V postavi so zastopane vse pozicije}
46- x_1 + x_2 > 0 \\
47- x_3 + x_4 + x_5 > 0 \\
48- x_6 + x_7 + x_8 > 0
48+ 0 \le x_i &\le 1, \quad x_i \in \Z
49+ \opis {V postavi je pet članov}
50+ && \sum _{i=1}^8 x_i &= 5
51+ \opis {V postavi so zastopane vse pozicije, od tega natanko en center}
52+ && x_1 + x_2 &= 1 \\
53+ && x_3 + x_4 + x_5 &\ge 1 \\
54+ && x_6 + x_7 + x_8 &\ge 1
4955\opis {V postavi je ali Ciril ali Filip}
50- x_3 + x_6 = 1
51- \opis {V postavi je največ en center}
52- x_1 + x_2 \leq 1
56+ && x_3 + x_6 &= 1
5357\opis {Če začne Borut ali David, Hugo ostane v rezervi}
54- y_8 = 1 - x_8 \\
55- x_2 + x_4 \leq 2y_8
56- \end {alignat * }
58+ && x_2 + x_4 + 2x_8 & \leq 2
59+ \end { alignedat }
60+ \end {multline * }
5761\end {odgovor }
5862\end {naloga }
You can’t perform that action at this time.
0 commit comments