Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Collections

The OR Formalization Drive

A coordinated effort to formalize the mathematics of operations research in Lean 4.

Scope: missions in linear and integer programming, convex and nonlinear optimization, combinatorial optimization, dynamic programming, scheduling, stochastic models such as queueing and inventory, simulation, revenue management, and game theory and mechanism design.

3565 completed missions

Missions

2301–2325 of 3565
Open1247Completed3565All4812
🏆Completed
Operations ResearchProbabilityStatistics+1·Captain: mikedeng1

Stochastic Orders III: The Convex Order and Strassen's Martingale CouplingTextbook

Chapter I's usual stochastic order compares "how large" two random variables tend to be. A different, equally common question in operations research is "how spread out" a random variable is: two portfolios with the same expected loss can differ sharply in how much that loss varies, and a risk-averse decision maker or a convex cost function cares about…

6 thms3 active usersReviewed
🏆Completed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Stochastic Orders II: The Mean Residual Life OrderTextbook

A device's mean residual life at age ttt — its conditional expected remaining lifetime given that it has survived to ttt — is one of the oldest and most interpretable summaries in reliability and survival analysis: it is what an insurer, a maintenance planner, or a hospital outcomes researcher actually wants to know about a unit still in service. Comparing two…

7 thms3 active usersReviewed
🏆Completed
Convex OptimizationMachine LearningOptimization·Captain: mikedeng1

Introduction to Online Convex Optimization V: RFTL and the Regret Bound of Follow-the-Regularized-LeaderTextbook

Online convex optimization (OCO) asks a learner to repeatedly pick a point in a convex set KKK, pay a cost that an adversary reveals only after the choice is made, and be judged against the best fixed point in hindsight. Chapter III of this series formalized the simplest general-purpose answer, online gradient descent (OGD): take a gradient step, project back…

6 thms3 active users
🏆Completed
Convex OptimizationOperations ResearchOptimization+1·Captain: mikedeng1

Introduction to Stochastic Programming VIII: Multistage Jensen Bounds and AggregationTextbook

A multistage stochastic program's exact deterministic equivalent grows exponentially with the number of periods, even when each period's random data takes only a handful of values (Chapter 9's concern was the growth in the number of realizations; Chapter 10 adds growth in the number of periods). One remedy, generalizing Chapter 8's single-period Jensen…

4 thms3 active users
🏆Completed
Convex OptimizationLinear OptimizationOperations Research+2·Captain: mikedeng1

Introduction to Stochastic Programming III: The L-Shaped Method and Its Finite ConvergenceTextbook

Two-stage stochastic programs with recourse — choose a first-stage decision xxx now, observe a random outcome ξ\xiξ, then choose a second-stage recourse decision y(ξ)y(\xi)y(ξ) to repair whatever xxx left infeasible or suboptimal — are the workhorse model of the field, used for capacity planning, inventory and financial portfolio problems since the 1950s (Dantzig 1955;…

6 thms3 active users
🏆Completed
Algorithmic Game TheoryOperations ResearchOptimization·Captain: naimengye

Stochastic Networks IV: Decentralized Optimization and Wardrop EquilibriaTextbook

A network of resistors solves an optimization problem. Nobody tells the electrons what to do; each one moves under a purely local rule, and the current distribution that emerges minimizes energy dissipation over all distributions satisfying Kirchhoff's node law. Add a wire and the network can only become easier to traverse. This is the encouraging case, and…

11 thms3 active usersReviewed
🏆Completed
Markov ChainOperations ResearchStochastic Systems·Captain: naimengye

Stochastic Networks II: Migration Processes and Product FormTextbook

A queueing network is a collection of service stations through which customers — jobs, packets, telephone calls, patients — move one at a time. The state of such a network is a vector of occupancy counts, one per station, and the number of states grows exponentially in the number of stations, so solving the equilibrium equations directly is hopeless for any…

11 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Supermodularity and Complementarity II: Topkis's Monotonicity Theorem for Parameterized OptimizationTextbook

A recurring question in economics and operations research is: when a decision problem depends on a parameter, does the optimal decision move monotonically as the parameter changes? A firm's optimal input mix as a price rises, a consumer's optimal consumption bundle as income grows, a Cournot firm's optimal output as a rival's output changes — in each case…

7 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimizationProbability·Captain: mikedeng1

Introduction to Stochastic Programming II: The Value of Perfect Information and of the Stochastic SolutionTextbook

Every stochastic program is, in practice, compared against a shortcut. A decision maker facing genuine uncertainty is tempted either to replace the random data by its mean and solve one deterministic problem, or to imagine that perfect information about the future were available and solve a separate deterministic problem per scenario. Both temptations have…

8 thms3 active usersReviewed
🏆Completed
CombinatoricsMechanism Design·Captain: Shuze Chen

Algorithmic Game Theory V: Stable Matching and Trading without MoneyTextbook

When money is off the table and the Gibbard–Satterthwaite theorem (Mission III of this series) blocks general strategyproof choice, restricted preference domains reopen the door. The two great examples both come from allocation: Shapley–Scarf's housing market (1974), where Gale's Top Trading Cycle algorithm finds the unique core allocation and Roth (1982)…

9 thms3 active usersReviewed
🏆Completed
Mechanism DesignTheoretical Computer Science·Captain: Shuze Chen

Algorithmic Game Theory IV: VCG and the Limits of TruthfulnessTextbook

Mission III of this series ends at an impossibility: without money, incentive compatibility over three or more alternatives means dictatorship. This mission formalizes the classical escape route — quasilinear utilities and payments — and the exact price of it. Vickrey (1961) discovered that a second-price auction makes truth-telling dominant; Clarke (1971)…

6 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization+1·Captain: Shuze Chen

Dynamic Programming and Optimal Control VII: Infinite Horizon ProblemsTextbook

Infinite-horizon dynamic programming is the mathematical core of Markov decision processes and reinforcement learning: Bellman equations, value iteration, policy iteration, and their guarantees. Chapter 7 of Bertsekas, Dynamic Programming and Optimal Control, Vol. I (3rd ed., 2005) develops the finite-state theory in its cleanest generality — stochastic…

8 thms3 active usersReviewed
🏆Completed
Convex OptimizationFunctional AnalysisOptimization·Captain: wenxinzhang

Vector Space Methods V: Convex Separation and Distance DualityTextbook

Linear approximation is only one instance of distance minimization. Feasible sets in optimization are typically convex rather than subspaces, so a useful certificate must compare a target point with an entire convex set and must allow an affine offset. Chapter 5 of Luenberger's Optimization by Vector Space Methods builds this certificate through geometric…

6 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: wenxinzhang

Vector Space Methods IX: Global Lagrange DualityTextbook

Many convex programs impose inequalities valued in a vector space: componentwise inequalities, positive-semidefinite constraints, and families of ordered resource constraints are all instances of one cone order. Chapter 8 of David G. Luenberger's Optimization by Vector Space Methods develops a global theory for this setting. A perturbation of the constraint…

14 thms3 active usersReviewed
🏆Completed
Convex OptimizationFunctional Analysis·Captain: wenxinzhang

Vector Space Methods VIII: Fenchel DualityTextbook

Convex duality converts an optimization problem over points into one over linear functionals. It supplies lower bounds, certificates of optimality, and alternative formulations whose geometry can be simpler than the primal problem. In §§7.8–7.12 of David G. Luenberger's Optimization by Vector Space Methods, this theory is developed for finite-valued convex…

7 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: Shuze Chen

Convex Optimization IV: Löwner–John EllipsoidsTextbook

Every full-dimensional convex body is sandwiched between an ellipsoid and its nnn-fold dilation: shrinking the minimum-volume covering (Löwner–John) ellipsoid E\mathcal{E}E about its centre x0x_0x0​ by the factor 1/n1/n1/n lands inside the body,

8 thms3 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: Shuze Chen

Introduction to Linear Optimization XII: Interior Point Methods and Path FollowingTextbook

Interior point methods solve linear programs by moving through the interior of the feasible set instead of along its edges — the approach that turned Karmarkar's 1984 breakthrough into today's practical large-scale solvers. This mission formalizes the primal path following algorithm of Chapter 9 of Bertsimas–Tsitsiklis. For μ>0\mu > 0μ>0 the logarithmic barrier

9 thms3 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: Shuze Chen

Introduction to Linear Optimization XI: The Ellipsoid MethodTextbook

Can the feasibility of a system of linear inequalities be decided in a provably small number of iterations? The ellipsoid method — the algorithm with which Khachiyan showed in 1979 that linear programming is polynomially solvable — answers this with pure convex geometry. This mission formalizes Chapter 8 of Bertsimas–Tsitsiklis. An ellipsoid is

14 thms3 active usersReviewed
🏆Completed
Linear OptimizationOptimization·Captain: Shuze Chen

Introduction to Linear Optimization IX: Network Flow IntegralityTextbook

Why do network linear programs return integer answers for free? This mission formalizes the structural theory of the minimum cost network flow problem of Chapter 7 of Bertsimas & Tsitsiklis: a directed graph G=(N,A)G=(\mathcal{N},\mathcal{A})G=(N,A) with external supplies bib_ibi​, arc costs cijc_{ij}cij​, and the node-arc incidence matrix A\mathbf{A}A — an n×mn\times mn×m matrix in which…

18 thms3 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: Shuze Chen

Introduction to Linear Optimization VIII: Sensitivity Analysis and Subgradients of the Optimal CostTextbook

How does the optimal cost of a linear program respond when the problem data change? Chapter 5 of Bertsimas-Tsitsiklis studies the standard form problem min⁡{c′x∣Ax=b, x≥0}\min\{c'x \mid Ax = b,\ x \ge 0\}min{c′x∣Ax=b, x≥0} (rows of AAA linearly independent) as the requirement vector bbb and the cost vector ccc vary. On the convex set S={b∣P(b)≠∅}S = \{b \mid P(b) \neq \emptyset\}S={b∣P(b)=∅} of feasible right-hand sides,…

11 thms3 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: Shuze Chen

Introduction to Linear Optimization V: Duality TheoryTextbook

Every linear programming problem has a shadow. To the primal min⁡c′x\min c'xminc′x we associate the dual max⁡p′b\max p'bmaxp′b, whose variables price the primal constraints: one dual variable per primal constraint and one dual constraint per primal variable, with signs governed by the correspondence of Table 4.1. This mission formalizes §4.1–4.5 of Bertsimas–Tsitsiklis: the dual of…

12 thms3 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: Shuze Chen

Introduction to Linear Optimization IV: The Simplex MethodTextbook

How does one actually solve a linear program? Chapter 2 showed that if a standard-form problem min⁡c′x\min c'xminc′x subject to Ax=bAx = bAx=b, x≥0x \ge 0x≥0 has an optimal solution, it has an optimal basic feasible solution; the simplex method searches among basic feasible solutions, moving along edges of the feasible set in cost-reducing directions. This mission formalizes the…

16 thms3 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchOptimization·Captain: Shuze Chen

Introduction to Linear Optimization I: Polyhedra and Basic Feasible SolutionsTextbook

Every linear programming problem asks to minimize a linear cost c′xc'xc′x over a polyhedron — a set of the form P={x∈Rn∣Ax≥b}P = \{x \in \mathbb{R}^n \mid Ax \ge b\}P={x∈Rn∣Ax≥b}, or in standard form {x∣Ax=b, x≥0}\{x \mid Ax = b,\ x \ge 0\}{x∣Ax=b, x≥0}. Chapter 2 of Bertsimas–Tsitsiklis develops the geometry of these feasible sets, and its central achievement is making the intuitive notion of a "corner point"…

9 thms3 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine LearningOperations Research·Captain: Shuze Chen

Bandit Algorithms I: Concentration of MeasureTextbook

How quickly does the empirical mean of independent random variables concentrate around the true mean? This question is the analytic engine of the entire theory of stochastic bandits: every optimistic algorithm (Explore-Then-Commit, UCB and its relatives) is calibrated by a tail bound on the sample mean. This mission formalizes the subgaussian framework of…

2 thms3 active usersReviewed
🏆Completed
Operations ResearchStochastic Systems·Captain: tianyipeng

Markov Entanglement: Decomposition Error via Agent-wise TV DistanceResearch Paper

Multi-agent reinforcement learning approximates a global value function by summing per-agent local value functions learned independently — a trick that works surprisingly well in practice (ride-hailing dispatch, restless bandits) but had no general theoretical justification. Chen and Peng (arXiv:2506.02385) explain why: they define a Markov entanglement meas…

4 thms3 active usersReviewed
PreviousPage 93 of 143Next

Top contributors

RankContributorAccepted solutionsSubmitted problems
1TItianyipeng5259500
2EYEyal199050327667
3MRmrfancypants41060
4WIWillR36755492
5NINickrobbins953290156
6VEvebis25800
7FIfizzyinc321735
8SHshivm17520
9KMkmehltretter82998263
10SCShuze Chen9455326

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me