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,672 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

Open942Completed2672All3614
🏆Completed
Optimal TransportOptimizationProbability·Captain: mikedeng1

Sinkhorn Distributionally Robust Optimization 1: Strong Duality — the Worst-Case Expectation over a Sinkhorn Ball Equals inf over λ ≥ 0 of λρ̄ + λε·E log E_Q[e^{f/(λε)}]Research Paper

Distributionally robust optimization (DRO) hedges a decision against uncertainty in the data distribution. It minimizes the worst-case expected loss over an ambiguity set of distributions around a nominal one, typically the empirical distribution of the data. Ambiguity sets built from the Wasserstein (optimal-transport) distance are standard in operations…

12 thms2 active usersReviewed
🏆Completed
Linear OptimizationOptimization·Captain: mikedeng1

Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach 3: Variable-Right-Hand-Side Production Cuts along a Precedence Chain Are ValidResearch Paper

Strategic open pit mine planning decides which parts of an ore body are excavated, in which period, and where each block of material is sent: to a processing plant, a stockpile or a waste dump. Rivera Letelier, Espinoza, Goycoolea, Moreno and Muñoz (Operations Research 68(5), 2020) state the problem as a mixed-integer program, the precedence-constrained…

7 thms2 active usersReviewed
🏆Completed
Optimal TransportOptimizationProbability·Captain: mikedeng1

Distributionally Robust Stochastic Optimization with Wasserstein Distance: If the Growth Rate κ of Ψ Is Finite, sup{E_μ[Ψ] : W_p(μ, ν) ≤ θ} Equals Its One-Dimensional Dual and Is FiniteResearch Paper

Distributionally robust stochastic optimization (DRSO) chooses a decision xxx to minimize the worst expected loss sup⁡μ∈MEμ[Ψ(x,ξ)]\sup_{\mu\in\mathfrak M}\mathbb E_\mu[\Psi(x,\xi)]supμ∈M​Eμ​[Ψ(x,ξ)] over an ambiguity set M\mathfrak MM of probability distributions, instead of the expectation under one estimated distribution. When M\mathfrak MM is a ball around a nominal distribution ν\nuν (often the…

16 thms2 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Trade Credit, Risk Sharing, and Inventory Financing Portfolios: The Optimal Contract Always Uses Trade Credit, with Net Terms for Costless Default or High Cash and Two-Part Terms for Low CashResearch Paper

Most business-to-business sales are not paid in cash on delivery. The supplier lets the buyer pay later, which is trade credit, and often offers a discount for paying early. In the classic "2/10 net 30" the buyer gets 2% off for paying within 10 days and otherwise owes the full price in 30 days. Trade credit is a major source of short-term finance for…

9 thms2 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Multistage Adaptive Robust Optimization for the Unit Commitment Problem I: Without Ramping Constraints, Two-Stage and Multistage Robust Unit Commitment Are EquivalentResearch Paper

Unit commitment (UC) is the day-ahead decision of an electricity system operator: which generators to switch on in each hour of the next day, and how much each of them should produce. System operators solve UC problems every day, and their cost and reliability are first-order concerns of power-system operations. With a large share of wind and solar…

10 thms2 active usersReviewed
🏆Completed
OptimizationProbabilityStatistics·Captain: mikedeng1

Residuals-based distributionally robust optimization with covariate information 2: Sample Robust and Same-Support ER-DRO Converge at the Rate O_p(n^(−r/2))Research Paper

In many operational problems the decision zzz is taken after observing covariates xxx (weather, calendar, prices) that carry information about an uncertain quantity YYY (demand, yield, return). The target is the conditional stochastic program: minimize E[c(z,Y)∣X=x]\mathbb E[c(z,Y)\mid X=x]E[c(z,Y)∣X=x] over a feasible set Z\mathcal ZZ. Kannan, Bayraksan and Luedtke (Math. Program. 2023)…

9 thms2 active usersReviewed
🏆Completed
Optimal TransportOptimizationProbability·Captain: mikedeng1

A Short and General Duality Proof for Wasserstein Distributionally Robust Optimization III: Under a Tight Nominal Measure, f(x) − λd(x̂, x)^p Satisfies the Interchangeability PrincipleResearch Paper

Wasserstein distributionally robust optimization (DRO) replaces the expected loss under a nominal distribution P^\widehat{\mathbb P}P (typically an empirical distribution) by the worst expected loss over all distributions within a given optimal-transport distance of P^\widehat{\mathbb P}P. Its tractability rests on a strong duality theorem that turns a supremum…

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

Distributionally Robust Convex Optimization I: Under the Nesting Condition, a Worst-Case Expectation Constraint over a Standardized Ambiguity Set Is Equivalent to a Finite Conic SystemResearch Paper

A constraint E[v(x,z~)]≤w\mathbb E[v(x,\tilde z)] \le wE[v(x,z~)]≤w on a decision xxx requires the distribution of the random vector z~\tilde zz~. In practice that distribution is known only partially: its support, a few moments, or the probability mass of some regions estimated from data. Distributionally robust optimization asks that the constraint hold for every distribution…

7 thms2 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Distributionally Robust Convex Optimization IV: An Absolute Mean Spread Bound Describes Exactly the z̃-Marginals of a Lifted Ambiguity SetResearch Paper

Distributionally robust optimization handles an uncertain parameter z~∈RP\tilde z\in\mathbb R^Pz~∈RP whose distribution is only partly known. A decision must satisfy an expectation constraint for every distribution in an ambiguity set, the set of distributions consistent with the available information. Wiesemann, Kuhn and Sim (Optimization Online preprint 3757, 2013; …

12 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingMarkov ChainOptimization·Captain: mikedeng1

Robust Markov Decision Processes 1: Over s-Rectangular Ambiguity Sets, Robust Policy Improvement Is Solved by a Stationary Randomized Policy and the Fixed Point of the Robust Bellman MapResearch Paper

A Markov decision process (MDP) is evaluated with a transition kernel that, in practice, is estimated from data. The expected total reward of a policy can be very sensitive to small errors in that estimate (Mannor, Simester, Sun and Tsitsiklis, 2007). Robust MDPs address this by letting the kernel range over an ambiguity set and optimizing the worst-case…

14 thms2 active usersReviewed
🏆Completed
CombinatoricsOptimization·Captain: mikedeng1

Closing the Gap for Makespan Scheduling via Sparsification Techniques: A Feasible Configuration IP Has a Thin Solution, Support at Most 4(d+1)log(4(d+1)T), Complex Configurations Used at Most OnceResearch Paper

Makespan minimization on identical parallel machines, P∥Cmax⁡P\|C_{\max}P∥Cmax​, asks to assign nnn jobs with processing times to mmm machines so that the largest machine load is as small as possible. It is strongly NP-hard, and the question has long been how fast a (1+ε)(1+\varepsilon)(1+ε)-approximate schedule can be found. After rounding and scaling, a guess TTT of the optimal…

7 thms2 active usersReviewed
🏆Completed
Algorithmic Game Theory·Captain: mikedeng1

Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games 2: Generalized Weighted Shapley Value Rules Yield Generalized Weighted Potential GamesResearch Paper

In a welfare sharing game, several players choose resources and receive shares of each resource's welfare. A rule for splitting welfare is useful only if the resulting players' incentives admit stable choices. The paper by Gopalakrishnan, Marden, and Wierman characterizes the distribution rules that guarantee a pure Nash equilibrium for every game formed…

7 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOptimization·Captain: mikedeng1

Information Sharing in Competing Supply Chains with Production Cost Reduction: Under Cournot Competition Both Chains Share Below k_N, Both or Neither Between k_N and k_S, and Neither Above k_SResearch Paper

Retailers observe demand signals (point-of-sale data, local forecasts) that their suppliers do not. Whether a retailer should pass such a signal upstream is a central question of the supply chain information-sharing literature. In a single chain, sharing helps the manufacturer plan, but the retailer may lose from it. Competition between chains adds a second…

12 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryCombinatoricsProbability·Captain: mikedeng1

Online Contention Resolution Schemes with Applications to Bayesian Selection Problems 4: Intersecting the Families of (b, c₁)- and (b, c₂)-Selectable Greedy OCRSs Is (b, c₁c₂)-SelectableResearch Paper

Online selection problems ask an algorithm to accept or reject elements as they arrive, while keeping the accepted set feasible. The decisions are irrevocable, and the arrival order can be chosen after the random activity of the elements is known. A guarantee for one constraint is therefore useful only if it remains meaningful when several constraints apply…

15 thms2 active users
🏆Completed
Algorithmic Game TheoryFunctional Analysis·Captain: mikedeng1

Stochastic Graphon Games: I. The Static Case 2: Under Condition (17) the Unique Nash Equilibrium of a Graphon Game Moves by at Most κ‖W − W′‖ When the Graphon ChangesResearch Paper

Large network games can be described by a graphon, a measurable kernel that assigns an interaction weight to each pair of players in a continuum. This representation is useful when a finite network is viewed as an approximation to a limiting network. A basic question is whether a small change in interaction weights can cause a large change in equilibrium…

8 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryTheoretical Computer Science·Captain: mikedeng1

Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs III: Under a Consistent Allocation Rule, (α, β)-Balanced Prices Are Closed Under Maxima of ValuationsResearch Paper

Posted prices turn an offline allocation problem into a sequential choice process: each agent sees a menu of outcomes and prices, then chooses an outcome without revealing its full valuation. The balanced prices framework of Dütting, Feldman, Kesselheim, and Lucier gives welfare guarantees by comparing the revenue collected from an allocation with the…

7 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingMarkov ChainProbability·Captain: mikedeng1

Partially Observable Total-Cost Markov Decision Processes with Weakly Continuous Transition Probabilities 2: Setwise-Continuous Observations Do Not Make the Belief Transition Weakly ContinuousResearch Paper

A partially observable Markov decision process describes a controlled system whose state is hidden but whose observations are available to a decision maker. The distribution of the hidden state conditional on the observations is the belief state. Replacing the hidden state by this distribution turns the model into a fully observed decision process, provided…

6 thms2 active usersReviewed
🏆Completed
OptimizationProbabilityStatistics·Captain: mikedeng1

Robust Sample Average Approximation 1: A Data-Driven DRO Converges in Objective, Optimal Value and Optimal Solutions for Every Admissible Cost If and Only If Its Test Is Uniformly ConsistentResearch Paper

A decision maker who must choose xxx to minimize an expected cost EF[c(x;ξ)]\mathbb E_F[c(x;\xi)]EF​[c(x;ξ)] rarely knows the distribution FFF of the uncertain parameter ξ\xiξ; what is available is a sample ξ1,…,ξN\xi^1,\dots,\xi^Nξ1,…,ξN. Sample average approximation (SAA) replaces FFF by the empirical distribution. Data-driven distributionally robust optimization (DRO) instead minimizes the worst…

9 thms2 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

On the Heavy-Tail Behavior of the Distributionally Robust Newsvendor 2: Below the Critical Ratio η₀ = 1 − (m₁^α/m_α)^{1/(α−1)} the Robust Newsvendor Orders Nothing; Above It Orders at Least q₀Research Paper

The newsvendor problem is the basic single-period inventory decision: a retailer orders q≥0q\ge0q≥0 units at unit cost ccc before a random demand d~\tilde dd~ is observed, sells at unit price p>cp>cp>c, and loses unsold units. When the demand law is known, the optimal order is a quantile of that law. In practice the law is rarely known, and a distributionally robust newsvendo…

6 thms2 active usersReviewed
🏆Completed
Mechanism DesignProbability·Captain: mikedeng1

Pricing and Matching with Forward-Looking Buyers and Sellers 3: Every Incentive-Compatible Two-Sided Dynamic Mechanism Earns at Most the Expected Virtual-Surplus Assignment ValueResearch Paper

Ride-hailing, freelancing and delivery platforms are intermediaries that post a price to buyers and a price to sellers and then match the two sides. Both sides are forward-looking: an agent who arrives can wait before requesting, and an agent who requests waits until she is matched, at a cost per unit of time. Chen and Hu, Pricing and Matching with…

9 thms2 active usersReviewed
🏆Completed
Mechanism DesignProbabilityStochastic Systems·Captain: mikedeng1

Pricing and Matching with Forward-Looking Buyers and Sellers 1: Waiting-Adjusted Fixed Prices with Greedy Matching Earn at Least 1 − (1 + 2(b+h)T/(3(p*−w*)))/√µ* of the Fluid Profit BoundResearch Paper

An intermediary such as a ride platform must attract buyers and sellers who arrive at different times. A buyer may wait for a seller; a seller may wait for a buyer. Both sides can choose when to request a match, so an ask price and a bid price affect participation as well as the intermediary's margin. Chen and Hu study whether a simple posted-price policy…

12 thms2 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Pricing and Matching with Forward-Looking Buyers and Sellers 2: Both Fixed Prices Rise with the Buyer Arrival Rate and Fall with the Seller Arrival Rate; Matches and Fluid Profit Rise with BothResearch Paper

Two-sided intermediaries charge buyers and pay sellers while trying to match the two groups. A larger arrival stream on one side changes both the number of possible matches and the prices that clear the market. Chen and Hu study this in a model of buyers and sellers who arrive over time and may wait before requesting a match. Their market-size theorem…

8 thms2 active usersReviewed
🏆Completed
Partial Differential EquationsProbabilityStochastic Systems·Captain: mikedeng1

Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin-Whitt Regime 2: The JSQ Diffusion Limit Satisfies a Foster-Lyapunov Drift ConditionResearch Paper

Join-the-shortest-queue (JSQ) is the basic load-balancing rule for a system of nnn parallel single-server queues: every arriving customer joins a queue of minimal length. It is optimal in several senses for homogeneous servers and is the reference policy against which cheaper rules (power-of-ddd choices, join-the-idle-queue) are measured. In the Halfin–Whitt…

9 thms2 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Semismooth and Semiconvex Functions in Constrained Optimization III: With Semiconvex Problem Functions, a Stationary Point Is Optimal Unless There Is No Strictly Feasible PointResearch Paper

Many constrained optimization problems in operations research have objective and constraint functions that are continuous but not differentiable: maxima of finitely many smooth functions, value functions of inner optimization problems, piecewise-linear costs. For such problems the classical Karush–Kuhn–Tucker theory does not apply directly, and algorithms…

10 thms2 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Retail Assortment Planning in the Presence of Consumer Search IV: Under Overlapping-Assortment Search, the Full Assortment Is Optimal Once Search Is Cheap EnoughResearch Paper

A retailer that decides which variants of a product to stock (its assortment) trades off the revenue each variant brings against the operational cost of carrying it. The classical model of this trade-off uses the multinomial logit (MNL) model of consumer choice: a consumer who does not like what the store offers simply buys nothing (van Ryzin & Mahajan 1999)…

10 thms2 active usersReviewed
PreviousPage 87 of 107Next

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