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

On the Structure of Lost-Sales Inventory Models 2: The Optimal Lost-Sales Order Obeys the Karlin–Scarf–Morton Bounds z̄_t(v) ∈ Z(s̄) for All t ≤ TResearch Paper

In the periodic-review inventory system with lost sales and a positive lead time LLL, demand that cannot be met from stock is lost rather than backlogged. Unlike the backorder model, whose optimal policy is a base-stock policy depending only on the inventory position, the lost-sales model needs the whole pipeline of outstanding orders as its state, and its…

9 thms4 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

On the Relationship Between Inventory Costs and Variety Benefits in Retail Assortments II: Optimal Variety Rises with Price and Store Volume and Falls as the No-Purchase Preference VanishesResearch Paper

A retailer deciding how many variants of a product to carry (colours, sizes, flavours) faces a trade-off. A broader assortment captures customers whose favourite variant would otherwise be missing, but it splits demand into more, smaller streams, each of which needs its own safety stock. van Ryzin and Mahajan (Management Science 45(11), 1999) combine a…

9 thms4 active usersReviewed
🏆Completed
Machine LearningTheoretical Computer Science·Captain: mikedeng1

The Weighted Majority Algorithm 9: With η Anomalies Every Randomized Learner Can Be Forced to ½ opt(F, 0) + η Expected MistakesResearch Paper

Prediction with expert advice asks a learner to predict a binary label on each of a sequence of trials, after seeing the predictions of a pool of candidate functions, and to make few more mistakes than the best member of the pool. Littlestone and Warmuth's The Weighted Majority Algorithm (Inform. and Comput. 108, 1994) gave the deterministic algorithm WM…

7 thms4 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Monotone Comparative Statics III: f(x, t) + p·x Is Quasisupermodular with the Single Crossing Property for Every Price Vector p If and Only If f Is SupermodularResearch Paper

Monotone comparative statics asks when the optimal choice of an agent moves in a predictable direction as a parameter of the problem changes: does a firm hire more of every input when the output price rises, does a monopolist raise its price when its marginal cost rises? Topkis (1978) gave a cardinal answer: if the objective f(x,t)f(x,t)f(x,t) is supermodular in the…

9 thms4 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Bounded Rationality in Newsvendor Models V: If σ_T ≤ Σσ_i and σ_T ≥ σ_i, Pooling Strictly Lowers the Expected Cost of Logit Newsvendors with Normal DemandsResearch Paper

Inventory pooling lets several locations serve their combined demand from one stock of goods. Classical newsvendor analysis predicts lower optimal cost when pooling reduces demand variation, but the reduction can vanish when demands are perfectly correlated. Xuanming Su asks whether that conclusion survives when managers make noisy stocking decisions rather…

9 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingOptimizationProbability·Captain: mikedeng1

Negative Dynamic Programming II: With Non-Positive Rewards on Borel Spaces, the Optimal Return Satisfies the Optimality EquationResearch Paper

Negative dynamic programming is the study of infinite-horizon sequential decision problems in which every one-stage reward is non-positive and nothing is discounted. Equivalently, a non-negative cost accumulates forever and the controller minimizes its expected total. Stochastic shortest-path problems, optimal stopping with a cost per step, and inventory or…

22 thms4 active usersReviewed
🏆Completed
ProbabilityStochastic Systems·Captain: mikedeng1

Understanding the Efficiency of Multi-Server Service Systems I: With Poisson Arrivals and Finitely Many Service-Time Values of Mean 1, the Number of Busy Servers in M/G/∞ Is Poisson(λ)Research Paper

Call centers, hospital wards, telephone exchanges and server farms all face the same staffing question: given an arrival rate λ\lambdaλ, how many servers sss are needed to keep congestion at a fixed level? A widely used answer is the square-root staffing rule

9 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingMarkov Chain·Captain: mikedeng1

On Finding Optimal Policies in Discrete Dynamic Programming with No Discounting 2: f Maximizes Gain and Then Bias Exactly When Its Averaged Finite-Horizon Returns Dominate Every Stationary Policy'sResearch Paper

A Markov decision process with finitely many states and actions is usually run either with a discount factor β<1\beta<1β<1 or under the long-run average criterion. Without discounting, the total return over an infinite horizon is typically infinite, and the average return per period ignores everything that happens in any finite stretch of time: two policies with…

13 thms4 active usersReviewed
🏆Completed
AnalysisStochastic Systems·Captain: mikedeng1

The G/GI/N Queue in the Halfin–Whitt Regime 1: The Regulator Equation z(t) = x(t) + ∫₀ᵗ (z(t−s)+a)⁺ dB(s) Has a Unique Càdlàg Solution, Lipschitz on Bounded Intervals and Measurable in xResearch Paper

The G/GI/NG/GI/NG/GI/N queue has NNN identical servers, a general arrival process, and independent service times with a common distribution FFF. In the Halfin–Whitt regime the number of servers and the offered load grow together, so that the fraction of delayed customers stays strictly between 000 and 111. This is the standard asymptotic model of large call centers and service…

13 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingProbability·Captain: mikedeng1

Optimal Ordering and Rationing Policies in a Nonstationary Dynamic Inventory Model with n Demand Classes IV: Critical-Level Ordering at Nondecreasing Myopic Levels ȳₘ Is OptimalResearch Paper

A firm with one product may face several customer classes in each selling interval. When stock is scarce, it must decide which outstanding demands to satisfy and how much inventory to carry into later intervals. When new stock can be bought at several dates, the rationing choice also changes the value of future purchasing opportunities. Topkis studied these…

9 thms4 active usersReviewed
🏆Completed
Linear OptimizationOptimizationTheoretical Computer Science·Captain: mikedeng1

Fast Approximation Algorithms for Fractional Packing and Covering Problems 2: An ε-Relaxed Decision Procedure for Fractional Covering Using O(m + ρ log² m + ε⁻²ρ log(m/ε)) Oracle CallsResearch Paper

Many linear programs that arise in combinatorial optimization ask only whether a convex set contains a point satisfying a family of nonnegative linear constraints. In the fractional covering problem the constraints have the form Ax≥bAx\ge bAx≥b with A≥0A\ge 0A≥0: the fractional relaxation of set cover, the Held–Karp lower bound for the travelling salesman problem, and…

10 thms4 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

A Dual Approach to Solving Nonlinear Programming Problems by Unconstrained Optimization 2: For a Normal Convex Program and Any Dual Optimal ȳ, x̄ Is Optimal iff x̄ Minimizes L_r(·, ȳ)Research Paper

Lagrangian duality turns a constrained minimization problem into the maximization of a dual function over multipliers. For convex programs the duality is clean: under mild conditions the dual optimal value equals the primal one, and an optimal multiplier vector yˉ\bar yyˉ​ exists. Computationally, however, the ordinary Lagrangian has a well-known defect. Knowing…

8 thms4 active usersReviewed
🏆Completed
CombinatoricsProbability·Captain: mikedeng1

Concentration of Measure and Isoperimetric Inequalities in Product Spaces XI: The Random Assignment Problem — Fluctuations of the Optimal Cost of Order (log N)²/(√N log log N)Textbook

The assignment problem asks for a one-to-one matching of NNN agents to NNN tasks that minimizes the total cost. It is one of the basic problems of combinatorial optimization and is solved in polynomial time by the Hungarian method. Its random version, in which the N2N^2N2 costs are independent random variables, is a standard model for the typical behavior of…

7 thms4 active usersReviewed
🏆Completed
ProbabilityStochastic Systems·Captain: mikedeng1

Stochastic Inequalities on Partially Ordered Spaces 3: Ornstein's d̄-Distance of Stationary Real Processes Equals ∫ω⁰dP + ∫ω⁰dQ − 2 sup{∫ω⁰dR : R ≺ P, R ≺ Q}Research Paper

Two stationary random sequences can have identical distributions at each individual time while differing in their dependence across time. Comparing only their one-time marginals therefore misses a feature relevant to stochastic-process comparison. Ornstein's dˉ\bar ddˉ measures the cost of matching two whole stationary processes: it minimizes the expected…

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

A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand 3: For Any Step Scale γ, Non-Perishable AIM's Excess Cost Λ₂(T) Is Bounded by a Hitting Time and a Busy PeriodResearch Paper

A retailer who stocks a perishable or storable product each period must choose an order-up-to level without knowing the demand distribution. Worse, demand is censored: when the shelf empties, the retailer observes sales, not demand. Huh and Rusmevichientong (Math. Oper. Res. 34(1), 2009) proposed the Adaptive Inventory Management (AIM) algorithm, a…

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

A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand 2: Without a Bound on y^NV, Expanding-Projection AIM Has Regret ≤ max{b,h}(T^{δ−1/2} + T^{−1/2} + (y^NV)^{1+2/δ}/T)Research Paper

A retailer who restocks a product every period must pick an order-up-to level without knowing the demand distribution. When a period ends with an empty shelf, the retailer records only its sales, so the true demand above the stock level is censored. The classical newsvendor solution, the critical fractile of the demand distribution, cannot be computed. Huh…

11 thms4 active users
🏆Completed
ProbabilityStochastic Systems·Captain: mikedeng1

Shock Models and Wear Processes II: If the Probabilities of Surviving k Shocks Have Decreasing Successive Ratios, the Poisson Shock Life Distribution Is IHRResearch Paper

A component may be exposed to shocks that arrive at random times. Its chance of lasting for a given time depends both on how often shocks arrive and on how likely it is to survive successive shocks. Reliability calculations often begin with the latter, discrete sequence, while replacement and life-testing questions concern the resulting lifetime…

8 thms4 active usersReviewed
🏆Completed
Numerical AnalysisProbability·Captain: mikedeng1

Multilevel Monte Carlo Path Simulation: The Multilevel Estimator Achieves Mean-Square Error Below ε² at Cost c₄ε⁻², c₄ε⁻²(log ε)² or c₄ε^(−2−(1−β)/α)Research Paper

Pricing a financial derivative, estimating a risk measure, or computing any expected functional of a stochastic differential equation (SDE) by simulation runs into two errors at once: the statistical error of averaging finitely many sampled paths, and the discretisation bias of replacing the exact SDE solution by a numerical scheme with a positive timestep.…

15 thms4 active usersReviewed
🏆Completed
Dynamical SystemsProbabilityRandom Matrix Theory·Captain: mikedeng1

Subadditive Ergodic Theory 5: For a Stationary Sequence in a Banach Algebra with E(log‖Y₁‖)⁺ < ∞, n⁻¹ log‖Y₁⋯Y_n‖ Converges in [−∞, ∞)Research Paper

Products of random linear operators appear wherever a system evolves by repeated application of randomly chosen linear maps: linear recursions with random coefficients, products of random matrices in statistical physics, the growth of random dynamical systems, and population models in random environments. The basic question is the exponential growth rate of…

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

Dynamic Pricing and Inventory Control of Substitute Products 1: Under Multinomial Logit Choice the Optimal Dynamic Prices Equalize Marginal RevenuesResearch Paper

Retailers selling several related products can change prices as inventory runs down. A sale of one product changes the stock available in later periods, while changing its price also shifts demand toward or away from the other products. Dong, Kouvelis, and Tian study these linked decisions for substitute product variates under a multinomial logit customer…

10 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingOptimization·Captain: mikedeng1

Dynamic Pricing and Inventory Control of Substitute Products 2: The Optimal Unified Dynamic Price under Multinomial Logit ChoiceResearch Paper

Retailers often sell several variates of one product (colours, sizes or flavours of an otherwise identical item) from a fixed stock over a short season, with no replenishment. Customers substitute among the variates and the no-purchase option, so the price of one variate changes the demand for all of them, and the stock of each variate changes the value of…

9 thms4 active usersReviewed
🏆Completed
Dynamical SystemsProbabilityRandom Matrix Theory·Captain: mikedeng1

Subadditive Ergodic Theory 4: Furstenberg–Kesten — for Stationary Positive Random Matrices, n⁻¹ log [Y₁⋯Y_n]_ij Converges, Independently of i and jResearch Paper

Many systems evolve by repeated multiplication by a random linear map: the state of a linear system with randomly varying coefficients, population vectors in a random environment (Leslie models whose rates change from year to year), the transfer matrices of a disordered one-dimensional medium, and the transition operators of a Markov chain in a random…

10 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingLinear OptimizationMarkov Chain+1·Captain: mikedeng1

Linear Programming and Finite Markovian Control Problems VI: Constrained Average Reward — the Limit Points of the Expected State-Action Frequencies Form the Linear Programming PolytopeTextbook

A controller of a finite Markov chain often cares about more than one long-run quantity: an inventory manager wants a high average profit while keeping the long-run fraction of stock-outs below a target; a communication network maximizes throughput subject to bounds on average delay or power. Such problems are constrained Markov decision problems: maximize…

13 thms4 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: mikedeng1

An Introduction to Timetabling 1: Every Class–Teacher Requirement Matrix Has a Timetable over Any p Days with Every Daily Load and Pair Count Between ⌊r/p⌋ and ⌈r/p⌉Research Paper

School and university timetabling is one of the oldest applications of combinatorial optimization. In his invited review An introduction to timetabling (European Journal of Operational Research, 1985), D. de Werra opens with the class–teacher model: classes meet teachers for a prescribed number of one-period lectures, and the lectures must be placed into…

8 thms4 active usersReviewed
🏆Completed
Computational GeometryProbability·Captain: mikedeng1

Concentration of Measure and Isoperimetric Inequalities in Product Spaces XII: The Euclidean Traveling Salesman Problem — P(|L_N − M| ≥ t) ≤ K e^{−t²/K} for N Uniform Points in the SquareTextbook

The Euclidean traveling salesman problem asks for the shortest closed route through a finite set of points in the plane. Even when the points are placed independently and uniformly in a square, finding an individual shortest route is computationally difficult. A separate probabilistic question is whether the optimal length varies much from one random sample…

7 thms4 active usersReviewed
PreviousPage 19 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