You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+2-2Lines changed: 2 additions & 2 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -48,7 +48,9 @@ Sim-opt combines simulation and optimization techniques to provide a comprehensi
48
48
49
49
**[Benefits]() of Sim-Opt**
50
50
***[Analyzing uncertain scenarios]():** Sim-opt evaluates the impact of unpredictable events and helps plan strategies to manage risk.
51
+
51
52
***[Optimizing processes]():** It identifies bottlenecks and opportunities for improvement and defines the best practices for various situations.
53
+
52
54
***[Making informed decisions]():** Sim-opt bases decisions on data and simulations, reducing uncertainty and the risk of errors.
53
55
54
56
<br>
@@ -327,10 +329,8 @@ The **graphical method** for solving simple linear programming (LP) problems inv
327
329
a_{i1}x_1 + a_{i2}x_2 \geq b_i
328
330
```
329
331
330
-
331
332
<br>
332
333
333
-
334
334
-**[Feasible Solution]():** A solution $\(x_1, x_2)\$ that satisfies all the constraints of the problem.
335
335
336
336
-**[Feasible Region]():** The set of all feasible solutions. Graphically, this is a subregion of the plane formed by the intersection of the regions defined by the constraints. The feasible region is often a **convex polygon**.
0 commit comments