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
+21-4Lines changed: 21 additions & 4 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -43,9 +43,9 @@ Sim-opt combines simulation and optimization techniques to provide a comprehensi
43
43
44
44
The key difference between sim-opt and other analytical tools is its ability to model the complexity and dynamics of real-world systems, including data uncertainty and variability[1]. This allows for the creation of more robust and adaptable plans[1].
45
45
46
-
<br>
46
+
<br><br>
47
47
48
-
## [Optimization Problem]()
48
+
## I- [Optimization Problem]()
49
49
50
50
### An optimization problem can be represented using the `optidef` package. For example:
51
51
@@ -108,9 +108,9 @@ y(t) = A e^{kt}
108
108
109
109
#### This equation represents a simple solution to an ordinary differential equation.
110
110
111
-
<br>
111
+
<br><br>
112
112
113
-
## [Modeling - Writing Mathematical Models]()
113
+
## II- [Modeling - Writing Mathematical Models]()
114
114
115
115
116
116
### Example 1: [Maximizing Profit for a Chocolate Manufacturer]()
@@ -176,6 +176,23 @@ $$
176
176
Thus, the maximum profit achievable is [**R$ 5,100**]().
177
177
178
178
179
+
<br><br>
180
+
181
+
182
+
## III- Graphic Method for Linear Programming (LP)
0 commit comments