From 18ef125ad63c44253bbac61c45713885130c11cc Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Fabiana=20=F0=9F=9A=80=20=20Campanari?=
<113218619+FabianaCampanari@users.noreply.github.com>
Date: Thu, 24 Apr 2025 22:45:37 -0300
Subject: [PATCH] Update README.md
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit
Signed-off-by: Fabiana 🚀 Campanari <113218619+FabianaCampanari@users.noreply.github.com>
---
README.md | 6 +++---
1 file changed, 3 insertions(+), 3 deletions(-)
diff --git a/README.md b/README.md
index 558185b..b9ca530 100644
--- a/README.md
+++ b/README.md
@@ -339,16 +339,16 @@ The **graphical method** for solving simple linear programming (LP) problems inv
-3. **Identify the Vertices:** Determine the coordinates of all the vertices (corner points) of the feasible region [4, 6]. These are the points where the boundary lines intersect.
+3. **[Identify the Vertices]():** Determine the coordinates of all the vertices (corner points) of the feasible region [4, 6]. These are the points where the boundary lines intersect.
-4. **Evaluate the Objective Function at Each Vertex:** Substitute the coordinates of each vertex into the objective function to find the value of the objective function at that point [6].
+4. **[Evaluate the Objective Function at Each Vertex]():** Substitute the coordinates of each vertex into the objective function to find the value of the objective function at that point [6].
-5. **Determine the Optimal Solution:**
+5. **[Determine the Optimal Solution]():**
* For a **maximization** problem, the vertex that yields the **largest** value of the objective function is the optimal solution [1, 6].
* For a **minimization** problem, the vertex that yields the **smallest** value of the objective function is the optimal solution [2, 7].