diff --git a/src/doc/en/thematic_tutorials/linear_programming.rst b/src/doc/en/thematic_tutorials/linear_programming.rst
index c52868ecebf..9843eeba821 100644
--- a/src/doc/en/thematic_tutorials/linear_programming.rst
+++ b/src/doc/en/thematic_tutorials/linear_programming.rst
@@ -386,7 +386,7 @@ just as much as they receive. We can model the flow problem with the
 following LP
 
 .. MATH::
-    \text{Max: } & \sum_{su \in G} f_{su} - \sum_{sv \in G} f_{sv}\\
+    \text{Max: } & \sum_{su \in G} f_{su} - \sum_{vs \in G} f_{vs}\\
     \text{Such that: } & \forall v \in G, {\substack{v \neq s \\ v \neq t}}, \sum_{vu \in G} f_{vu} - \sum_{uv \in G} f_{uv} = 0\\
     & \forall uv \in G, f_{uv} \leq 1\\