From 90f2db9417c67ee10d66bb537c8daf9f786fcad3 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, 23 Mar 2025 23:38:03 -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 | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/README.md b/README.md
index 3c15afb..ebcafd0 100644
--- a/README.md
+++ b/README.md
@@ -317,6 +317,9 @@ If the feasible region is **unbounded**, and if the objective function attains a
 
   <br><br>
 
+## Examples
+
+The source provides several examples [6-8] that illustrate the graphical method for both maximization and minimization problems with different sets of constraints. These examples demonstrate how to plot the constraints, identify the feasible region, find the vertices, and evaluate the objective function to determine the optimal solution and its value. For instance, Example 1 [6] finds the maximum of $x_1 + 2x_2$ subject to several constraints.