diff --git a/models/Application_examples/Knapsack_Weight_Limit.mp b/models/Application_examples/Knapsack_Weight_Limit.mp
index 2404923dff01fc060caf9f91613d88d919170692..45d14263b888181667a86df1a8184d0f9f971308 100644
--- a/models/Application_examples/Knapsack_Weight_Limit.mp
+++ b/models/Application_examples/Knapsack_Weight_Limit.mp
@@ -11,7 +11,7 @@
 │*│ │ optimal solutions in a certain scope, with a limit │ │
 │*│ │ set for the weight of the knapsack.                │ │
 │*│ └────────────────────────────────────────────────────┘ │
-│*│														   │
+│*│                                                        │
 │*│ ┌─[ Description ]────────────────────────────────────┐ │
 │*│ │ This is a case of well-known Knapsack Dynamic      │ │
 │*│ │ Programming Problem. In general it is NP-hard and  │ │