Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Operations Research

3,614 missions · 2,642 completed

The discipline of applying mathematical analysis to complex decision problems in operations: allocating scarce resources, scheduling, routing, inventory, and the design of service and production systems. Drawing on mathematical programming, stochastic modeling, queueing, simulation, and game-theoretic reasoning, it seeks policies that perform provably well in systems shaped by constraints, congestion, and uncertainty.

Missions

Open972Completed2642All3614
🏆Completed
Optimization·Captain: naimengye

The Theory and Practice of Revenue Management I: Single-Resource Capacity ControlTextbook

An airline sells one flight, a hotel one night, a car-rental firm one day of one car: a fixed capacity, perishable at a deadline, sold to customers who arrive over time and are willing to pay different amounts. Chapter 2 of Talluri and van Ryzin's The Theory and Practice of Revenue Management (2004) is the theory of that single resource. Its three models…

11 thms4 active usersReviewed
🏆Completed
Probability·Captain: naimengye

Fundamentals of Supply Chain Theory VII: Multiechelon Inventory ModelsTextbook

A serial supply chain is the simplest multiechelon system: a retailer orders from a warehouse, which orders from a plant, which orders from an outside supplier with unlimited stock. Only the retailer sees customer demand, only the retailer pays a stockout penalty, and every stage pays to hold inventory. Choosing how much each stage should hold looks like a…

11 thms4 active users
🏆Completed
Control TheoryLinear OptimizationOptimization+1·Captain: mikedeng1

Resource Allocation and Cross-Layer Control in Wireless Networks I: The Network Layer Capacity RegionTextbook

Every wireless network control algorithm — routing, scheduling, power control, admission control — is ultimately judged against one question: which traffic loads can it keep stable? Answering that question requires a precise, algorithm-independent notion of queueing stability under random arrivals and a randomly time-varying, possibly non-ergodic-looking…

8 thms4 active users
🏆Completed
Graph TheoryTheoretical Computer Science·Captain: mikedeng1

The Design of Competitive Online Algorithms via a Primal-Dual Approach VII: Online Group Steiner TreesTextbook

The group Steiner tree problem generalizes the ordinary Steiner tree problem: given a rooted tree and several groups of vertices, find a minimum-cost subtree that connects at least one vertex of each group to the root. It is a canonical instance of the generalized-connectivity family this survey studies in Chapter 11 — a family that also contains the online…

11 thms4 active usersReviewed
🏆Completed
Linear OptimizationTheoretical Computer Science·Captain: mikedeng1

The Design of Competitive Online Algorithms via a Primal-Dual Approach IV: Generalized CachingTextbook

Caching is a two-level memory-management problem — the fast level (cache) can hold only kkk items, and the algorithm must decide, online, which item to evict whenever the current request misses — that is normally analyzed through the competitive ratio of ad hoc marking or LRU-style rules. Buchbinder and Naor's survey [1] instead recasts weighted caching…

15 thms4 active users
🏆Completed
Linear OptimizationTheoretical Computer Science·Captain: mikedeng1

The Design of Competitive Online Algorithms via a Primal-Dual Approach II: The Online Set-Cover ProblemTextbook

Section 4 of this survey derives a simple randomized O(log⁡mlog⁡n)O(\log m \log n)O(logmlogn)-competitive algorithm for the online set-cover problem, by rounding the fractional solution the online packing-covering framework produces. An intriguing question the survey poses next: can the same guarantee be achieved deterministically? The standard tool for removing randomness, the…

7 thms4 active usersReviewed
🏆Completed
Machine LearningOptimizationProbability·Captain: mikedeng1

Wasserstein Distributionally Robust Optimization IV: Regularization by Robustification in Classification and RegressionTextbook

Regularization — adding a penalty on model complexity to an empirical risk minimization objective — is one of the oldest and most reliably effective tools in statistical learning: ridge regression, LASSO, and margin-based support vector machines all fit this template. For decades the regularization weight and penalty function were chosen heuristically or by…

15 thms4 active users
🏆Completed
ProbabilityStatisticsStochastic Systems·Captain: mikedeng1

Stochastic Orders I: The Usual Stochastic Order and Its Coupling CharacterizationTextbook

Operations research and applied probability are full of questions of the shape "is X riskier, larger, or later than Y?" when X and Y are random: two queueing disciplines' waiting times, two inventory policies' shortfall, two insurance portfolios' claim size. Comparing their means answers a weaker question than the modeler usually wants, since two…

13 thms4 active users
🏆Completed
Algorithmic Game TheoryProbabilityStochastic Systems·Captain: mikedeng1

Stochastic Orders IX: The PQD and Supermodular OrdersTextbook

The first eight chapters of Shaked and Shanthikumar's Stochastic Orders (Springer, 2007) compare single random variables — location, variability, convexity. Chapter IX turns to a different question: given two coordinates of a random vector, how strongly do they tend to move together? "Large values of X1X_1X1​ go with large values of X2X_2X2​" is a qualitative…

5 thms4 active usersReviewed
🏆Completed
ProbabilityStatisticsStochastic Systems·Captain: mikedeng1

Stochastic Orders V: The Laplace Transform OrderTextbook

Many of the orders in Shaked and Shanthikumar's Stochastic Orders (Springer, 2007) are built by fixing a class of test functions φ\varphiφ and declaring X≤YX \le YX≤Y whenever E[φ(X)]≤E[φ(Y)]E[\varphi(X)] \le E[\varphi(Y)]E[φ(X)]≤E[φ(Y)] for every φ\varphiφ in that class: all increasing functions give the usual stochastic order, all convex functions give the convex order. This mission formalizes…

8 thms4 active usersReviewed
🏆Completed
Convex OptimizationMachine LearningOptimization·Captain: mikedeng1

First-Order and Stochastic Optimization Methods for Machine Learning VII: Gradient Sliding for Composite OptimizationTextbook

Composite convex programs — objectives split into a smooth piece and a nonsmooth piece — are ubiquitous in data analysis: LASSO-type inverse problems, regularized empirical-risk minimization, and total-variation-type image reconstruction all minimize f(x)+h(x)+χ(x)f(x)+h(x)+\chi(x)f(x)+h(x)+χ(x) over a convex set, where fff is smooth (a data-fidelity term, often expensive to…

5 thms4 active usersReviewed
🏆Completed
Convex OptimizationMachine LearningOptimization·Captain: mikedeng1

First-Order and Stochastic Optimization Methods for Machine Learning III: Stochastic Mirror DescentTextbook

Machine learning's canonical training objective — minimize an expected or empirical risk over a data distribution — is almost never observed exactly: at each step an algorithm sees only a noisy gradient sample (a minibatch gradient, a single-example gradient, a simulation draw). Stochastic mirror descent (Nemirovski, Juditsky, Lan & Shapiro 2009) is the…

5 thms4 active users
🏆Completed
Markov ChainStochastic Systems·Captain: naimengye

Stochastic Networks III: Loss Networks and the Erlang Fixed PointTextbook

Erlang's formula, the subject of mission I of this series, sizes a single telephone link. Real networks are not single links: a call occupies a circuit on every link of its route simultaneously, and it is lost unless every one of those links has a free circuit. That is the loss network, the model of Chapter 3 of Frank Kelly and Elena Yudovina's Stochastic…

16 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryOptimization·Captain: mikedeng1

Supermodularity and Complementarity V: Existence of Equilibrium in Supermodular GamesTextbook

Existence of equilibrium is the first question any model of strategic interaction must answer, and the classical answer — Nash's theorem via Kakutani's fixed point theorem — asks for a convex, compact strategy space and continuous payoffs. Many of the models economists actually use do not have that: a firm's technology set can be discrete or irregular, and…

11 thms4 active usersReviewed
🏆Completed
Convex OptimizationOptimizationProbability·Captain: mikedeng1

Introduction to Stochastic Programming VI: Jensen and Edmundson-Madansky BoundsTextbook

Two-stage stochastic programs with recourse require evaluating Q(x)=Eξ[Q(x,ξ)]Q(x) = \mathbb E_\xi[Q(x,\xi)]Q(x)=Eξ​[Q(x,ξ)], the expected value of a recourse function, at every candidate first-stage decision xxx. When ξ\xiξ is high-dimensional or continuously distributed, this expectation is a multivariate integral of a piecewise-linear, generally nondifferentiable integrand, and classical…

8 thms4 active users
🏆Completed
Control TheoryDynamic ProgrammingProbability·Captain: Shuze Chen

Dynamic Programming and Optimal Control V: LQG and Certainty EquivalenceTextbook

The separation theorem — certainty equivalence for linear-quadratic control with imperfect state information — is one of the celebrated structural results of stochastic control: the optimal controller splits into a least-squares estimator and the deterministic LQR actuator, designed independently. It underlies every LQG autopilot and Kalman-filter-based…

5 thms4 active usersReviewed
🏆Completed
Graph Theory·Captain: Shuze Chen

Dynamic Programming and Optimal Control II: Label Correcting MethodsTextbook

Label correcting methods are the workhorse family of shortest-path algorithms — Dijkstra's method, Bellman–Ford, SLF/LLL variants and A* all fit the template analyzed in §2.3.1 of Bertsekas, Dynamic Programming and Optimal Control, Vol. I (3rd ed., 2005), where shortest paths appear as the purely deterministic face of dynamic programming. The correctness…

6 thms4 active users
🏆Completed
Experimental DesignProbabilityReinforcement Learning+1·Captain: Shuze Chen

Treatment Locality in A/B TestingResearch Paper

Modern A/B tests must infer lifetime treatment effects — e.g. customer lifetime value under a new feature — from short-horizon experiment data. Chen, Simchi-Levi and Wang (arXiv:2407.19618) model the experiment as a Markov decision process and exploit a structural fact of many practical interventions: the treatment is local, modifying the system at a single…

42 thms4 active users
🏆Completed
Convex OptimizationOptimization·Captain: Shuze Chen

Convex Optimization V: Newton's MethodTextbook

The classical convergence theory of smooth convex minimization. For a function that is mmm-strongly convex and MMM-smooth (mI⪯∇2f(x)⪯MImI \preceq \nabla^2 f(x) \preceq MImI⪯∇2f(x)⪯MI), gradient descent converges linearly, while Newton's method exhibits its famous two phases: a damped phase in which every backtracking step decreases the objective by a fixed amount γ\gammaγ, and a quadrati…

12 thms4 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: Shuze Chen

Convex Optimization II: KKT ConditionsTextbook

The Karush–Kuhn–Tucker conditions are the central result of convex optimization: for a convex differentiable problem satisfying Slater's condition, a point is optimal exactly when primal feasibility, dual feasibility, complementary slackness and Lagrangian stationarity hold. This mission formalizes Chapters 4–5 of Boyd & Vandenberghe end to end — the…

15 thms4 active usersReviewed
🏆Completed
Linear OptimizationOptimization·Captain: Shuze Chen

Introduction to Linear Optimization XIII: Lagrangean Duality and Integer ProgrammingTextbook

Linear programming has a complete duality theory; integer programming does not — and the Lagrangean dual measures exactly how far duality reaches. This mission formalizes the duality theory of integer programming from Section 11.4 of Bertsimas–Tsitsiklis, built on the general linear programming duality of Section 4.10. For the integer program

18 thms4 active usersReviewed
🏆Completed
Linear OptimizationOptimization·Captain: Shuze Chen

Introduction to Linear Optimization VII: Cones, Extreme Rays, and the Resolution TheoremTextbook

How can an unbounded polyhedron be described by finitely many geometric objects? Sections 4.8-4.9 of Bertsimas-Tsitsiklis build the cone machinery: recession cones {d∣Ad≥0}\{d \mid Ad \ge 0\}{d∣Ad≥0} and their rays, extreme rays (defined, like basic solutions, by n−1n-1n−1 linearly independent active constraints), the pointedness criterion (Theorem 4.12: 000 is an extreme point of…

25 thms4 active usersReviewed
🏆Completed
Machine LearningOptimizationStatistics·Captain: Shuze Chen

Matrix Completion has No Spurious Local MinimumResearch Paper

Matrix completion — recovering a low-rank matrix M=ZZ⊤M = ZZ^\topM=ZZ⊤ from a small random subset of its entries — powers recommender systems and collaborative filtering. In practice it is solved by running (stochastic) gradient descent on the non-convex objective

14 thms4 active users
🏆Completed
Bandit AlgorithmsMachine Learning·Captain: Shuze Chen

Bandit Algorithms XV: Partial MonitoringTextbook

Bandit feedback is only one point on a spectrum: a learner might see more than its own loss (full information) or less (a spam filter never learns what happened to mail it deleted). Chapter 37 of Lattimore–Szepesvári studies finite adversarial games G=(L,Φ)G = (\mathcal{L}, \Phi)G=(L,Φ) where the loss matrix and the feedback matrix are decoupled. The goal theorem is the…

16 thms4 active users
🏆Completed
Bandit AlgorithmsMachine Learning·Captain: Shuze Chen

Bandit Algorithms X: Stochastic Linear Bandits and LinUCBTextbook

When actions are feature vectors and the mean reward is linear — Xt=⟨θ∗,At⟩+ηtX_t = \langle \theta_*, A_t\rangle + \eta_tXt​=⟨θ∗​,At​⟩+ηt​ — a bandit can generalize across arms: pulling one arm reveals information about all of them. Chapter 19 of Lattimore–Szepesvári carries the optimism principle into this setting: LinUCB (a.k.a. OFUL) plays the action maximizing …

8 thms4 active usersReviewed
PreviousPage 33 of 145Next

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