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
OptimizationProbability·Captain: mikedeng1

Hedging Inventory Risk Through Market Instruments I: Hedging Raises the Risk-Averse Newsvendor's Optimal Order QuantityResearch Paper

A retailer who orders a seasonal product before demand is known faces the newsvendor trade-off. Ordering too much leaves unsold stock, and ordering too little forgoes sales. A risk-neutral newsvendor orders a critical fractile of demand. A risk-averse one orders less, since inventory is a risky investment, and this reduction has been shown under constant…

11 thms5 active usersReviewed
Convex OptimizationOptimization·Captain: mikedeng1

Self-Scaled Barriers and Interior-Point Methods for Convex Programming I: A Joint-Scaling Primal-Dual Long Step Lowers the Potential (ν + ρ) ln⟨s, x⟩ + F(x) + F∗(s) by at Least √3/2 − ln(1 + √3/2)Research Paper

Interior-point methods solve linear, second-order cone and semidefinite programs in polynomial time, and they are the engine of most conic optimization software. The general theory of Nesterov and Nemirovskii (1994) covers any convex cone with a self-concordant barrier, but its methods are essentially primal and short-step: their analysis controls the…

22 thms5 active usersReviewed
🏆Completed
Dynamic ProgrammingMarkov ChainOptimization·Captain: mikedeng1

Optimality of (s, S) Policies in Inventory Models with Markovian Demand I: With Markov-Modulated Demand and Fixed Ordering Costs, a State-Dependent (s, S) Policy Is Optimal over a Finite HorizonResearch Paper

Single-item inventory theory asks how much stock to order each period when the order carries a fixed cost KKK on top of a per-unit cost and demand is random. With independent, identically distributed demand, Scarf (1960) showed that the optimal finite-horizon policy has the (s,S)(s,S)(s,S) form: when the stock falls below the reorder point sss, order up to the level SSS;…

20 thms5 active usersReviewed
🏆Completed
Dynamic ProgrammingLinear OptimizationProbability·Captain: mikedeng1

Analysis of Stochastic Dual Dynamic Programming Method: SDDP with Independently Subsampled Scenarios Finds an Optimal Policy of the SAA Problem in Finitely Many Iterations Almost SurelyResearch Paper

Multistage stochastic linear programs model sequential decisions under uncertainty: capacity and reservoir planning, hydro-thermal scheduling, inventory and asset–liability management. When the data process is stagewise independent, the problem decomposes by dynamic programming into one linear program per stage, coupled through expected cost-to-go functions.…

14 thms5 active usersReviewed
🏆Completed
Algorithmic Game TheoryLinear algebra·Captain: mikedeng1

Flows and Decompositions of Games: Harmonic and Potential Games 5: Every ϵ-Equilibrium of the Closest Potential Game Is an (ϵ + max_m 2α/√h_m)-Equilibrium of the Game, and ConverselyResearch Paper

Potential games (Monderer and Shapley, 1996) are the finite games whose unilateral payoff differences are all differences of a single function, the potential. They always have a pure Nash equilibrium, and many natural learning dynamics (best response, fictitious play, logit response) converge in them. Most games met in applications are not exactly potential…

19 thms5 active usersReviewed
🏆Completed
Algorithmic Game TheoryLinear algebra·Captain: mikedeng1

Flows and Decompositions of Games: Harmonic and Potential Games 2: Harmonic Games Generically Have No Pure Nash EquilibriumResearch Paper

Finite games in strategic form are the basic model of interaction between self-interested agents in economics, engineering and computer science. Among them, potential games (Monderer and Shapley, 1996) are the class with the most tractable equilibrium behaviour: every finite potential game has a pure Nash equilibrium, and simple learning dynamics such as…

9 thms5 active usersReviewed
🏆Completed
Algorithmic Game TheoryOptimization·Captain: mikedeng1

How Bad is Selfish Routing? 1: A Nash Flow Costs No More Than Any Flow Feasible for Twice the Rates, for Continuous Nondecreasing LatenciesResearch Paper

In a road or communication network, traffic is routed by many independent users, each choosing a route that is fastest for itself given the congestion caused by everyone else. The resulting Nash flow (also called a Wardrop equilibrium, after Wardrop 1952) need not minimize the total delay experienced by all users: Braess's paradox shows that adding a road…

15 thms5 active usersReviewed
🏆Completed
ProbabilityStochastic Systems·Captain: mikedeng1

Designing a Call Center with Impatient Customers I: The Steady-State Fraction of Abandoning Callers Tends to max(0, 1 − 1/ρ) as the Number of Agents GrowsResearch Paper

Telephone call centers are among the largest employers of service labour, and their staffing decisions are made with queueing models. The classical model is the Erlang-C queue M/M/NM/M/NM/M/N: Poisson arrivals, NNN agents, exponential service, infinitely patient callers. Real callers hang up. Garnett, Mandelbaum and Reiman (M&SOM 2002) argued that a model ignoring…

14 thms5 active usersReviewed
AnalysisProbabilityStochastic Systems·Captain: mikedeng1

Implicit Renewal Theory and Tails of Solutions of Random Equations 3: Rate of Approach — t^κP(R > t) Equals C₊ Minus a Contour Integral Plus O(t^{−β/2})Research Paper

Random equations of the form R=LΨ(R)R \overset{\mathcal L}{=} \Psi(R)R=LΨ(R), with Ψ\PsiΨ a random function independent of RRR, describe the stationary laws of many stochastic recursions: perpetuities in insurance and finance, the stationary law of ARCH-type volatility models, random difference equations R=Q+MRR = Q + MRR=Q+MR, and the stationary workload of certain queueing and storage…

17 thms5 active usersReviewed
ProbabilityStochastic Systems·Captain: mikedeng1

Implicit Renewal Theory and Tails of Solutions of Random Equations 2: Kesten's Theorem for R = Q + MR — Unique Stationary Law, Power Tails with Explicit C±, and C₊ + C₋ > 0 iff Q ≢ (1 − M)cResearch Paper

The random difference equation

16 thms5 active usersReviewed
🏆Completed
Complexity TheoryLinear OptimizationOptimization·Captain: mikedeng1

An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm 1: In O(√nL) Predictor-Corrector Iterations It Finds LP and Dual Optima or Detects InfeasibilityResearch Paper

Interior-point methods solve linear programs in polynomially many iterations, but the classical analyses assume something about the instance before the algorithm starts: a known strictly feasible primal–dual pair, a nonempty interior, or a big-MMM bound on the feasible region of order 2L2^L2L, where LLL is the bit length of the data. In practice none of this is…

22 thms5 active usersReviewed
🏆Completed
Linear OptimizationOptimization·Captain: mikedeng1

An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm 3: If (LP) and (LD) Have Interior Feasible Points, Every Self-Complementary Solution of (HLP) Has τ* > 0Research Paper

Linear programming algorithms often compute a solution to an auxiliary problem before extracting a solution to the original primal and dual pair. For a homogeneous self-dual formulation, the extraction requires a positive scaling coordinate. If that coordinate vanishes, the same auxiliary solution may instead describe infeasibility or unboundedness. Ye,…

7 thms5 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

Semidefinite Programming 1: If the Primal or the Dual Semidefinite Program Is Strictly Feasible Then p* = d*, and If Both Are, Both Optimal Sets Are NonemptyResearch Paper

A semidefinite program minimizes a linear objective subject to a matrix being positive semidefinite. It includes linear programs and many matrix optimization problems, while allowing constraints on eigenvalues that ordinary coordinate inequalities cannot express. Vandenberghe and Boyd’s 1996 survey helped establish this form as a common language for…

16 thms5 active usersReviewed
🏆Completed
Bandit AlgorithmsStochastic Systems·Captain: mikedeng1

On the Gittins Index for Multiarmed Bandits 3: The Optimal Expected Discounted Reward Is a Submodular Function of the Set of Available BanditsResearch Paper

The multiarmed bandit problem asks how a gambler should allocate successive plays among nnn independent projects, each of which changes state only when it is played, so as to maximize the expected total-discounted reward. Gittins and Jones (1974) showed that it is optimal to play, at every epoch, a project of greatest Gittins index, a number computed from…

16 thms5 active usersReviewed
🏆Completed
Dynamic ProgrammingProbability·Captain: mikedeng1

Optimal Inventory Policies for Assembly Systems Under Random Demands 2: If an Item and Its Predecessors Have Negative Discounted Echelon Holding Cost, the Minimal Cost Is Unbounded BelowResearch Paper

Assembly systems — components purchased from outside, assembled into subassemblies, and those into an end product facing random customer demand — are the standard model of material requirements planning under uncertainty. Rosling's paper (Oper. Res. 37(4), 1989) shows that, under a cost assumption, the optimal policies of such a system are those of an…

17 thms5 active users
🏆Completed
Complexity TheoryLinear OptimizationOptimization·Captain: mikedeng1

On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming 3: The Potential-Reduction Algorithm in N∞⁻(β) with ρ − n of Order n² Attains Precision t in O(nt) IterationsResearch Paper

Primal–dual interior-point methods solve a linear program by following, approximately, the central path of strictly feasible primal–dual pairs. Two families dominate the theory. Path-following methods keep the iterates in a neighbourhood of the path and measure progress by the duality gap. Potential-reduction methods measure progress by a merit function,…

12 thms5 active usersReviewed
🏆Completed
Machine LearningTheoretical Computer Science·Captain: mikedeng1

The Weighted Majority Algorithm 8: With η Anomalies Every Deterministic Learner Can Be Forced to opt(F, 0) + 2η MistakesResearch Paper

In the on-line prediction model studied by Littlestone and Warmuth (Inform. and Comput. 108, 1994), a learner receives instances one at a time, predicts a binary label for each, and is then told the correct label. No probabilistic assumption is made: performance is measured by the number of mistakes on a worst-case sequence. When every label is given by…

6 thms5 active usersReviewed
🏆Completed
Algorithmic Game TheoryProbability·Captain: mikedeng1

Worst-Case Equilibria I: On Two Identical Parallel Links Every Mixed Nash Equilibrium Has Expected Makespan at Most 3/2 Times the OptimumResearch Paper

When many users share a network and each routes its own traffic selfishly, the outcome is a Nash equilibrium rather than a centrally optimized assignment. Koutsoupias and Papadimitriou, in Worst-case equilibria (STACS 1999; journal version 2009), proposed to measure the loss caused by this lack of coordination by the worst-case ratio between the social cost…

11 thms5 active usersReviewed
🏆Completed
Dynamic ProgrammingMachine LearningProbability+1·Captain: mikedeng1

Stable Function Approximation in Dynamic Programming II: In a Nondiscounted MDP with All Policies Proper, Value Iteration Through a Self-Weighted Averager ConvergesResearch Paper

Value iteration solves a Markov decision process by repeatedly applying the Bellman backup to a table of state values. When the state space is too large for a table, the values are stored in a function approximator instead: each backup is followed by a fit, and the fitted function is backed up again. This approximate value iteration is the basis of fitted…

8 thms5 active usersReviewed
🏆Completed
OptimizationProbabilityStochastic Systems·Captain: mikedeng1

Optimal Starting Times for End-of-Season Sales and Optimal Stopping Times for Promotional Fares 3: With One Markdown or Markup Allowed, Thresholds x_n < z_n Give the Optimal PolicyResearch Paper

Retailers of seasonal goods, home builders selling out a development, and airlines and cruise lines selling promotional fares all face the same operational question: inventory is fixed, the selling season is finite, and the price can be changed only rarely. Menu costs, advertising commitments and customer goodwill often restrict a seller to a single price…

10 thms5 active usersReviewed
🏆Completed
OptimizationProbabilityStochastic Systems·Captain: mikedeng1

Optimal Starting Times for End-of-Season Sales and Optimal Stopping Times for Promotional Fares 2: Markup Is Optimal Once Time-to-Go Exceeds an Increasing Threshold z_nResearch Paper

An airline may offer a low promotional fare while seats remain available, then raise the fare as departure approaches. The choice is dynamic: a sale changes both the number of seats left and the benefit of waiting. The same decision appears for hotel rooms and theater seats. Feng and Gallego study a policy with two fixed prices and at most one price change,…

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

Poisson Arrivals See Time Averages: Under Lack of Anticipation, the Fraction of Time in B Converges a.s. iff the Fraction of Arrivals Finding B Does, to the Same LimitResearch Paper

Queueing analysis constantly moves between two kinds of long-run averages: the fraction of time a system spends in some set of states, and the fraction of arriving customers who find it there. Waiting-time formulas for the M/G/1 queue, blocking probabilities in loss systems and many decomposition arguments rest on the claim that, when arrivals form a…

13 thms5 active usersReviewed
🏆Completed
Bandit AlgorithmsStochastic Systems·Captain: mikedeng1

On the Gittins Index for Multiarmed Bandits 1: A Policy Falls Short of the Gittins Policy by at Most Its Expected Discounted Excess of the Greatest Prevailing Charge over Its RewardResearch Paper

The multiarmed bandit problem asks how to allocate a single resource, one play per period, among several alternative projects whose states evolve only while they are worked on. It models the scheduling of jobs on one machine, the sequencing of research projects, and the design of sequential clinical trials. Gittins and Jones (1974) showed that the problem…

12 thms5 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

METRIC: A Multi-Echelon Technique for Recoverable Item Control 1: The Marginal Conditions on the Convex Hull of Each Item's Decreasing Cost Function Determine a Unique Optimal AllocationResearch Paper

Service organizations keep repairable spare parts at a depot and at operating bases. Stock has a purchase or holding cost, while insufficient stock leaves backorders. Craig Sherbrooke's METRIC study describes how to evaluate such a system and distribute additional units among item types. Its fifth computational stage compares the reduction in expected…

22 thms5 active users
🏆Completed
Dynamic ProgrammingOptimization·Captain: mikedeng1

Revenue Management Under a General Discrete Choice Model of Consumer Behavior 1: The Optimal Policy Offers Only Nondominated Sets, a Larger One the More Capacity and the Less Time RemainResearch Paper

A seller with one limited inventory pool can choose which fare products to show in each selling period. When customers choose among the displayed products, showing another fare can both add sales and divert buyers from a more expensive fare. A fixed ranking of fares therefore does not by itself tell the seller which products to offer. Talluri and van…

10 thms5 active usersReviewed
PreviousPage 9 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