Merge pull request #20 from DonnaVakalis/quarto

Update interchange.qmd

stochastic-optimization/interchange.qmd

@@ -6,7 +6,7 @@ For some stochastic optimization problems, it is possible to identify the optima
 
 ## Optimal scheduling
 
-Suppose we are interested in solving a problem and there are $n$ possible solution approaches that could be used. The only to find if a solution approach works or not is to test it; testing solution approach $i$ costs $c_i$ resources and may succeed with probability $p_i$. The probability of success of each alternative is independent of others. Find the search order that finds working solution at minimum expected cost.
+Suppose we are interested in solving a problem and there are $n$ possible solution approaches that could be used. The only way to find if a solution approach works or not is to test it; testing solution approach $i$ costs $c_i$ resources and may succeed with probability $p_i$. The probability of success of each alternative is independent of others. Find the search order that finds a working solution at minimum expected cost.
 
 ::: {#prp-optimal-scheduling}
 The optimal search order $(i_1, \dots, i_n)$ is a permutation of $(1,2,\dots,n)$ such that
@@ -57,7 +57,7 @@ $$
 $$
 We want to choose a permutation $(π_1, \dots, π_n)$ of $(1,\dots,n)$ to minimize
 $$
-  J(π) = \sum_{i=1}^n a_{π_i} b_j.
+  J(π) = \sum_{i=1}^n a_{π_i} b_i.
 $$
 
 :::{#prp-Hardy-inequality}