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

Update README.md

Author: FabianaCampanari

README.md

@@ -584,14 +584,13 @@ $$
 <br><br>
 
 
-### **3.** Resolva o PL a seguir com o método Simplex:
-
+### **3.** Solve the following linear programming problem using the Simplex method.:
 
 $$
-\
+ \[
 \begin{aligned}
-\textbf{Max.} \quad & Z = 4x_1 + 3x_2 \\
-\textbf{S.a.} \quad &
+\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 \\
@@ -600,7 +599,7 @@ x_2 \leq 2 \\
 x_1 \geq 0 \text{ e } x_2 \geq 0
 \end{cases}
 \end{aligned}
-\
+\]
 SS