What are you working out?
Both equations & optimization labs
Numerical Root Finding Laboratory
Solves f(x) = 0 for a cubic, cosine or exponential equation by bisection, Newton-Raphson and the secant method side by side. Every iteration is computed and shown, with each method's status (converged, out of iterations, flat slope, no sign change or diverged), its estimate, residual and step, the fastest method, a 151-point function curve and five scored challenges. For learning numerical methods.
Equations & optimizationResource Allocation Dynamic Programming Lab
A budget of up to 12 whole units shared among 2 to 5 projects, each with its own reward for each number of units and a cap: the best plan found exactly by backward induction, with the lattice of every project and budget, the exact number of tied best plans and of all plans, the greedy rule played step by step with its shortfall and the condition under which it is guaranteed to be best, the value of one more unit, and your own plan scored against the best. Five challenges are scored for you. For learning dynamic programming and why greedy can fail.