Merge pull request #578 from Quantum-Software-Development/FabianaCampanari-patch-1

Update README.md

Author: FabianaCampanari

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>