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
Algorithmic Game TheoryMechanism DesignOptimization+1·Captain: mikedeng1

An Introduction to the Theory of Mechanism Design II: Myerson's Optimal Single-Unit AuctionTextbook

A seller with one indivisible good and several potential buyers, each of whom privately knows how much the good is worth to them, has to choose a selling procedure: a posted price, an English auction, a sealed-bid auction with a reserve price, or something more elaborate. Which procedure raises the most expected revenue? Myerson's answer (Myerson 1981) is…

12 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryFunctional AnalysisMechanism Design+1·Captain: mikedeng1

An Introduction to the Theory of Mechanism Design I: Screening and the Optimality of a Posted PriceTextbook

A seller with one good and one buyer whose valuation she does not know faces the simplest problem of mechanism design: choose a selling procedure, anticipating that the buyer will act in his own interest given what he knows. The textbook answer, "post the monopoly price", is usually derived by optimizing over prices alone. The question that opens Börgers' An…

16 thms2 active usersReviewed
🏆Completed
Control TheoryDynamic ProgrammingOptimization+1·Captain: mikedeng1

Bellman's Dynamic Programming VI: Optimal Policies for the Continuous Gold-Mining ProcessTextbook

Chapter II of Richard Bellman's Dynamic Programming (Princeton University Press, 1957) solves a discrete gold-mining process: a single machine can be used in one of two mines, each use extracts a fixed fraction of the gold remaining in that mine, and each use carries a fixed risk of destroying the machine. Maximizing the expected total gold leads to an index…

11 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOptimizationProbability·Captain: mikedeng1

Bellman's Dynamic Programming V: Optimality of a Constant Stock Level for the Optimal Inventory EquationTextbook

The optimal inventory problem asks how much of an item to stock when demand is random, ordering costs money, and running short costs more. Arrow, Harris and Marschak formulated it as a sequential decision problem in 1951 (Optimal inventory policy, Econometrica 19), and Dvoretzky, Kiefer and Wolfowitz studied its structure in 1952–53. Chapter V of Richard…

7 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOptimizationProbability·Captain: mikedeng1

Bellman's Dynamic Programming III: Index Rules for the Stochastic Gold-Mining ProcessTextbook

Chapter II of Richard Bellman's Dynamic Programming (Princeton University Press, 1957) treats the stochastic gold-mining process, the first stochastic multi-stage decision process of the book whose optimal policy can be written down in closed form. There Bellman introduces decision regions, the sets of states at which a given first choice is optimal, and…

11 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOptimization·Captain: mikedeng1

Bellman's Dynamic Programming II: Fibonacci Search for the Maximum of a Unimodal FunctionTextbook

Many optimization routines contain an inner step that maximizes a function of one variable whose values are expensive to compute: a line search inside a multivariate method, a tuning parameter chosen by simulation, a stage of a dynamic program in which each evaluation requires solving a subproblem. When the only structural information is that the function…

9 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOptimization·Captain: mikedeng1

Bellman's Dynamic Programming I: Existence and Uniqueness for the Multi-Stage Allocation EquationTextbook

Chapter I of Richard Bellman's Dynamic Programming (Princeton University Press, 1957) opens the book with a multi-stage allocation process: a resource is divided, stage after stage, between two activities, each of which yields an immediate return and leaves behind a depleted remainder that is re-divided at the next stage. The chapter uses this process as…

10 thms2 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Analysis and Algorithms for Service Parts Supply Chains IV: Backorder Convexity and Everett's TheoremTextbook

Service parts (spares for aircraft, machines, and networks) are typically managed item by item with a one-for-one replenishment policy, the (s−1,s)(s-1, s)(s−1,s) policy: every unit withdrawn to meet a demand triggers an order for one replacement, so the inventory position stays at the stock level sss. A firm stocking thousands of such items at one location has to choose…

13 thms2 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

Fast Projection onto the Simplex and the ℓ1 Ball: Correctness of Condat's AlgorithmResearch Paper

The Euclidean projection of a vector onto the simplex — the nonnegative vectors whose entries sum to a fixed radius — is a subroutine of first-order methods whose iterates must stay probability vectors or nonnegative budgets: portfolio optimization, multispectral unmixing, image segmentation, constrained least squares and many machine-learning models.…

13 thms2 active usersReviewed
🏆Completed
Convex OptimizationLinear OptimizationOptimization·Captain: mikedeng1

Linear Programming: Foundations and Extensions V: Convergence Rates of the Path-Following MethodTextbook

Interior-point methods are, together with the simplex method, the standard algorithms for linear programming, and the primal–dual path-following method is the form in which they are implemented in most solvers. Unlike the simplex method, it is a one-phase method: it can start from any point whose primal and dual variables are strictly positive, feasible or…

14 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryLinear Optimization+1·Captain: mikedeng1

Linear Programming: Foundations and Extensions III: Network Flows, the Integrality Theorem and König's TheoremTextbook

Minimum-cost network flow problems are the largest special class of linear programs met in practice: transportation, distribution, assignment, communication and electric networks, facility location and financial planning all reduce to moving material along the arcs of a directed network from supply nodes to demand nodes at least cost. Chapter 14 of R. J.…

7 thms2 active usersReviewed
🏆Completed
Markov ChainProbabilityStochastic Systems·Captain: mikedeng1

Stochastic Dynamic Programming and the Control of Queueing Systems XIV: Conforming Approximating Sequences for Markov ChainsTextbook

Countable-state Markov chains are the standard model of queues with unbounded buffers, but any numerical computation of their long-run behaviour works on a finite state space. The usual remedy is truncation: restrict the chain to a finite set SNS_NSN​ and redistribute the probability of leaving SNS_NSN​ back into it. Whether the steady state probabilities and average…

10 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryCombinatorics·Captain: mikedeng1

Theory of Games and Economic Behavior VI: Splitting Sets and the Decomposition Partition of a GameTextbook

Chapter IX of von Neumann and Morgenstern's Theory of Games and Economic Behavior asks when a game played by many participants is really several separate games played side by side. The authors' motivation (41.1) is methodological: the general theory of the nnn-person game becomes unmanageable as nnn grows, and one way to gain insight into large games is to…

16 thms2 active usersReviewed
🏆Completed
Convex OptimizationInformation TheoryLinear algebra+1·Captain: naimengye

Decoding by Linear Programming: Exact Recovery by ℓ1 Minimization under the Restricted Isometry ConditionResearch Paper

Consider the classical error-correcting problem. An input vector f∈Rnf \in \mathbb{R}^nf∈Rn (the plaintext) is encoded as Af∈RmAf \in \mathbb{R}^mAf∈Rm by a coding matrix AAA with m>nm > nm>n, and an unknown, arbitrary vector of errors eee corrupts the result, so that only y=Af+ey = Af + ey=Af+e is observed. Can fff be recovered exactly, and by an algorithm whose running time is polynomial in mmm? Can…

9 thms2 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Global Convergence of Splitting Methods for Nonconvex Composite Optimization IV: Descent and Stationary Cluster Points of the Proximal Gradient MethodResearch Paper

Many problems in statistics, signal processing and machine learning minimize a sum of a smooth loss and a nonsmooth regularizer: least squares with an ℓ0\ell_0ℓ0​ or ℓ1/2\ell_{1/2}ℓ1/2​ penalty, and constrained problems in which the regularizer is the indicator of a nonconvex set. The proximal gradient method (also called forward–backward splitting) is the standard…

13 thms2 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Global Convergence of Splitting Methods for Nonconvex Composite Optimization II: The Proximal ADMM Sequence Is Bounded Under CoercivityResearch Paper

The alternating direction method of multipliers (ADMM) splits a problem of the form min⁡xh(x)+P(Mx)\min_x h(x) + P(\mathcal M x)minx​h(x)+P(Mx) into a sequence of simpler subproblems, one in which the nonsmooth term PPP enters only through its proximal map and one in which only the smooth term hhh appears. For convex problems its convergence theory is classical. In signal processing and…

12 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingMachine LearningReinforcement Learning·Captain: mikedeng1

Approximately Optimal Approximate Reinforcement Learning II: Near-Optimality of a Policy with Small Policy AdvantageResearch Paper

Approximate policy iteration and policy-gradient methods stop when they can no longer find a direction of improvement. Kakade and Langford (ICML 2002) asked what such a stopping point guarantees. Their algorithm, conservative policy iteration, halts at a policy π\piπ for which no policy can improve much on π\piπ as measured under a restart distribution μ\muμ; the…

10 thms2 active usersReviewed
🏆Completed
CombinatoricsOptimization·Captain: mikedeng1

Optimal Two- and Three-Stage Production Schedules with Setup Times Included 2: Johnson's Rule for Three MachinesResearch Paper

Johnson's 1954 paper in Naval Research Logistics Quarterly is the starting point of machine scheduling theory. Its first section solves the two-machine flow shop: nnn items must pass through machine 1 and then machine 2, and an explicit ordering rule minimizes the total elapsed time. Its second section treats three machines. There the problem "loses some of…

19 thms2 active usersReviewed
🏆Completed
Machine LearningProbabilityStatistics·Captain: mikedeng1

Robustness and Generalization I: A Generalization Bound for Robust AlgorithmsResearch Paper

A learning algorithm maps a training set to a hypothesis. It generalizes when the loss it incurs on the training set is close to its expected loss on fresh data. The classical way to certify this bounds the complexity of the whole hypothesis class the algorithm may output, through its VC dimension, covering numbers or Rademacher complexity. A second…

7 thms2 active usersReviewed
🏆Completed
Convex OptimizationOptimizationProbability·Captain: mikedeng1

Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program II: Stability of the Deterministic Equivalent Convex ProgramResearch Paper

A two-stage stochastic linear program with fixed recourse chooses a first-stage decision xxx before a random vector ξ\xiξ is observed, and then pays for a cheapest corrective action yyy once ξ\xiξ is known. It is the basic model of planning under uncertainty in operations research: capacity expansion, production planning with random demand, and energy dispatch are…

11 thms2 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program I: The Induced Feasibility Region Is a Closed Convex Polyhedron When T Is FixedResearch Paper

A two-stage stochastic program with recourse is a linear program in which a decision xxx is taken before a random vector ξ\xiξ is observed, and a corrective (recourse) decision yyy is taken afterwards at a cost. It is the basic model of planning under uncertainty in operations research: capacity expansion, production planning, energy dispatch and inventory models…

8 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingProbabilityStochastic Systems·Captain: mikedeng1

Computing Optimal (s, S) Inventory Policies I: The Renewal Closed Form for the Discounted Cost of a Stationary (s, S) PolicyResearch Paper

The periodic-review inventory problem with a fixed ordering cost is one of the basic models of operations research. A firm reviews its stock once per period, may order at a cost KKK per order plus a unit cost, and then faces a random demand; unmet demand is backlogged. Scarf (1960) and Iglehart (1963) showed that for this model an (s,S)(s, S)(s,S) policy is optimal:…

12 thms2 active usersReviewed
🏆Completed
Convex OptimizationNumerical AnalysisOptimization·Captain: mikedeng1

A New Projection Method for Variational Inequality Problems: The Hyperplane Projection Method Converges to a Solution Under Continuity and Generalized MonotonicityResearch Paper

A variational inequality asks for a point of a convex set at which a vector field points "inward" against every feasible direction. The format covers the first-order optimality conditions of constrained optimization, nonlinear complementarity problems, traffic and economic equilibria (Wardrop, Walrasian, Nash–Cournot), and systems of nonlinear equations;…

16 thms2 active usersReviewed
🏆Completed
Linear algebraNumerical AnalysisOptimization·Captain: mikedeng1

Conjugate Gradient Methods with Inexact Searches: The Self-Scaled Direction Is a Multiple of Beale's Restart DirectionResearch Paper

Conjugate gradient methods minimize a smooth function f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R using only gradients and a handful of stored vectors. This makes them the standard choice when nnn is too large for Newton or quasi-Newton methods, which store an n×nn\times nn×n matrix. On a strictly convex quadratic with exact line searches the classical method of Hestenes and Stiefel…

18 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOptimizationProbability·Captain: mikedeng1

Information Sharing in a Supply Chain with a Common Retailer 1: Under Production Diseconomy the Retailer Earns More from Sequential Information Contracting and the Manufacturers from ConcurrentResearch Paper

Retailers hold point-of-sale data that their suppliers cannot observe, and large retailers sell access to it through data-sharing programs (Costco's CRX, Walmart's Retail Link and similar programs). When one retailer carries the substitutable products of two competing manufacturers, sharing its demand information is a strategic decision: a manufacturer who…

17 thms2 active usersReviewed
PreviousPage 101 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