Optimization problems, solved and proven.
Type the math, describe it in words, snap a photo or say it. ProvenDecisions builds the model, solves it with real solvers, checks the answer and walks you through it.
Try it now, no account needed
Type a problem in math (plain text or LaTeX) and solve it here. Word, photo and voice problems, the full walkthrough and your history come with a free account.
Calculators: linear programming · integer programming · knapsack · transportation · assignment · LP dual · quadratic programming
🧭 Ask Hodos, your optimization guide
Questions about a step, a term or your own solution, answered from our tutorials and your problem, with every number from the solver. Included with the Student, Standard and Pro plans.
Three ways to ask
Typed math
maximize 3A + 2B subject to 2A + B <= 100 A + 2B <= 80 A, B >= 0
Answer: 160 at A = 40, B = 20. Verified optimal, with a dual certificate.
A photo
Answer: 540 at 8 chairs and 6 tables. Read from the photo, then solved and checked.
Your voice
"A closed can must hold 1,000 cubic centimeters; which radius and height use the least metal?"
Answer: 553.6 cm² at radius ≈ 5.42 cm, height ≈ 10.84 cm. Global minimum, checked to solver tolerance.
Every answer comes with its proof
Most answers stop at "optimal". ProvenDecisions shows why. Simple problems can be checked by hand. More complex problems can be checked with a spreadsheet. For the typed example above:
| Take 4/3 × (2A + B ≤ 100) | |
| plus 1/3 × (A + 2B ≤ 80) | |
| = 3A + 2B ≤ 160 | no plan can earn more than 160 |
| Our answer A = 40, B = 20 gives 160 | so nothing beats it ✔ |
Checked in exact fractions, not rounded decimals. Every number comes from a real solver, not from a language model's guess, and every answer is labelled with exactly what is proven: exactly proven optimal, optimal, numerically checked, or not proven optimal.
Solved examples
Classic problems, each solved by a real solver and checked. Open one, change the numbers and solve your own.
Product mix problem
Linear programming · 🎙️📷 spoken and photographed
See it solved and checked →
Diet problem
Linear programming · 🎙️📷 spoken and photographed
See it solved and checked →
Transportation problem
Linear programming · 🎙️📷 spoken and photographed
See it solved and checked →
Assignment problem
Integer programming · 🎙️📷 spoken and photographed
See it solved and checked →
0-1 knapsack problem
Integer programming · 🎙️📷 spoken and photographed
See it solved and checked →
Travelling salesman problem
Integer programming · 🎙️📷 spoken and photographed
See it solved and checked →
Who it's for
Students and instructors
Homework and course problems explained step by step, from the idea to the algebra and the solver's output.
Analysts and small businesses
Production, scheduling, blending, portfolio and pricing decisions, described in plain words and solved with checked answers.
Prices
Free for typed math · Student $12 · Standard $50 · Pro $100 a month. Paid plans start with a 3-day free trial and renew monthly until you cancel. Compare plans
Latest
- Limited-memory first-order methods, a Douglas–Rachford generalisation, and a new Reinhardt proof 2026-11-17
- Muon under shuffling, a Polyak-Łojasiewicz retrospective, and a polynomial-time result for slope change 2026-11-16
- Benders for power flows, bilevel cuts and decision-diagram intersection cuts 2026-11-14
- New in AI: OpenAI's mass release of machine-written mathematics: a quasi-Riemann claim and a disputed ETH disproof 2026-11-02
Explore
- Optimization for machine learning
- Primal and dual
- Problem classes
- Refreshers
- Glossary
- Pricing
- Books
- Daily Update
- New in AI
- Help
- Getting started: four ways to enter a problem
- Plans, prices and limits
- Reading an answer
- Photos and voice: what happens to your uploads
- The learning library, Glossary, Refreshers, Daily Update, New in AI and Update On Demand
- Privacy in plain words
- API and MCP server
- Contact us
- Privacy policy
- Terms of use
- Tutorial: Modelling basics: from a word problem to variables, objective and constraints
- Tutorial: Linear programs: the feasible region and the corner solution
- Tutorial: LP duality and shadow prices
- Tutorial: Convexity: recognising convex functions and sets
- Tutorial: Two goals at once: weighted sums and the trade-off curve
- Tutorial: The derivative: slope and rate of change
- Tutorial: Critical points and the first-derivative test
- Tutorial: Second derivative, concavity and the second-derivative test
- Tutorial: Convexity in one variable: the second-derivative check
- Tutorial: Taylor approximations and one Newton step
- Tutorial: Optimizing on a closed interval: check the end points
- Tutorial: Partial derivatives
- Tutorial: The gradient and the directional derivative
- Tutorial: The Hessian and classifying critical points
- Tutorial: Lagrange multipliers with one equality constraint
- Tutorial: Gradient, Hessian and definiteness in three variables
- Tutorial: Lagrange in three variables, and the step to KKT