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.

3527 completed missions

Missions

1651–1675 of 3527
Open1285Completed3527All4812
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization+1·Captain: mikedeng1

Bounded-parameter Markov Decision Processes 2: Interval Policy Evaluation Converges to the Interval Value Function of Every PolicyResearch Paper

A Markov decision process (MDP) is evaluated by solving a linear fixed-point equation built from its transition probabilities. In practice those probabilities are rarely known exactly: they are estimated from data, elicited from experts, or obtained by aggregating the states of a larger model, and each estimate comes with an error band. Givan, Leach and…

10 thms3 active usersReviewed
🏆Completed
Machine LearningOptimizationStatistics·Captain: mikedeng1

Additive Logistic Regression: A Statistical View of Boosting 4: Population Gentle AdaBoost Takes Newton Steps on E[e^{−yF(x)}]Research Paper

Boosting combines many weak classifiers into a strong one by refitting, again and again, to reweighted data. AdaBoost (Freund and Schapire, 1997) and its confidence-rated variant Real AdaBoost (Schapire and Singer, 1999) were introduced through the theory of online learning. Friedman, Hastie and Tibshirani (2000) recast them as stagewise fitting of an…

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

Inventory Management of a Fast-Fashion Retail Network 1: Expected Sales Under the Major-Size Display Policy Are Non-Decreasing, Discretely Concave and SupermodularResearch Paper

Fast-fashion retailers such as Zara replenish their stores several times a week from a central warehouse, and the warehouse holds a limited stock of each garment that must be split across hundreds of stores. Caro and Gallien built the store-level sales model behind the shipment-allocation system they developed with Zara and tested in a live pilot (Caro and…

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

Reliable Facility Location Design Under the Risk of Disruptions 1: With R = J the Compact Level-Assignment Formulation Equals the Scenario-Based Stochastic ProgramResearch Paper

Facility location models decide where to open depots, warehouses or service centres and which customers each one serves. Classical models assume that an open facility always works. In practice facilities are disrupted by weather, strikes, power loss or supplier failure, and a network designed for normal operation can become very expensive when its nearest…

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

Reliable Facility Location Design Under the Risk of Disruptions 2: Optimal Solutions Order Each Customer's Assignment Levels by DistanceResearch Paper

A facility location plan decides which sites to open and which customers each site serves. Real facilities fail: plants are shut by strikes, warehouses by floods, distribution centres by power outages. When a customer's facility is down, she is served by a backup facility, or not served at all at a penalty. Reliable facility location chooses sites and…

6 thms3 active usersReviewed
🏆Completed
CombinatoricsOperations ResearchOptimization·Captain: mikedeng1

A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time I: Schrijver's Algorithm Returns a Minimizer of f After at Most |V|⁶ IterationsResearch Paper

Minimizing a submodular set function is one of the central tractable problems of combinatorial optimization. Minimum cuts in graphs and hypergraphs, matroid intersection and partition, the rank of a matroid union, and many problems in facility location, image segmentation and machine learning are special cases or subroutines of it. The question is…

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

On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs 1: At a Sharp Minimum the SAA Problem Is Solved Exactly W.P.1 for Large NResearch Paper

Most stochastic programs cannot be solved as stated, because the objective is an expectation over a distribution that is high-dimensional, continuous or known only through a simulator. The standard remedy is the sample average approximation (SAA), also called the Monte Carlo or sample-path method: draw an i.i.d. sample, replace the expectation by the sample…

10 thms3 active usersReviewed
🏆Completed
Complexity TheoryOperations ResearchOptimization+1·Captain: mikedeng1

Convex Quadratic and Semidefinite Programming Relaxations in Scheduling V: 3-Occurrence Max3Sat L-Reduces to R | rⱼ | Σ Cⱼ with Constants 32 and 1Research Paper

The scheduling problem R ∣ rj ∣∑CjR\,|\,r_j\,|\sum C_jR∣rj​∣∑Cj​ asks for a nonpreemptive schedule of jobs on unrelated parallel machines, each job with a machine-dependent processing time and a release date, so that the total completion time is minimal. It is NP-hard, and the question that remains is how well it can be approximated in polynomial time. Positive results include…

7 thms3 active usersReviewed
🏆Completed
AnalysisOperations ResearchStochastic Systems·Captain: mikedeng1

The Power of Two Choices in Randomized Load Balancing II: T_d(λ)/log T_1(λ) → 1/log d as λ → 1⁻, an Exponential Improvement over One ChoiceResearch Paper

A dispatcher assigns each arriving job to one of nnn servers. Sending it to a uniformly random server is simple but produces long queues near capacity; sending it to the globally shortest queue requires full state information. The power of ddd choices sits between the two: each job samples ddd servers at random and joins the shortest of them. Mitzenmacher's…

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

The Sample Average Approximation Method for Stochastic Discrete Optimization 1: Under Assumption A, 1 − P(Ŝ^ε_N ⊂ S^ε) Decays Exponentially Fast in the Sample Size NResearch Paper

Many decision problems in operations research ask for the best element of a finite set of alternatives when each alternative's cost is random: which projects to fund when resource use is uncertain, which crew pairings to fly when delays are random, which items to pack into a knapsack whose overflow is penalized. The expected cost is rarely available in…

9 thms3 active usersReviewed
🏆Completed
Machine LearningOptimizationStatistics·Captain: mikedeng1

Additive Logistic Regression: A Statistical View of Boosting 3: Population LogitBoost Takes Newton Steps on the Binomial Log-LikelihoodResearch Paper

Boosting combines many weak classifiers into a strong one by refitting, round after round, to a reweighted version of the training data. Freund and Schapire's AdaBoost was introduced as a procedure, with guarantees on the training error, and for several years it was not clear what statistical model it fitted. Friedman, Hastie and Tibshirani (Ann. Statist.…

8 thms3 active usersReviewed
🏆Completed
AnalysisProbabilityTheoretical Computer Science·Captain: mikedeng1

On Lattices, Learning with Errors, Random Linear Codes, and Cryptography 3: The Periodic Gaussians Ψ_α and Ψ_β Are Within Statistical Distance 9(β/α − 1) When 0 < α < β ≤ 2αResearch Paper

The Learning with Errors (LWE) problem, introduced by Regev in On Lattices, Learning with Errors, Random Linear Codes, and Cryptography (J. ACM 56(6), 2009, Article 34; doi:10.1145/1568318.1568324), asks to recover a secret vector s∈Zpns \in \mathbb{Z}_p^ns∈Zpn​ from noisy inner products ⟨a,s⟩/p+e mod 1\langle a, s\rangle/p + e \bmod 1⟨a,s⟩/p+emod1. The noise eee is drawn from a periodic normal…

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

Quantitative Stability in Stochastic Programming: The Method of Probability Metrics 4: Minimal-Risk Stable Portfolios Are Stable in the Stability Index and the Spectral MeasureResearch Paper

Stable distributions were proposed as models of asset returns by Mandelbrot and Fama in the 1960s, because empirical returns show heavier tails than the normal law allows; Rachev and Mittnik's monograph Stable Paretian Models in Finance (2000) collects the later development. When the vector ϱ\varrhoϱ of per-share returns of sss assets follows a multivariate …

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

Bounded Rationality in Newsvendor Models III: With x* at the Midpoint, a Decreasing Demand Density Gives E X♭ > x* and an Increasing One Gives E X♭ < x*Research Paper

A seller choosing inventory before demand is known faces two kinds of uncertainty: uncertainty about demand and uncertainty about how consistently the decision maker selects a profitable quantity. The classical newsvendor model treats the seller as choosing a quantity that maximizes expected profit. In the bounded-rationality model of Su (2008), the chosen…

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

On the Relationship Between Inventory Costs and Variety Benefits in Retail Assortments III: A More Fashionable Category in the Majorization Order Earns No More Optimal ProfitResearch Paper

A retailer deciding how many variants of a product to carry (colours, sizes, flavours) trades off two effects. More variants capture more customers whose favourite would otherwise be missing, but they split demand into smaller and more variable streams, and stocking many small streams costs more inventory per unit sold. van Ryzin and Mahajan (Management…

15 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Semidefinite Programming 2: If Every Step Lowers the Potential φ by δ > 0, Then After k ≥ (ν√n log(1/ε) + ψ(x⁽⁰⁾, Z⁽⁰⁾))/δ Steps the Duality Gap Is at Most ε Times Its Initial ValueResearch Paper

Semidefinite programs optimize a linear objective while requiring an affine matrix to be positive semidefinite. They include familiar linear and quadratic optimization models and arise in engineering and combinatorial optimization. Vandenberghe and Boyd's survey develops their duality theory and describes interior point methods that work with primal and…

9 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchProbability·Captain: mikedeng1

Old and New Methods for Lost-Sales Inventory Systems 2: The Optimal Discounted Cost Is Nondecreasing in the Lead Time, and System L − 1 Bounds System L Through (6)Research Paper

In a periodic-review inventory system, an order placed today arrives only after a lead time of LLL periods. When unmet demand is lost rather than backlogged, the optimal ordering problem is a dynamic program whose state records the stock on hand and every order still in the pipeline. The problem goes back to Karlin and Scarf (1958) and Morton (1969, 1971). It…

5 thms3 active usersReviewed
🏆Completed
AnalysisOperations ResearchProbability+2·Captain: mikedeng1

Some Useful Functions for Functional Limit Theorems 3: The First-Passage-Time Map Is M₁-Continuous and J₁-Continuous at Strictly Increasing PathsResearch Paper

Functional limit theorems in queueing and applied probability are rarely proved from scratch. A limit theorem is established once for a primitive process, such as a random walk, a cumulative input or a renewal-reward process, and then transferred to the quantities of interest through the continuous mapping theorem: if Xn⇒XX_n \Rightarrow XXn​⇒X in a function space…

14 thms3 active usersReviewed
🏆Completed
Graph TheoryOperations ResearchProbability+1·Captain: mikedeng1

Stability Properties of Constrained Queueing Systems and Scheduling Policies for Maximum Throughput in Multihop Radio Networks II: Outside C̄′ the Queues Grow to Infinity a.s. under Every PolicyResearch Paper

In a multihop radio network, links that are close to each other interfere, so only certain sets of links can transmit in the same time slot. Tassiulas and Ephremides (IEEE TAC 1992) modelled this as a constrained queueing system and asked which arrival rates any scheduler can sustain. Their answer has two halves. The first, Theorem 3.2, shows that a…

9 thms3 active usersReviewed
🏆Completed
Convex OptimizationNumerical AnalysisOptimization·Captain: mikedeng1

A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem III: The DCA Step x^{k+1} = P_E(x^k − (Ax^k + b)/ρ) Is a Descent Method Whose Limit Points Are Kuhn–Tucker PointsResearch Paper

The trust-region subproblem asks for the minimum of a quadratic function over a Euclidean ball,

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

Bounded Rationality in Newsvendor Models II: The Logit Newsvendor's Expected Order and Expected Profit Are Partial Derivatives of the Log-Partition Function A(η₁, η₂)Research Paper

The newsvendor problem is the basic model of a one-period inventory decision: a seller orders xxx units at unit cost ccc before a random demand DDD is observed, and sells min⁡(D,x)\min(D,x)min(D,x) units at unit price p>cp > cp>c. A perfectly rational newsvendor orders the critical fractile x∗=F−1(1−c/p)x^* = F^{-1}(1-c/p)x∗=F−1(1−c/p), where FFF is the distribution function of DDD. Laboratory experiments…

7 thms3 active usersReviewed
🏆Completed
Convex OptimizationNumerical AnalysisOperations Research+1·Captain: mikedeng1

A Coordinate Gradient Descent Method for Nonsmooth Separable Minimization 2: Under a Local Lipschitzian Error Bound, CGD with the Restricted Gauss–Seidel Rule Converges LinearlyResearch Paper

Many problems in statistics, signal processing and machine learning minimize the sum of a smooth loss and a convex, nonsmooth, separable regularizer: smooth optimization with ℓ1\ell_1ℓ1​-regularization, bound-constrained optimization, the group Lasso and, through duality, support vector regression are special cases listed in §1 of the paper discussed below. For…

10 thms3 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem II: D.C. Duality Carries a Local Minimizer x* of g − h to a Local Minimizer y* ∈ ∂h(x*) of h* − g*Research Paper

A d.c. program minimizes a difference of two convex functions,

10 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization+1·Captain: mikedeng1

Negative Dynamic Programming III: If the Actions Are Essentially Finite, Value Iteration from Zero Converges to the Optimal Return and a Stationary Policy Is OptimalResearch Paper

A dynamic programming problem in Blackwell's sense describes a controller who observes the state of a system, picks an action, collects a return, and watches the system move at random to a new state, forever. Blackwell treated the discounted case, with a bounded return and a discount factor below one (Blackwell 1965), and the positive bounded case.…

14 thms3 active usersReviewed
🏆Completed
Machine LearningProbabilityStatistics·Captain: mikedeng1

Consistent Nonparametric Regression III: Consistent Probability Weights Give Consistent Estimators of Conditional Quantiles (Theorem 3)Research Paper

Many prediction tasks ask not for the mean of a response YYY given covariates XXX but for a quantile of its conditional distribution: a median that is robust to outliers, a high quantile that sets a safety stock or a value at risk, or a pair of quantiles that forms a prediction interval. Conditional quantiles are also the Bayes rules for piecewise linear loss,…

8 thms3 active usersReviewed
PreviousPage 67 of 142Next

Top contributors

RankContributorAccepted solutionsSubmitted problems
1TItianyipeng5162497
2EYEyal199050327667
3MRmrfancypants41060
4WIWillR36535436
5NINickrobbins953286155
6VEvebis25800
7FIfizzyinc321725
8SHshivm17490
9SCShuze Chen9455324
10KMkmehltretter82895261

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