diff --git a/convex_optimization.pdf b/convex_optimization.pdf index 7fbba2dfdf658ceb908ee5c19bc679e1db4c14d4..8d5be48b2dbab9a8182633df681cd6a0b93fdf5d 100644 Binary files a/convex_optimization.pdf and b/convex_optimization.pdf differ diff --git a/linear_programs.pdf b/linear_programs.pdf index 81acc460d6e85fa58a584647de93cb82433376c5..ec7191ad2438df593c0784c41f784957503faf30 100644 Binary files a/linear_programs.pdf and b/linear_programs.pdf differ diff --git a/linear_programs.tex b/linear_programs.tex index ecc3b87305ed5fd8f8379538831bac224596468e..4084d1df46c9bde179e35ddc8d89981c7e345c07 100644 --- a/linear_programs.tex +++ b/linear_programs.tex @@ -501,7 +501,6 @@ We first only consider the second stage, which is sufficient if setting $x_1 = \ \tcp{Ratio test: choose best pivot row}$r \coloneq \arg\min_{i \in B} \left\{\frac{\bar{b}_i}{\bar{a}_{is}} \mid \bar{a}_{is} > 0\right\}$.\\ \tcp{Pivoting} -<<<<<<< HEAD$B \coloneqq B \setminus \{r\} \cup \{s\}$.\\$N \coloneqq N \setminus \{s\} \cup \{r\}$.\\$a_{rj} \coloneqq \frac{a_{rj}}{a_{rs}}$for$j \in \{1, \ldots, n+m\}\$.\\