From 595fa2177bead12ce2a59e5ec4aad7efd29995a3 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:36:34 -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 | 10 ++++++++++
 1 file changed, 10 insertions(+)

diff --git a/README.md b/README.md
index e7bfcab..308d072 100644
--- a/README.md
+++ b/README.md
@@ -306,6 +306,16 @@ The **graphical method** for solving simple linear programming (LP) problems inv
 *   **Unbounded Feasible Region:** If the feasible region extends infinitely in some direction, the objective function might also be unbounded (it can increase or decrease indefinitely without reaching a maximum or minimum value) [5]. However, if an optimal solution exists even with an unbounded region, it will still occur at a vertex [5].
 
 *   **Empty Feasible Region:** If the constraints are inconsistent and there are no points that satisfy all of them simultaneously, the feasible region is empty, and the linear programming problem has no solution [4].
+
+
+  <br><br>
+
+## Theorem on Optimal Solutions
+
+If the feasible region of a linear programming problem is **non-empty and bounded**, then the objective function attains both a **maximum and a minimum value**, and these occur at **extreme points (vertices)** of the feasible region [5].
+
+
+