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
Markov ChainStochastic 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
Optimization·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
OptimizationProbability·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
Dynamic ProgrammingOptimizationProbability·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 Optimization·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 OptimizationOptimization·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 OptimizationOptimization·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 OptimizationOptimization·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 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 OptimizationOptimization·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 OptimizationOptimization·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 OptimizationOptimization·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 Learning·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
Stochastic 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
🏆Completed
Mechanism Design·Captain: qm2204

Buying to Bundle: Asymptotic Optimality of Surrogate BundlingResearch Paper

A platform sourcing items from monopolistic sellers with private quality cannot tractably maximize its true profit: the bundle revenue Rev(vS)Rev(v_S)Rev(vS​) is neither monotone, submodular, supermodular, subadditive, nor superadditive. Theorem 4.6 of Buying to Bundle: Optimal Sourcing from Monopolistic Sellers shows that the simple surrogate threshold mechanism —…

19 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryComputational Geometry·Captain: mikedeng1

Condorcet-Winning Sets and Peer Selection in Planar Metric ElectionsResearch Paper

A committee can satisfy a majority guarantee that no single candidate satisfies: no outside alternative is preferred to every committee member by more than half the electorate. Such a committee is a Condorcet-winning set, extending the single-candidate majority criterion studied in social choice. Elkind, Lang, and Saffidine introduced this set-valued…

21 thms2 active usersReviewed
🏆Completed
ProbabilityTheoretical Computer Science·Captain: mikedeng1

Tight weighted paging with delay via mirror descentResearch Paper

A cache can avoid repeated downloads by retaining useful pages. When requests may wait, it can also batch several requests for the same page into one download. These two choices interact: waiting may save a fetch, but holding a page while waiting occupies space that another page needs. Weighted paging with delay asks for an online rule that balances these…

19 thms2 active usersReviewed
🏆Completed
ProbabilityTheoretical Computer Science·Captain: mikedeng1

Tight Bounds for Randomized Generalized k-Server on Uniform MetricsResearch Paper

The generalized kkk-server problem was introduced by Koutsoupias and Taylor (KT04) as a model of kkk heterogeneous servers, each moving in its own metric space, that must jointly answer requests naming one location per server. It contains the classical kkk-server problem, weighted kkk-server, and paging with heterogeneous cache slots as special cases, and it is a…

12 thms2 active usersReviewed
🏆Completed
OptimizationStatistics·Captain: iris

Rounding, Ranges, and Exact Sample-Removal Audits for Least SquaresResearch Paper

The sign of a least-squares coefficient often carries the substantive conclusion of an empirical study. Giordano, Meager and Broderick showed that deleting a small fraction of the observations can reverse such conclusions in prominent studies (GMB26). This raises an auditing question: how many observations must be removed before a conclusion drawn from an…

21 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryTheoretical Computer Science·Captain: iris

Stable Voting Rules on the Edge of Optimal Metric DistortionResearch Paper

An election asks a group to choose one candidate from rankings alone. The metric distortion framework of Anshelevich, Bhardwaj and Postl (2015) measures how much those rankings cost: voters and candidates are points of an unknown metric space, each voter ranks closer candidates higher, and a voting rule's distortion is its worst-case ratio between the…

53 thms2 active usersReviewed
🏆Completed
CombinatoricsLinear algebraTheoretical Computer Science·Captain: iris

The k-server conjecture is trueResearch Paper

The kkk-server problem, introduced by Manasse, McGeoch and Sleator in 1988 (MMS88), is the central problem of competitive analysis: kkk servers sit at points of a metric space, requests arrive one at a time at points of the space, and an online algorithm must move a server to each request before seeing the next one, minimizing the total distance travelled.…

31 thms2 active usersReviewed
🏆Completed
CombinatoricsOptimizationTheoretical Computer Science·Captain: iris

Online Matching Frameworks under Stochastic Rewards, Product Ranking, and Unknown Patience: Greedy with a κ-Approximate Star-Graph Black Box Is κ/2-Competitive under Adversarial ArrivalsResearch Paper

Online bipartite matching, introduced by Karp, Vazirani and Vazirani (1990), models a platform that must assign arriving customers to a known stock of items, one customer at a time and irrevocably. In e-commerce, job search and online advertising, a recommendation is only a suggestion: a customer buys an offered item with some known probability, and after…

15 thms2 active usersReviewed
🏆Completed
Bandit AlgorithmsDynamic ProgrammingMarkov Chain·Captain: iris

Relaxed Indexability and Index Policy for Partially Observable Restless Bandits: Relaxed Indexability Is Equivalent to a Passive-Time Inequality, and the Approximate Whittle Index Has a Closed FormResearch Paper

A restless multi-armed bandit has NNN arms, each a Markov chain that keeps evolving whether or not it is used; in every slot a decision maker activates some of the arms and collects rewards from them. Channel selection in wireless networks, machine maintenance, target tracking and patient monitoring are of this form. Finding an optimal policy is PSPACE-hard…

14 thms2 active usersReviewed
🏆Completed
Economics·Captain: iris

Effects of Reactive Capacity on Product Quality and Firm Profitability in an Uncertain Market: equilibrium quality rises then falls in the supplier's reactive capacityResearch Paper

Brand-owning retailers outsource production and use pull contracts: the retailer names a wholesale price, the supplier decides how much to stock before the season, and the retailer orders only after it has seen demand, so the supplier carries the inventory risk (Cachon 2004, cited on p.13 of the source). Investment in reactive capacity (shorter set-up…

10 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryConvex Optimization·Captain: iris

Correlated Equilibria in Large Anonymous Bayesian Games: with a convex potential, coarse correlated and correlated Wardrop equilibria are the mixtures of Wardrop equilibria, all with equal costsResearch Paper

In large populations of anonymous agents (commuters choosing routes, users choosing servers, customers choosing a bar), each individual has a negligible effect on the others, and the natural equilibrium notion is the Wardrop equilibrium (WE): only cheapest actions carry mass. A mediator such as a navigation app may instead recommend actions at random,…

13 thms2 active usersReviewed
PreviousPage 68 of 106Next

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