diff --git a/Application_examples/Knapsack_Weight_Limit.mp b/Application_examples/Knapsack_Weight_Limit.mp
index ebe7c4de00ebb093a0cf5f545cb2b2153068062b..0c3399bb39ac8414f1c3d0308530c304b17eaafc 100644
--- a/Application_examples/Knapsack_Weight_Limit.mp
+++ b/Application_examples/Knapsack_Weight_Limit.mp
@@ -1,4 +1,6 @@
-/* Example 38 Knapsack
+/* Model of [Knapsack_Weight_Limit]
+
+Example 38 Knapsack
 
 	This is a case of well-known Knapsack Dynamic Programming Problem.
     In general it is NP-hard and NP-complete