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,682 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

Open932Completed2682All3614
🏆Completed
Theoretical Computer Science·Captain: mikedeng1

The Design of Competitive Online Algorithms via a Primal-Dual Approach V: Online RoutingTextbook

Network routing is one of the paradigmatic applications of the online primal-dual method: requests for bandwidth between a source and target arrive one at a time, and the algorithm must commit bandwidth to paths without knowing future requests. Chapter 4 already gave a simple (3, O(log n))-competitive routing algorithm as an illustration of the general…

2 thms2 active usersReviewed
🏆Completed
Theoretical Computer Science·Captain: mikedeng1

The Design of Competitive Online Algorithms via a Primal-Dual Approach III: Metrical Task Systems on a Weighted StarTextbook

The metrical task system (MTS) problem is one of the earliest and most general online models: a server occupies a state in a metric space, requests arrive with per-state service costs, and the server may change state (paying the metric's transition cost) before serving each request. On a general metric, competitive algorithms are hard to design directly.…

6 thms2 active usersReviewed
🏆Completed
ProbabilityStochastic Systems·Captain: mikedeng1

Stochastic Orders VIII: Closure of the Convexity Orders Under Random SumsTextbook

Chapters III and IV formalize what it means for one random variable to be "more spread out" or "larger and more spread out" than another. Chapter VIII asks a different kind of question: if the number of terms in a sum of i.i.d. random variables is itself random, and one count is larger than another in one of these orders, does the resulting random sum…

4 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOptimization·Captain: mikedeng1

Supermodularity and Complementarity VI: The Core of a Convex GameTextbook

A cooperative game with side payments models a set of economic agents who can form coalitions and split the proceeds. The central question is stability: is there a way to split the total payoff among all the players so that no subset of them would do better by breaking away and acting on its own? The set of such stable splits is the core, introduced by…

11 thms2 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Supermodularity and Complementarity III: Assortative Matching under SupermodularityTextbook

Which workers end up at which firms, and does higher quality always land at the more productive employer? This is the question of assortative matching: whether an efficient assignment pairs the best workers with the best firms, the second-best with the second-best, and so on down the line. The question has a long history in labor economics. Becker [1973]…

11 thms2 active usersReviewed
🏆Completed
Linear OptimizationOptimization·Captain: mikedeng1

Introduction to Stochastic Programming V: The Integer L-Shaped MethodTextbook

Two-stage stochastic programs with recourse are already hard to optimize when the recourse problem is a linear program: Chapters 4–6 of this series show how the L-shaped method exploits the recourse function's convexity and polyhedrality to converge finitely by cutting planes. Adding integrality restrictions destroys both properties. Birge and Louveaux open…

6 thms2 active usersReviewed
🏆Completed
Linear OptimizationOptimizationProbability·Captain: mikedeng1

Introduction to Stochastic Programming IV: Nested Decomposition for Multistage ProgramsTextbook

Sequential planning problems — inventory replenishment, hydro-thermal power scheduling, asset-liability management — routinely span more than two decision epochs, with information about the future revealed gradually as each period unfolds. A two-stage recourse model (decide now, observe once, recourse once) is too coarse for these: it either collapses the…

6 thms2 active users
🏆Completed
OptimizationStochastic Systems·Captain: naimengye

Stochastic Networks VIII: Flow Level Models and the Stability of alpha-Fair AllocationsTextbook

Chapter 7 of Frank Kelly and Elena Yudovina's Stochastic Networks (Cambridge University Press, 2014) studies a network with a fixed set of users, and shows that a decentralized rate control converges to a fair allocation. Chapter 8 asks the question one time scale up. Files finish and their flows leave; new files arrive and new flows appear. The number of…

10 thms2 active usersReviewed
🏆Completed
Control TheoryOptimization·Captain: naimengye

Stochastic Networks VII: Internet Congestion Control and the Primal AlgorithmTextbook

When a file is transferred over the Internet, no part of the network decides how fast it should go. The machines inside the network forward packets; when a resource is heavily loaded it drops or marks one; the destination reports that to the source; and the source slows down, then gradually speeds up again until the next signal. This end-to-end cycle of…

8 thms2 active usersReviewed
🏆Completed
ProbabilityStochastic Systems·Captain: naimengye

Stochastic Networks V: Random Access and the Critical Rate of Backoff SchemesTextbook

When many stations share one broadcast channel, something has to decide who transmits. A token passed around the stations works when there are few of them and none is silent for long, but it scales badly and breaks if the token is lost. The alternative is to let stations transmit whenever they like and use randomness to recover from the resulting…

8 thms2 active usersReviewed
🏆Completed
Markov ChainStochastic Systems·Captain: naimengye

Stochastic Networks I: Erlang's Formula for a Single LinkTextbook

In the early twentieth century Agner Krarup Erlang worked for the Copenhagen Telephone Company and faced a sizing question that every shared-resource operator still faces: how many parallel circuits must a telephone link carry so that an arriving call is almost never turned away? The answer he published — the Erlang loss formula — is still the standard…

9 thms2 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Supermodularity and Complementarity I: Lattices and the Tarski-Zhou Fixed Point TheoremTextbook

Many results in economics and operations research reduce to a single question: does a system of interacting, mutually reinforcing choices settle at an equilibrium? A firm choosing input levels that are complements, a Cournot duopoly whose best responses move together, a matching market where agents' preferences reinforce assortative pairings — each is a…

6 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOptimization·Captain: Shuze Chen

Dynamic Programming and Optimal Control VI: Lookahead and RolloutTextbook

When exact dynamic programming is intractable, practice runs on approximations: one-step and multistep lookahead with a cost-to-go surrogate, open-loop feedback control, and rollout — the algorithm that improved backgammon programs and became a conceptual ancestor of Monte-Carlo tree search and modern policy improvement schemes. Chapter 6 of Bertsekas, Dynam…

9 thms2 active usersReviewed
🏆Completed
OptimizationProbability·Captain: Shuze Chen

Dynamic Programming and Optimal Control I: The DP AlgorithmTextbook

Dynamic programming is the backbone of stochastic optimal control, operations research, and reinforcement learning. Its cornerstone — that the backward recursion of Bellman computes the optimal cost of a finite-horizon stochastic control problem — is stated as Proposition 1.3.1 of Bertsekas, Dynamic Programming and Optimal Control, Vol. I (3rd ed., Athena…

5 thms2 active usersReviewed
🏆Completed
Markov ChainStochastic Systems·Captain: tianyipeng

Markov Entanglement: Index Policies for Restless Bandits are Asymptotically SeparableResearch Paper

Restless multi-armed bandits are the standard model for allocating a scarce resource across many independently-evolving agents: N arms, each a small Markov chain, and a budget that lets you activate only a fixed fraction of them at each step. The joint problem is PSPACE-hard, so practice runs on index policies — score each arm by a priority index computed…

12 thms2 active usersReviewed
🏆Completed
Linear OptimizationOptimization·Captain: Shuze Chen

Introduction to Linear Optimization VI: Farkas' Lemma and Separating HyperplanesTextbook

When is a system of linear constraints infeasible? Sections 4.6-4.7 of Bertsimas-Tsitsiklis answer with the archetypal theorem of the alternative. The capstone is Farkas' lemma (Theorem 4.6): for an m×nm \times nm×n matrix AAA and b∈Rmb \in \mathbb{R}^mb∈Rm, exactly one of the following holds — (a) some x≥0x \ge 0x≥0 satisfies Ax=bAx = bAx=b, or (b) some ppp satisfies p′A≥0′p'A \ge 0'p′A≥0′ and …

8 thms2 active usersReviewed
🏆Completed
Algebra·Captain: tianyipeng

Hefferon Linear Algebra I: Gauss's Method and the Solution SetTextbook

Chapter One of Jim Hefferon's Linear Algebra develops Gauss's method and asks what row reduction actually preserves. The answer arrives as the Linear Combination Lemma: row operations change the rows of a matrix but never the subspace those rows span, and that invariant is complete. The goal theorem is that completeness — two matrices are row equivalent…

3 thms2 active usersReviewed
🏆Completed
Linear OptimizationOptimization·Captain: Shuze Chen

Introduction to Linear Optimization II: Existence and Optimality of Extreme PointsTextbook

Where should one look for the optimum of a linear programming problem? Chapter 1 of Bertsimas–Tsitsiklis suggests that optima "tend to occur at corners" of the feasible polyhedron; §§2.5–2.6 turn this intuition into theorems. Not every polyhedron has a corner — a halfspace in Rn\mathbb{R}^nRn (n>1n > 1n>1) has none — and the exact dividing line is the presence of an…

12 thms2 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine Learning·Captain: Shuze Chen

Bandit Algorithms XII: Follow-the-Regularised-Leader and Mirror DescentTextbook

Beneath Exp3, Exp4 and their relatives lies one algorithm: minimize past losses plus a convex regularizer. Chapters 26–28 of Lattimore–Szepesvári develop this unifying view. For a Legendre potential FFF with Bregman divergence DFD_FDF​, both mirror descent and follow-the-regularised-leader satisfy the master bound …

5 thms2 active users
🏆Completed
Bandit AlgorithmsMachine Learning·Captain: Shuze Chen

Bandit Algorithms VIII: Contextual Bandits and Exp4Textbook

Real decisions come with context: a news site chooses an article for a particular user. Competing with the single best arm is then meaningless; the right benchmark is the best mapping from contexts to arms, or more generally the best of MMM expert policies. Chapter 18 of Lattimore–Szepesvári formalizes this via Exp4 — exponential weighting over experts, fed…

9 thms2 active usersReviewed
🏆Completed
Stochastic Systems·Captain: wenxinzhang

Single-Server Queueing Convergence via Forward CouplingTextbook

Formalize sample-path stability for a continuous-time, unit-rate, infinite-buffer single-server queue. Starting from cumulative arriving service work, define the reflected transient workload, the workload constructed from the infinite past, long-run offered load, and two-time stationarity. Prove that subcritical load forces finite-time coupling and…

5 thms2 active usersReviewed
🏆Completed
Captain: wenxinzhang

Sample-Path Little's LawTextbook

Formalize sample-path Little's Law for deterministic continuous-time queueing trajectories, decomposed into area, sojourn, arrival-rate, boundary, and squeeze lemmas.

24 thms2 active users
🏆Completed
Inventory TheoryStochastic Systems·Captain: Ming Hu

A 1.9321.9321.932 Guarantee for (r,Q)(r,Q)(r,Q) Policies in Continuous-Review Lost-Sales Inventory SystemsResearch Paper

In many retail and spare-parts settings a customer who finds the shelf empty buys elsewhere: unmet demand is lost, not backlogged. When replenishment takes a positive lead time, the state of an optimally managed lost-sales system is the whole pipeline of outstanding orders, and optimal policies are not known in closed form (Zipkin 2008). Practice therefore…

31 thms1 active userReviewed
🏆Completed
Inventory TheoryStochastic Systems·Captain: Ming Hu

A 5/35/35/3 Guarantee for Echelon Stock (R,nQ)(R,nQ)(R,nQ) Policies in Two-Stage Stochastic Serial SystemsResearch Paper

A two-stage serial inventory system has a downstream stage that serves customers and an upstream stage that replenishes it from an outside supplier. Fixed setup charges make frequent replenishment expensive, inventory and backlog make infrequent replenishment expensive, and the two stages must coordinate both lot sizes and timing because the downstream…

15 thms1 active userReviewed
🏆Completed
Stochastic Systems·Captain: Ming Hu

A 5/25/25/2 Guarantee for Echelon Stock (s,S)(s,S)(s,S) Policies in One-Warehouse Multi-Retailer SystemsResearch Paper

A one-warehouse multi-retailer (OWMR) system is a two-echelon distribution network: a warehouse buys from an outside supplier and ships to several retailers, each facing random demand. Fixed costs per supplier order and per retailer shipment favor large, infrequent orders; holding and backlog costs favor small, frequent ones; and lead times at both echelons…

49 thms1 active userReviewed
PreviousPage 107 of 108Next

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