Problem classes
Every plan solves the same kinds of problems. Plans differ in how much you can do (word, photo and voice problems use a monthly allowance), how large a model can be (Pro adds vector syntax), and which tutorials you can open. Each answer says exactly what is proven: π’ proven optimal, π‘ the best found and labelled as such, π΄ not solved yet, and the app says so.
What ProvenDecisions solves
| Problem class | How it is solved | |
|---|---|---|
| π’ | Linear programs Linear objective and constraints: production, blending, diet, staffing | Proven optimal (exact certificate and dual check) |
| π’ | Networks Transport, assignment, shortest path, flows | As linear programs |
| π’ | Plans over several periods Several periods solved together, with known data | As linear or integer programs |
| π’ | Absolute values, max, min Least absolute deviations, minimax, Chebyshev fits | Rewritten exactly as a linear program (shown) |
| π’ | Ratios of linear functions Return per unit, efficiency ratios | Exact change of variables |
| π’ | Integer and yes/no decisions Knapsack, assignment, facility location, scheduling, small routing | Optimal with bound and gap reported |
| π’ | Dynamic programs (known data) Stage-by-stage decisions such as the stagecoach problem | Written as a linear or integer program; no separate DP solver |
| π’ | Convex quadratic programs Portfolios, closest points, least squares, ridge and lasso | Optimal, with a dual or optimality check |
| π’ | Norms and cones Distances, enclosing circles, risk limits, robust lines already written out | Second-order cone solvers |
| π’ | Logs and exponentials Log utility, entropy, logistic regression | Exponential cone solvers |
| π’ | Geometric programs Posynomial design problems | Log change of variables (a few labelled limited) |
| π’ | Small semidefinite programs Eigenvalue bounds, matrix inequalities, nearest correlation matrix | Semidefinite solvers |
| π’ | Mixed-integer convex Integers with a convex quadratic or cone | Branch and bound (SCIP) |
| π’π‘ | Classic shapes Smallest enclosing or largest inscribed ellipse; geodesics on a sphere; the brachistochrone; k-means | Built-in methods, each checked |
| π‘ | Nonconvex problems Indefinite quadratics, general nonlinear, products of variables | Best point from many starts, labelled βlocal optimum, not certified as globalβ |
| π‘ | Nonconvex with integers Integers plus nonconvex terms | Solved when an exact rewrite exists; otherwise no answer yet |
| π‘ | Two objectives Cost against emissions, return against risk | Solved as the one weighted objective you give |
| π΄ | Stochastic and robust Random data, chance constraints, worst cases over an uncertainty set | Not yet: the app says so; scenario data typed as a fixed model is solved |
| π΄ | Multistage and dynamic with uncertainty Decisions revised as outcomes appear, Markov decision processes | Not yet |
| π΄ | Very large or black-box Over 5,000 variables, or an objective only a simulator can compute | Not yet |
| π΄ | Bilevel and equilibrium One optimization inside another | Not yet |
What differs by plan
| No account | Free | Student | Standard | Pro | |
|---|---|---|---|---|---|
| Problem classes | the same | the same | the same | the same | the same |
| Typed math | 5 tries a day on the front page | β | β | β | β |
| Word problems | β | β a few a month | β | β | β the most |
| Photos and voice a month | β | 5 and 5 | 250 and 100 | 200 and 200 | 500 and 500 |
| Vector syntax for large models (var x[100]) | β | β | β | β | β |
| Duals, proofs, walkthrough depth | β | β | β | β | β |
| API and MCP access (scripts, AI assistants) | β | β | β | β | β |
| Tutorials | β | Free ones | More | More | All |
Details: Plans and limits Β· Pricing Β· API and MCP Β· Primal and dual
Try ProvenDecisions free: type, photograph or say an optimization problem; every answer is checked by a solver.