imo_solver

Introduction to Mathematics & Optimization · Aarhus University

offline · local

Paste an exam problem

Nothing is computed until you confirm. Copying out of the PDF destroys exponents — x^4 arrives as x4, which parses as 4x instead of failing. imo_solver repairs what it safely can and shows you every guess.

Try it on

Paste a whole problem — preamble and all the sub-questions — and press Read the problem.

Function

Write it like the exam does: x^2 - y, (21*y*x)/(y^2+x^3), e^(x^2+y), cos(sin(x)). Implicit multiplication works (2x, xy).

From past exams

Press Analyse — every step will cite the syllabus, and clicking a step opens the reasoning behind it.

Symmetric matrix

One row per line, or [[1,1,t],[1,2,1],[t,1,1]]. Entries may contain a parameter.

From past exams

Quadratic form → matrix

Finds the symmetric A with f(v) = vᵀAv, then decides its definiteness (May 25 P2, Jun 21 P2).

The extended (2n)×n matrix of section 8.7 is shown at every arrow, exactly as you would write it on paper.

Gaussian elimination

Write them exactly as the exam prints them. The coefficients are collected into A and b for you, and that step is shown.

Entries may contain a parameter. Every division by something that could vanish is recorded as an assumption, and the excluded values are then solved as separate cases — that is exactly what May 23 P3 and Jan 25 P2 are testing.

From past exams

A system of equations

Takes the equations as written. If the system is linear it is routed through Gaussian elimination with every row operation shown; if it is not (a Lagrange or KKT stationarity system, with products like λx) it is solved directly and every branch is listed.

Least squares — Theorem 5.16

Best-fit parabola through (0,0),(1,1),(2,3),(3,5) — Jan 22 P3(c).

Every row operation is shown on the augmented matrix, citing Theorem 2.8.

max / min f(v) subject to v ∈ C

One constraint per line or comma separated. Chains like 0 <= x <= 3 work. Write the set however the exam does: x >= 0, y >= 0, x + y >= 1 or x^2 + y^2 <= 4.

From the book and past exams

Uses Proposition 7.46 and section 7.11: search C° for critical points, then every face of ∂C, then compare. Existence first, by Theorem 5.84.

KKT conditions — Theorem 9.37

From past exams

Writes the four blocks in the order of (9.28)–(9.34), checks strict feasibility (Def. 9.36), and walks all 2m cases of §9.5.1 showing why each branch dies.

Decide a property

The short arguments the exams repeat: is it a convex problem, is the solution unique, does a global minimum exist, is f ≥ 0. Each is assembled from the syllabus results that license it.

Lagrange multipliers — Theorem 7.39

Press Solve. You get the existence argument, the split into C° and ∂C, every face worked out, and a comparison table — with the LaTeX ready to paste.

Topology of a constraint set

Interior, boundary, bounded, closed, compact, convex — each with the proof the exam wants, including an explicit radius R when bounded, or an explicit escaping sequence when not.

From past exams

Closedness is always the same three lines: each gi is continuous (5.74, 5.75), (−∞,0] is closed (5.52), preimages of closed sets are closed (5.69), finite intersections of closed sets are closed (5.49).

Press Analyse.

Fourier–Motzkin elimination

One per line. Strict < and > are tracked separately from <= and >= — that distinction is the whole point of the separating-line problems.

From past exams and the book

Follows §4.5 exactly: isolate, collapse to max ≤ y ≤ min, then explode into p·q inequalities (Exercise 4.38). A false constant inequality proves the system unsolvable.

Every stage of the elimination chain is shown, with the LaTeX ready to paste.

Optimal separating hyperplane — Theorem 9.8

From past exams

Pairs with the Fourier–Motzkin tab: paste the inequalities there to prove that no separating line exists (Jan 24 P3(b)).

Press the button.

Toolbox — chapters 1–8

For the perceptron add a label: 1, 1, -1.

Use & for ∧, | for ∨, ~ for ¬, >> for ⇒.

From past exams

Pick a tool and press Run.

Syllabus index

Every result imo_solver can cite, with the statement as it appears in the notes and a note on how it is used in exam answers.