We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent fcd420d commit 5fa0290Copy full SHA for 5fa0290
README.md
@@ -294,7 +294,13 @@ The **graphical method** for solving simple linear programming (LP) problems inv
294
* For a **maximization** problem, the vertex that yields the **largest** value of the objective function is the optimal solution [1, 6].
295
* For a **minimization** problem, the vertex that yields the **smallest** value of the objective function is the optimal solution [2, 7].
296
297
- <br>
+
298
+<br><br>
299
300
+## Possible Scenarios
301
302
+* **Unique Optimal Solution:** The objective function achieves its maximum or minimum value at a single vertex of the feasible region [3, 5, 6].
303
304
305
306
0 commit comments