From 01aa78ad9d75e0de57951465b45e7f613e195150 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: Sun, 4 May 2025 19:46:27 -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 | 24 +++++++++---------------
 1 file changed, 9 insertions(+), 15 deletions(-)

diff --git a/README.md b/README.md
index 715f461..d8ee7be 100644
--- a/README.md
+++ b/README.md
@@ -596,24 +596,18 @@ This example presents a complete, step-by-step solution to a **Linear Programmin
 
 ## 🧮 Problem Statement
 
+### **Maximize:**
 
+$Z = 4x_1 + 3x_2$
 
+### **Subject to:**
+
+$x_1 + 3x_2 \leq 7$  
+$2x_1 + 2x_2 \leq 8$  
+$x_1 + x_2 \leq 3$  
+$x_2 \leq 2$  
+$x_1 \geq 0,\ x_2 \geq 0$
 
-$$
-\
-\begin{aligned}
-\text{Max.} \quad & Z = 4x_1 + 3x_2 \\
-\text{S.a.} \quad & 
-\begin{cases}
-x_1 + 3x_2 \leq 7 \\
-2x_1 + 2x_2 \leq 8 \\
-x_1 + x_2 \leq 3 \\
-x_2 \leq 2 \\
-x_1 \geq 0 \text{ e } x_2 \geq 0
-\end{cases}
-\end{aligned}
-\
-$$
 
 <br>