Skip to content

Commit a702ac2

Browse files
Update README.md
Signed-off-by: Fabiana 🚀 Campanari <113218619+FabianaCampanari@users.noreply.github.com>
1 parent 5cf83df commit a702ac2

File tree

1 file changed

+4
-2
lines changed

1 file changed

+4
-2
lines changed

README.md

Lines changed: 4 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -186,9 +186,11 @@ Thus, the maximum profit achievable is [**R$ 5,100**]().
186186
The **graphical method** for solving simple linear programming (LP) problems involving **two decision variables**. The graphical method provides a visual way to understand the constraints, the feasible region, and how to find the optimal solution that either maximizes or minimizes the objective function.
187187

188188

189-
### Key Concepts
189+
### [Key Concepts]():
190190

191-
- **Decision Variables:** These are the variables that we want to determine the values of to optimize the objective function (e.g., $\(x_1\)$ and $\(x_2\)$).
191+
- **Decision Variables:** These are the variables that we want to determine the values of to optimize the ***[OBJECTIVE FUNCTION]()*** (e.g.) -
192+
193+
$\(x_1\)$ and $\(x_2\)$
192194

193195
- **Objective Function:** This is the linear function that we aim to maximize or minimize. For example:
194196

0 commit comments

Comments
 (0)