Apply suggestions from code review

Co-authored-by: James Foster <38274066+jd-foster@users.noreply.github.com>
jump-dev · Jul 7, 2023 · 1293211 · 1293211
1 parent eacb825
commit 1293211
Showing 1 changed file with 2 additions and 2 deletions.
diff --git a/docs/src/tutorials/linear/cannery.jl b/docs/src/tutorials/linear/cannery.jl
@@ -32,8 +32,8 @@ import Test #src
 # has a demand ``d_m``. The shipping cost per case of cans from plant ``p`` 
 # to market ``m`` is ``d_{p,m}``.
 
-# We wish to find the distribution plan ``x_{p,m}`` (the # of cases of cans
-# to ship from plant ``p`` to market ``m``) for ``p \in P`` and ``m \in M`` 
+# We wish to find the distribution plan ``x_{p,m}``, the number of cases of cans
+# to ship from plant ``p`` to market ``m``, for ``p \in P`` and ``m \in M`` 
 # that minimizes the shipping costs. We can formulate our problem as the
 # following linear program:
 # ```math