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

Arbitrage and Duality in Nondominated Discrete-Time Models II: Nondominated Optional Decomposition — a Supermartingale Under Every Martingale Measure Is V₀ + H•S − KResearch Paper

In a financial market with a single probability model, the Optional Decomposition Theorem describes the processes that can be dominated by trading. If a process VVV is a supermartingale under every equivalent martingale measure, then it can be written as an initial value plus a stochastic integral against the stock price, minus an increasing process that…

10 thms1 active userReviewed
CombinatoricsGraph TheoryOptimization·Captain: mikedeng1

A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem: The Asymmetric Held–Karp Relaxation Has Integrality Gap at Most 319Research Paper

The asymmetric traveling salesman problem (ATSP) asks for a shortest closed walk through every vertex of a directed graph whose edge weights need not be symmetric. It models routing with one-way streets, scheduling with sequence-dependent setup times, and many other problems in which the cost of going from uuu to vvv differs from the cost of going back. Its…

13 thms1 active userReviewed
Partial Differential EquationsProbabilityStochastic Systems·Captain: mikedeng1

Global C¹ Regularity of the Value Function in Optimal Stopping Problems 2: In Finite Horizon, Probabilistic Regularity of the Boundary Makes the Time Derivative of the Value Function ContinuousResearch Paper

In an optimal stopping problem the value function VVV and the gain function GGG agree on the stopping set D={V=G}D=\{V=G\}D={V=G}, and V>GV>GV>G on the continuation set CCC. The smooth fit principle says that, at the boundary ∂C\partial C∂C between them, VVV meets GGG with matching first derivatives. Smooth fit is one of the boundary conditions in the free-boundary problems that…

8 thms1 active userReviewed
Control TheoryProbabilityStochastic Systems·Captain: mikedeng1

A Mean Field Game of Optimal Portfolio Liquidation 2: The Value Functions of the Penalized Mean Field Games Converge in L¹ to the Value Function of the Liquidation-Constrained GameResearch Paper

Optimal portfolio liquidation asks how a trader should unwind a position of X\mathcal XX shares over a horizon [0,T][0,T][0,T] when trading moves prices. Since Almgren and Chriss (2001) the standard model charges a quadratic cost ηtξt2\eta_t\xi_t^2ηt​ξt2​ for trading at rate ξt\xi_tξt​ (temporary impact) and a risk penalty λtXt2\lambda_tX_t^2λt​Xt2​ on the open position, and imposes the liquidation…

11 thms1 active userReviewed
Optimal TransportOptimizationProbability·Captain: mikedeng1

Optimal Transport-Based Distributionally Robust Optimization: Structural Properties and Iterative Schemes 5: Worst-Case Displacements √δ G_δ Grow Monotonically in δ Along Straight LinesResearch Paper

A distributionally robust decision evaluates a rule against every data distribution within a specified transport budget of a baseline law. The budget is a modeling choice: increasing it expresses more uncertainty about the data. A robust objective value can increase with that budget, but the value alone does not describe how the adverse distribution…

16 thms1 active userReviewed
ProbabilityStochastic Systems·Captain: mikedeng1

Is Network Traffic Approximated by Stable Lévy Motion or Fractional Brownian Motion? 2: Superposed ON/OFF Input Under Slow Growth Converges (fidi) to α-Stable Lévy MotionResearch Paper

Measurements of Ethernet and Web traffic in the 1990s showed burstiness at every time scale, long-range dependence, and file sizes and transmission times with tails like x−αx^{-\alpha}x−α, 1<α<21<\alpha<21<α<2 (Leland, Taqqu, Willinger and Wilson, 1994; Crovella and Bestavros, 1997). The standard explanation models each user as an ON/OFF source that alternates between…

13 thms1 active userReviewed
ProbabilityStochastic Systems·Captain: mikedeng1

Is Network Traffic Approximated by Stable Lévy Motion or Fractional Brownian Motion? 3: Infinite Source Poisson Input Under Fast Growth Converges in (D[0,∞), J₁) to Fractional Brownian MotionResearch Paper

Measurements of Ethernet and Internet traffic in the 1990s showed that cumulative traffic is self-similar and long-range dependent: correlations of the input rate decay so slowly that they are not summable, and fluctuations at large time scales do not average out the way Poisson-type models predict. A widely accepted explanation is that the lengths of…

13 thms1 active userReviewed
Dynamic ProgrammingOptimization·Captain: mikedeng1

Dynamic Pricing Strategies with Reference Effects I: Under Loss Aversion the Steady States Form an Interval and Optimal Paths ConvergeResearch Paper

Consumers judge a price against a reference price, an internal standard formed from the prices they have seen before. A price below the reference is perceived as a gain and stimulates demand; a price above it is perceived as a loss and depresses demand. Prospect theory (Kahneman and Tversky 1979) adds that losses loom larger than gains of the same size:…

13 thms1 active userReviewed
Dynamic ProgrammingLinear OptimizationOptimization+1·Captain: mikedeng1

On the Choice-Based Linear Programming Model for Network Revenue Management I: The CDLP Is Asymptotically Optimal under Proportional ScalingResearch Paper

Airlines, hotels and railways sell a fixed stock of perishable capacity (seats on flight legs, room-nights) to customers who arrive over a finite selling horizon. Network revenue management decides, at each moment, which products to keep open for sale. In the classical independent-demand model each product has its own demand stream. In practice customers…

7 thms1 active userReviewed
Optimization·Captain: mikedeng1

The d-Level Nested Logit Model: Assortment and Price Optimization Problems II: The Push-Up-Then-Push-Down Prices Converge to a Stationary PointResearch Paper

Retailers that sell many substitutable products must set all their prices at once, and a customer's reaction to one price depends on what else is on the shelf. The nested logit model captures this by grouping similar products into nests, so that raising one price shifts demand mostly to close substitutes. The ddd-level nested logit model extends the familiar…

6 thms1 active userReviewed
Bandit AlgorithmsDynamic ProgrammingStochastic Systems·Captain: mikedeng1

The Complexity of Optimal Queuing Network Control II: Restless Bandits with Deterministic Transitions are PSPACE-hardResearch Paper

Among queueing control problems, a small class admits efficiently computable optimal policies: a single server choosing among several customer streams (Klimov 1974). These problems can be recast as multi-armed bandit problems, whose optimal policies are given by Gittins indices (Gittins 1979), and those indices are computable in polynomial time. The most…

8 thms1 active userReviewed
Dynamic ProgrammingMarkov ChainStochastic Systems·Captain: mikedeng1

The Complexity of Optimal Queuing Network Control I: NETWORK OF QUEUES is EXP-completeResearch Paper

Multiclass queueing networks model manufacturing lines, computer systems and communication networks. In these systems jobs of several types move between shared resources, and a controller decides where to send a job next (routing) and which waiting job a free resource works on (sequencing). The central design question is to find a control policy that…

10 thms1 active userReviewed
Dynamic ProgrammingMarkov ChainProbability·Captain: mikedeng1

Stochastic Dynamic Programming and the Control of Queueing Systems V: The Average Cost Optimality Equation and Value Iteration for Finite State SpacesTextbook

Average cost Markov decision chains model systems that run indefinitely and are judged by their long-run cost per step: admission and routing control in queues, inventory replenishment, machine maintenance. For a finite state space the classical tool is the average cost optimality equation (ACOE)

13 thms1 active userReviewed
OptimizationProbability·Captain: mikedeng1

Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies: Expected Discounted Cost Is Convex in the Base-Stock LevelResearch Paper

In many inventory systems, demand that cannot be met from stock is lost rather than backordered: a customer who finds the shelf empty buys elsewhere. For such lost-sales systems with positive lead times the optimal replenishment policy is known to be complex and to depend on the whole pipeline of outstanding orders (Karlin and Scarf, 1958; Morton, 1969). In…

10 thms1 active userReviewed
Numerical AnalysisOptimization·Captain: mikedeng1

Minimization Methods for Non-Differentiable Functions IX: Convergence of the r-Algorithm with Exact Directional MinimizationTextbook

The r-algorithm of N. Z. Shor is a variable-metric method for minimizing functions that are not differentiable everywhere, such as maxima of smooth functions, penalty functions and Lagrangian dual functions of integer and decomposition problems. It combines a subgradient step with a space dilation along the difference of two successive almost-gradients, and…

7 thms1 active userReviewed
Control TheoryDynamical SystemsProbability+1·Captain: mikedeng1

Stabilization of Hybrid Systems by Feedback Control Based on Discrete-Time State Observations II: Mean-Square and Almost Sure Exponential StabilityResearch Paper

Many engineered systems switch between a finite number of operating modes at random times: a power grid after a line failure, a networked controller whose links drop, a manufacturing plant whose machines break down and are repaired. A standard model for such systems is a hybrid stochastic differential equation, also called an SDE with Markovian switching:…

13 thms1 active userReviewed
Dynamic ProgrammingProbabilityStochastic Systems·Captain: mikedeng1

Exit Problems for Spectrally Negative Lévy Processes and Applications to (Canadized) Russian Options II: Optimal Stopping for the Perpetual Russian OptionResearch Paper

A Russian option is a perpetual American-type claim that pays, when the holder exercises at time τ\tauτ, the maximum of the asset price seen so far, discounted by e−ατe^{-\alpha\tau}e−ατ. It was introduced by Shepp and Shiryaev for the Black–Scholes market (Shepp–Shiryaev 1993), where the underlying log-price is a Brownian motion with drift. Empirical work on asset…

17 thms1 active userReviewed
Dynamic ProgrammingProbabilityStochastic Systems·Captain: mikedeng1

On the Optimal Dividend Problem for a Spectrally Negative Lévy Process II: Optimality of the Double-Barrier Strategy at d* with Bail-Out LoansResearch Paper

An insurance company's surplus in the Cramér–Lundberg model grows linearly with premiums and falls by claims arriving as a compound Poisson process. When premium income exceeds the expected claims, the surplus drifts to infinity. De Finetti (1957) proposed that the surplus above a barrier should instead be paid to shareholders as dividends, and the…

15 thms1 active userReviewed
CombinatoricsOptimization·Captain: mikedeng1

Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows: Some Optimal Solution Traverses Each Pair of Reverse Customer Arcs at Most OnceResearch Paper

Vehicle routing problems ask for minimum-cost vehicle routes that deliver goods from a depot to a set of customers. In the split-delivery vehicle routing problem with time windows (SDVRPTW) a customer's demand may be served by several vehicles, and each customer must be visited inside a prescribed time window. Allowing split deliveries matters in practice:…

6 thms1 active userReviewed
Control TheoryDynamical SystemsProbability+1·Captain: mikedeng1

Stabilization of Hybrid Systems by Feedback Control Based on Discrete-Time State Observations I: Almost Sure Asymptotic StabilityResearch Paper

Many engineered systems switch between a finite number of operating modes at random times: a power grid after a line failure, a networked controller whose links drop, a manufacturing plant whose machines break down and are repaired. A standard model for such systems is a hybrid stochastic differential equation, also called an SDE with Markovian switching:…

13 thms1 active userReviewed
Control TheoryOptimizationProbability+1·Captain: mikedeng1

A General Stochastic Maximum Principle for Optimal Control Problems: The Maximum Principle with First- and Second-Order Adjoint ProcessesResearch Paper

Pontryagin's maximum principle gives necessary conditions for optimality in deterministic optimal control: along an optimal trajectory, the optimal control maximizes (or minimizes) a Hamiltonian built from an adjoint process. For a system driven by Brownian noise the analogous statement was open in full generality for two decades. The difficulty appears…

12 thms1 active userReviewed
Theoretical Computer Science·Captain: Shuze Chen

The 4/3 Conjecture for Metric TSPOpen Problem

The traveling salesman problem — visit nnn cities by the cheapest round trip — is the most widely known problem in combinatorial optimization, and its central open question concerns a linear program. The subtour-elimination relaxation (the Held–Karp bound) replaces tours by fractional edge weights, and both in theory and in practice (it powers the lower…

23 thms1 active userReviewed
PreviousPage 39 of 39Next

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