2martens/uni
1
0
Fork 0
mirror of https://github.com/2martens/uni.git synced 2026-05-07 03:46:25 +02:00
Code Releases Activity

Compare commits

base: 2martens:ad_blatt_6
Branches Tags
2martens:master
2martens:gdb_blatt_6 2martens:ad_blatt_7 2martens:opti_blatt_12 2martens:prosem 2martens:gdb_blatt_5 2martens:ad_blatt_6 2martens:opti_blatt_11 2martens:opti_blatt_9 2martens:ad_blatt_5 2martens:gdb_blatt_4 2martens:ad_blatt_4 2martens:opti_blatt_8 2martens:opti_blatt_7 2martens:gdb_blatt_3 2martens:ad_blatt_3 2martens:opti_blatt_6 2martens:ad_blatt_2 2martens:opti_blatt_4 2martens:opti_blatt_3 2martens:gdb_blatt_1 2martens:opti_blatt_2 2martens:opti_blatt_3_b1 2martens:ad_blatt_1 2martens:opti_blatt_1
...
compare: 2martens:gdb_blatt_5
Branches Tags
2martens:master
2martens:gdb_blatt_6 2martens:ad_blatt_7 2martens:opti_blatt_12 2martens:prosem 2martens:gdb_blatt_5 2martens:ad_blatt_6 2martens:opti_blatt_11 2martens:opti_blatt_9 2martens:ad_blatt_5 2martens:gdb_blatt_4 2martens:ad_blatt_4 2martens:opti_blatt_8 2martens:opti_blatt_7 2martens:gdb_blatt_3 2martens:ad_blatt_3 2martens:opti_blatt_6 2martens:ad_blatt_2 2martens:opti_blatt_4 2martens:opti_blatt_3 2martens:gdb_blatt_1 2martens:opti_blatt_2 2martens:opti_blatt_3_b1 2martens:ad_blatt_1 2martens:opti_blatt_1

1 Commits
ad_blatt_6 ... gdb_blatt_

Author SHA1 Message Date
Jim Martens
81ab70be51 MATH2-Inf-10: Aufgabenblatt korrigiert. 2014-01-15 22:23:28 +01:00
1 changed files with 3 additions and 3 deletions
Expand all files Collapse all files

6
optimierung/Uebungsblatt10.tex
View File

@ -74,6 +74,7 @@ Stephan Niendorf (6242417)}
\node (bCap) [below=0.1 of b] {(s, +, 5)}; \node (bCap) [below=0.1 of b] {(s, +, 5)};
\node (cCap) [below=0.1 of c] {(s, +, 6)}; \node (cCap) [below=0.1 of c] {(s, +, 6)};
\node (dCap) [below=0.1 of d] {(b, +, 5)}; \node (dCap) [below=0.1 of d] {(b, +, 5)};
\node (eCap) [below=0.1 of e] {(b, +, 2)};
\node (tCap) [above=0.1 of t] {(d, +, 5)}; \node (tCap) [above=0.1 of t] {(d, +, 5)};
\path[->] (s) edge node [above left] {3(3)} (a) \path[->] (s) edge node [above left] {3(3)} (a)
(s) edge[line width=2pt] node [below] {0(5)} (b) (s) edge[line width=2pt] node [below] {0(5)} (b)
@ -171,7 +172,7 @@ b = 0, n = 0, s = 381/56, m = 0
In das verlinkte Tool wird folgendes eingegeben: In das verlinkte Tool wird folgendes eingegeben:
\begin{verbatim} \begin{verbatim}
Minimize p = 3x1 + 24x2 + 13x3 + 9x4 + 20x5 + 19x6 subject to Minimize p = 3x1 + 24x2 + 13x3 + 9x4 + 20x5 + 19x6 subject to
110x1 + 205x2 + 160x3 + 160x3 + 420x5 + 260x6 >= 2000 110x1 + 205x2 + 160x3 + 160x4 + 420x5 + 260x6 >= 2000
4x1 + 32x2 + 13x3 + 8x4 + 4x5 + 14x6 >= 55 4x1 + 32x2 + 13x3 + 8x4 + 4x5 + 14x6 >= 55
2x1 + 12x2 + 54x3 + 285x4 + 22x5 + 80x6 >= 800 2x1 + 12x2 + 54x3 + 285x4 + 22x5 + 80x6 >= 800
x1 <= 4 x1 <= 4
@ -189,8 +190,7 @@ x6 >= 0
\end{verbatim} \end{verbatim}
Die Ausgabe ist: Die Ausgabe ist:
\begin{verbatim} \begin{verbatim}
Optimal Solution: p = 46621/380; x1 = 4, x2 = 0, x3 = 5/4, Optimal Solution: p = 185/2; x1 = 4, x2 = 0, x3 = 0, x4 = 9/2, x5 = 2, x6 = 0
x4 = 347/190, x5 = 2, x6 = 2
\end{verbatim} \end{verbatim}
\subsection{} %d \subsection{} %d
In das verlinkte Tool wird folgendes eingegeben: In das verlinkte Tool wird folgendes eingegeben: