Fix old links

adityam · Mar 15, 2024 · 5863073 · 5863073
1 parent 803b5fe
commit 5863073
Show file tree

Hide file tree

Showing 3 changed files with 4 additions and 4 deletions.
diff --git a/_freeze/mdps/inventory-management/execute-results/html.json b/_freeze/mdps/inventory-management/execute-results/html.json
diff --git a/mdps/inventory-management.qmd b/mdps/inventory-management.qmd
@@ -103,7 +103,7 @@ Note that the problem at each step is similar to the [newsvendor] problem. So,
 similar to that model, we try to see if we can establish qualitative
 properties of the optimal solution.
 
-[newsvendor]: ../../stochastic/newsvendor
+[newsvendor]: ../stochastic-optimization/newsvendor.qmd
 
 ```{julia}
 #| output: false

diff --git a/mdps/reward-shaping.qmd b/mdps/reward-shaping.qmd
@@ -21,7 +21,7 @@ P_T)$, but different cost functions $c^1
 = (c^1_1, \dots, c^1_T)$ and $c^2 = (c^2_1, \dots, c^2_T)$. We assume that for
 $t \in \{1, \dots, T-1\}$, the per-step cost is a function of the current
 state, current action, and next state (see [cost depending on next
-state](../mdp-functional#cost-depends-on-next-state))[^1] and for $t = T$, the
+state](intro.qmd#sec-cost-depending-on-next-state))[^1] and for $t = T$, the
 per-step cost function is just a function of the current state. 
 
 [^1]: We choose the cost to depend on the next state only for convenience of