Optimization, Graph Theory & Numerical Methods
Linear and nonlinear optimization, classical graph algorithms, game theory, root-finding, and interpolation.
Linear Programming (Simplex)
Solve LP problems with the simplex method. Visualize 2D feasible regions and optimal vertices.
Open Tool →Nonlinear Optimization
Gradient descent and Newton's method visualizers for unconstrained problems.
Open Tool →Graph Algorithms
Dijkstra shortest paths, Kruskal/Prim MST, and graph coloring heuristics.
Open Tool →Game Theory — Nash Equilibrium
Find pure and mixed Nash equilibria for 2×2 payoff matrices.
Open Tool →Root-Finding Suite
Bisection, Newton-Raphson, and secant methods with convergence plots and iteration tables.
Open Tool →Interpolation Tools
Lagrange, Newton divided differences, and cubic spline interpolation with error visualization.
Open Tool →