Update README.md

README.md

@@ -44,17 +44,16 @@ The model can classify and extract variables for the following supply chain opti
 2. **Economic Order Quantity (EOQ)**: Calculates the optimal order quantity to minimize total inventory costs.
 3. **Vehicle Routing Problem (VRP)**: Plans optimal routes for a fleet of vehicles to deliver products to customers.
 
-### Example Inputs
-
-- **Newsvendor Problem**: "We have 12 items of X and 7 items of Y left in our inventory. The cost per item of X is $5 and of Y is $15. The storage cost is $1 per unit. We have historical orders for X: [26, 25, 29, 17, 49, 33, 46, 42, 30, 33] and for Y: [31, 26, 50, 25, 21, 16, 21, 39, 27, 45]. The selling price for X is $3 and for Y is $3. The storage limit is 498 units."
-- **EOQ Problem**: "We need to determine the optimal order quantity for a product with a demand rate of 500 units per year, an ordering cost of $50 per order, and a holding cost of $2 per unit per year."
-- **VRP Problem**: "We need to plan routes for 5 vehicles to deliver products to 20 customers. Each vehicle has a capacity of 100 units. The customer demands are as follows: [10, 20, 15, 30, 25, 20, 35, 40, 30, 20, 15, 25, 10, 5, 20, 30, 25, 15, 10, 20]."
 
 ### Example Inputs
 
 - **Newsvendor Problem**: "We have 12 items of X and 7 items of Y left in our inventory. The cost per item of X is $5 and of Y is $15. The storage cost is $1 per unit. We have historical orders for X: [26, 25, 29, 17, 49, 33, 46, 42, 30, 33] and for Y: [31, 26, 50, 25, 21, 16, 21, 39, 27, 45]. The selling price for X is $3 and for Y is $3. The storage limit is 498 units."
 - **EOQ Problem**: "We need to determine the optimal order quantity for a product with a demand rate of 500 units per year, an ordering cost of $50 per order, and a holding cost of $2 per unit per year."
-- **VRP Problem**: "We need to plan routes for 5 vehicles to deliver products to 20 customers. Each vehicle has a capacity of 100 units. The customer demands are as follows: [10, 20, 15, 30, 25, 20, 35, 40, 30, 20, 15, 25, 10, 5, 20, 30, 25, 15, 10, 20]."
+- **VRP Problem**: "We need to plan routes for 3 vehicles to deliver products to 10 customers.
+Each vehicle has a capacity of 100 units. The customer demands are as follows: 10, 20, 15, 10, 5, 25, 30, 10, 15, 20 units.
+The coordinates of the delivery locations are: (2,3), (5,5), (8,8), (1,2), (3,6), (7,2), (6,6), (5,9), (2,8), (4,4).
+The warehouse is located at (0,0)."
+
 
 ## Fine-Tuning Process