From 52bffb7cf935d88e2bf67ab33197672826cfcced Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Fabiana=20=20=F0=9F=A7=AC=20Campanari?=
 <113218619+FabianaCampanari@users.noreply.github.com>
Date: Sun, 13 Jul 2025 18:08:06 -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 | 15 ++++++++-------
 1 file changed, 8 insertions(+), 7 deletions(-)

diff --git a/README.md b/README.md
index 57d9da0..fbd6986 100644
--- a/README.md
+++ b/README.md
@@ -1867,7 +1867,10 @@ v_1 &= 12, \quad v_2 = 18, \quad v_3 = 24 \\
 
 <br>
 
-**Conclusion:** Negative reduced costs ($ x_{12}, x_{13}, x_{23} $) mean the solution is **still not optimal**. Further iterations are required.
+**Conclusio** Negative reduced costs ($ x_{12}, x_{13}, x_{23} $) mean the solution is **still not optimal**. Further iterations are required.
+
+[**Conclusion**](): Negative reduced costs ($x_{12}$, $x_{13}$, $x_{23}$) mean the solution is **still not optimal**. Further iterations are required.
+
 
 <br>
 
@@ -1881,6 +1884,9 @@ Most negative reduced cost: $\bar{c}_{13} = -6$.
 
 <br>
 
+
+---\\\ UNDER CONTR🚛🚛🚛
+
 #### [4.2](). Construct the Closed Loop
 
 - **Loop Path**: $ x_{13} \rightarrow x_{33} \rightarrow x_{31} \rightarrow x_{11} \rightarrow x_{13} $.  
@@ -1956,12 +1962,7 @@ Recalculating reduced costs confirms all $ \bar{c}_{ij} \geq 0 $. **Optimal solu
 This is the optimal solution with all reduced costs non-negative.
 
 
-
-
-### Under Construction 🚛
-
-<br><br><br><br><br><br><br><br><br>
-
+<br>
  
 # XIII - [Designation]():