Skip to content

Commit 99a6638

Browse files
Update README.md
Signed-off-by: Fabiana 🧬 Campanari <113218619+FabianaCampanari@users.noreply.github.com>
1 parent d0fe356 commit 99a6638

File tree

1 file changed

+5
-22
lines changed

1 file changed

+5
-22
lines changed

README.md

Lines changed: 5 additions & 22 deletions
Original file line numberDiff line numberDiff line change
@@ -545,7 +545,7 @@ This example shows how to solve a Linear Programming (LP) problem using the **Si
545545
### [Problem]():
546546

547547

548-
### [Maximize the objective function]():
548+
### - [Maximize the objective function]():
549549

550550
Z = 3x + 5y
551551

@@ -639,7 +639,7 @@ This example demonstrates how to use Excel Solver to solve a Linear Programming
639639

640640
### Problem Statement
641641

642-
### [Maximize]():
642+
### - [Maximize]():
643643

644644
Z = 40x + 30y
645645

@@ -674,7 +674,7 @@ y &\geq 0 \\
674674

675675
<br>
676676

677-
### [*Excel Setup*]():
677+
### - [*Excel Setup*]():
678678

679679
<br>
680680

@@ -728,7 +728,7 @@ This example presents a complete, step-by-step solution to a **Linear Programmin
728728

729729
### 🧮 [Problem Statement]():
730730

731-
### [**Maximize:**]():
731+
### - [**Maximize:**]():
732732

733733
<br>
734734

@@ -737,7 +737,7 @@ $Z = 4x_1 + 3x_2$
737737
<br>
738738

739739

740-
### [**Subject to:**]():
740+
### - [**Subject to:**]():
741741

742742
$$
743743
\begin{cases}
@@ -763,23 +763,6 @@ x_1 \geq 0, \quad x_2 \geq 0
763763

764764
<br>
765765

766-
```latex
767-
\
768-
\begin{aligned}
769-
\text{Max.} \quad & Z = 4x_1 + 3x_2 \\
770-
\text{S.a.} \quad &
771-
\begin{cases}
772-
x_1 + 3x_2 \leq 7 \\
773-
2x_1 + 2x_2 \leq 8 \\
774-
x_1 + x_2 \leq 3 \\
775-
x_2 \leq 2 \\
776-
x_1 \geq 0 \text{ e } x_2 \geq 0
777-
\end{cases}
778-
\end{aligned}
779-
\
780-
```
781-
782-
<br>
783766

784767
### ✅ Standard Form Conversion:
785768

0 commit comments

Comments
 (0)