Dekker1/dekker-phd-thesis
Archived
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Remove unused equation number

Browse Source
This commit is contained in:
Jip J. Dekker 2021-04-13 12:57:46 +10:00
parent c484fea52e
commit ef1ad4107f
No known key found for this signature in database
GPG Key ID: 517DF4A00618C9C3
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
chapters/2_background.tex
View File

@ -74,14 +74,14 @@ the model.
The following set of equations describe this knapsack problem as a \gls{cop}: The following set of equations describe this knapsack problem as a \gls{cop}:
\begin{equation} \begin{equation*}
\text{maximise}~z~\text{subject to}~ \text{maximise}~z~\text{subject to}~
\begin{cases} \begin{cases}
S \subseteq T \\ S \subseteq T \\
z = \sum_{i \in S} joy(i) \\ z = \sum_{i \in S} joy(i) \\
\sum_{i \in S} space(i) < C \\ \sum_{i \in S} space(i) < C \\
\end{cases} \end{cases}
\end{equation} \end{equation*}
In these equations \(S\) is set \gls{variable}. It contains the selection of In these equations \(S\) is set \gls{variable}. It contains the selection of
toys that will be packed for the trip. \(z\) is the objective \gls{variable} toys that will be packed for the trip. \(z\) is the objective \gls{variable}