LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision Both sides next revision
sav07_lecture_3_skeleton [2007/03/21 10:39]
vkuncak
sav07_lecture_3_skeleton [2007/03/21 10:39]
vkuncak
Line 150: Line 150:
  
 Proof: small model theorem. Proof: small model theorem.
 +
  
  
Line 163: Line 164:
 Next: reduce to integer linear programming:​ Next: reduce to integer linear programming:​
 \begin{equation*} \begin{equation*}
-  A\vec x = \vec b, \vec x \geq \vec 0+  A\vec x = \vec b, \qquad ​\vec x \geq \vec 0
 \end{equation*} \end{equation*}
 where $A \in {\cal Z}^{m,n}$ and $x \in {\cal Z}^n$. where $A \in {\cal Z}^{m,n}$ and $x \in {\cal Z}^n$.