Merge pull request #367 from Quantum-Software-Development/main

up

Author: FabianaCampanari

README.md

@@ -548,27 +548,43 @@ After running Solver:
 - **y = 20**
 - **Z = 40×10 + 30×20 = 1000**
 
+<br>
+
+## Extras Excercise:
 
-## Extras Excercise
+<br>
 
+### 1. [Develop a Mathematical Model – Linear Programming (LP)]():
+
+📘 Problem Statement in English
+
+A company, after a production rationalization process, has 3 available productive resources: R1, R2, and R3. A study indicated the feasibility of manufacturing two products: P1 and P2. After analyzing costs and consulting the sales department, it was found that P1 yields a profit of 120 u.m. per unit and P2 yields 150 u.m. per unit. The production department provided the following resource usage table:
+
+| Product | R1/unit | R2/unit | R3/unit |
+|---------|---------|---------|---------|
+| P1      |   2     |   3     |   5     |
+| P2      |   4     |   0     |   3     |
+
+| Resource Availability per month | R1 = 100 | R2 = 90 | R3 = 120 |
 
 
 
 
 
 
-<br>
+
+<br><br>
 
 
-### **2.** Solve graphically the LP presented below:
+### **2.** [Solve graphically the LP presented below]():
 
+<br>
 
 $$
 \
 \begin{aligned}
 \textbf{Max.} \quad & Z = 4x_1 + 3x_2 \\
 \textbf{S.a.} \quad &
-
 \begin{cases}
 x_1 + 3x_2 \leq 7 \\
 2x_1 + 2x_2 \leq 8 \\
@@ -582,17 +598,19 @@ $$
 
 
 
+
 <br><br>
 
 
-### **3.** Solve the following linear programming problem using the Simplex method.:
+### **3.** [Solve the following linear programming problem using the Simplex method]():
+
+<br>
 
 $$
 \
 \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 \\