diff --git a/docs/src/tutorials/algorithms/benders_decomposition.jl b/docs/src/tutorials/algorithms/benders_decomposition.jl
index 9e0c20f1e58..9bedbfcf56a 100644
--- a/docs/src/tutorials/algorithms/benders_decomposition.jl
+++ b/docs/src/tutorials/algorithms/benders_decomposition.jl
@@ -273,7 +273,7 @@ optimize!(lazy_model)
 
 number_of_subproblem_solves
 
-# But for larger problem, you cann expect the callback algorithm to be more
+# But for larger problem, you can expect the callback algorithm to be more
 # efficient than the iterative algorithm.
 
 # Finally, we can obtain the optimal solution: