Merge branch 'master' of https://lxsd.femto-st.fr/gitlab/jfriedt/ifcs2018-article

Arthur HUGEAT
2 parents 8a48cee580 a1a7d87667
Showing 1 changed file Side-by-side Diff
ifcs2018_proceeding.tex
@@ -249,8 +249,8 @@
  
 Linear program formalism for solving the problem is well documented: an objective function is
 defined which is linearly dependent on the parameters to be optimized. Constraints are expressed
-as linear equation and solved using one of the available solvers, in our case GLPK\cite{glpk}.
-With the notation explain in system \ref{model-FIR}, we have defined our linear problem like this:
+as linear equations and solved using one of the available solvers, in our case GLPK\cite{glpk}.
+With the notations used in the description of system \ref{model-FIR}, we have defined the linear problem as:
 \paragraph{Variables}
 \begin{align*}
 x_{i,j} \in \lbrace 0,1 \rbrace & \text{ $i$ is a given filter} \\
...	...	@@ -249,8 +249,8 @@
249	249
250	250	Linear program formalism for solving the problem is well documented: an objective function is
251	251	defined which is linearly dependent on the parameters to be optimized. Constraints are expressed
252		-as linear equation and solved using one of the available solvers, in our case GLPK\cite{glpk}.
253		-With the notation explain in system \ref{model-FIR}, we have defined our linear problem like this:
	252	+as linear equations and solved using one of the available solvers, in our case GLPK\cite{glpk}.
	253	+With the notations used in the description of system \ref{model-FIR}, we have defined the linear problem as:
254	254	\paragraph{Variables}
255	255	\begin{align*}
256	256	x_{i,j} \in \lbrace 0,1 \rbrace & \text{ $i$ is a given filter} \\