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

Globally Convergent Inexact Newton Methods I: Inexact Newton Backtracking Converges to Every Limit Point Where F′ Is Invertible, That Point Is a Zero of F, and Initial Steps Are Eventually AcceptedResearch Paper

Newton's method for a nonlinear system F(x)=0F(x) = 0F(x)=0, with F:Rn→RnF:\mathbb R^n\to\mathbb R^nF:Rn→Rn, solves the linear system F′(xk)sk=−F(xk)F'(x_k)s_k = -F(x_k)F′(xk​)sk​=−F(xk​) at every step. For large systems that solve is itself iterative (a Krylov method such as GMRES), and it is stopped early. The resulting inexact Newton methods, introduced by Dembo, Eisenstat and Steihaug (SIAM J. Numer. Anal. 19…

12 thms3 active usersReviewed
🏆Completed
ProbabilityStochastic Systems·Captain: mikedeng1

Shock Models and Wear Processes I: Under Poisson Shocks, Cumulative Nonnegative I.I.D. Damage up to a Fixed Threshold Gives an IHRA Life DistributionResearch Paper

Reliability theory classifies life distributions by how they age. The IHRA class (increasing hazard rate average) is the smallest class of life distributions that contains the exponential distributions and is closed under forming coherent systems and taking limits in distribution (Birnbaum, Esary and Marshall 1966). It is therefore the natural class for the…

8 thms3 active usersReviewed
🏆Completed
OptimizationProbabilityStatistics·Captain: mikedeng1

Statistics of Robust Optimization: A Generalized Empirical Likelihood Approach 3: Robust Optimal Values and Solution Sets over f-Divergence Balls Are ConsistentResearch Paper

Stochastic optimization asks for a decision xxx in a set X⊂Rd\mathcal X\subset\mathbb R^dX⊂Rd that minimises an expected loss EP0[ℓ(x;ξ)]E_{P_0}[\ell(x;\xi)]EP0​​[ℓ(x;ξ)] when the distribution P0P_0P0​ of the data ξ\xiξ is known only through a sample ξ1,…,ξn\xi_1,\dots,\xi_nξ1​,…,ξn​. The classical estimator, sample average approximation, replaces P0P_0P0​ by the empirical distribution P^n\widehat P_nPn​. Distributionally…

16 thms3 active usersReviewed
🏆Completed
Convex OptimizationOptimizationProbability·Captain: mikedeng1

Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints 1: Under Normality, the E-Model Chance Constraints Are Equivalent to the Convex Program (29)Research Paper

Chance-constrained programming replaces a linear program max⁡c′x\max c'xmaxc′x subject to Ax≤bAx\le bAx≤b by a problem in which some data are random and each constraint only has to hold with a prescribed probability. Charnes and Cooper introduced the idea in 1959 for scheduling heating-oil production against weather-dependent demand, and the formulation is now a standard…

10 thms3 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: mikedeng1

On Representatives of Subsets: Two Partitions into m Classes Have a Common System of Representatives When Any k Classes of One Meet at Least k Classes of the OtherResearch Paper

Many assignment questions reduce to one combinatorial question: given finitely many sets, can one choose a different element from each? Workers are matched to jobs they are qualified for, rows of a matrix to columns with nonzero entries. The criterion for when this is possible is Hall's marriage theorem, first stated and proved by P. Hall in a five-page…

8 thms3 active usersReviewed
🏆Completed
CombinatoricsOptimization·Captain: mikedeng1

Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey 2: The Optimal Preemptive Open Shop Makespan Equals the Largest Machine Load or Job LengthResearch Paper

Open shops model production and service systems in which every job must visit every machine, but the order of the visits is free: a car that needs an inspection, a wash and a tyre change, a patient who needs several tests, a student who sits several exams. The survey of Graham, Lawler, Lenstra and Rinnooy Kan (Ann. Discrete Math. 5, 1979) fixed the…

9 thms3 active usersReviewed
🏆Completed
CombinatoricsOptimization·Captain: mikedeng1

Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey 1: The Optimal Two-Machine Open Shop Makespan Is max{T₁, T₂, maxⱼ(aⱼ + bⱼ)}Research Paper

Shop scheduling asks how to sequence jobs that each need processing on several machines. In an open shop, a job's operations may be executed in any order, as in testing stations, repair bays, or classroom and examination timetables, where the order in which a candidate visits the stations is irrelevant. The objective studied here is the makespan Cmax⁡C_{\max}Cmax​,…

9 thms3 active usersReviewed
🏆Completed
Stochastic Systems·Captain: mikedeng1

Extensions of the Queueing Relations L = λW and H = λG: Under (14) and (15) the Time Average H(t) Converges if and only if the Customer Average G(s) Does, and Then H = λGResearch Paper

Queueing results often relate an average accumulated over customers to an average accumulated over time. In the familiar relation L=λWL=\lambda WL=λW, the long-run average number in a system equals the arrival rate times the average time spent there. Glynn and Whitt study a broader relation, H=λGH=\lambda GH=λG, that can represent queue lengths and waiting times but also…

9 thms3 active usersReviewed
🏆Completed
Linear OptimizationProbability·Captain: mikedeng1

A Re-solving Heuristic with Uniformly Bounded Loss for Network Revenue Management 2: Frequent Re-solving Loses at Most O(√T) Against the Deterministic LP, Uniformly in the CapacitiesResearch Paper

Network revenue management is the problem of selling several limited, perishable resources (seats on flight legs, hotel room-nights, machine hours) to customers who arrive over time and each want a fixed bundle of them. A seller who accepts every request early may run out of the resources that the most valuable later customers need, and a seller who is too…

9 thms3 active usersReviewed
🏆Completed
Linear OptimizationOptimization·Captain: mikedeng1

On the Relation Between Integer and Noninteger Solutions to Linear Programs: Deep in the Optimal-Basis Cone, z₂(b) = z₁(b) + φ(b) and the Group Problem Gives an Integer OptimumResearch Paper

An integer program is a linear program whose variables must take integer values. Its linear relaxation can be solved efficiently, while the integer program itself is NP-hard in general, so a recurring question in integer programming is how much the optimal solution of the relaxation says about the integer optimum. Simple rounding of the fractional optimum…

11 thms3 active usersReviewed
🏆Completed
ProbabilityStatistics·Captain: mikedeng1

Residual Life Time at Great Age 1: Every Nondegenerate Limit Law of the Normed Residual Life Time Is of Type Π, Π_γ, Γ_α or Γ_{γ,α}Research Paper

A component with a random lifetime XXX that has survived to age ttt still has a random residual life time X−tX - tX−t. Reliability engineering, actuarial science and the statistics of exceedances over high thresholds all ask how the conditional law of X−tX - tX−t given X>tX > tX>t behaves when the age ttt is large. If XXX is exponential, the residual life has the same law at every…

10 thms3 active usersReviewed
🏆Completed
ProbabilityStatistics·Captain: mikedeng1

Simulation Output Analysis Using Standardized Time Series 1: For Every g in the Class 𝓜, (Ȳₙ(1) − μ)/g(Ȳₙ) ⇒ B(1)/g(B) Under the FCLT (2.1)Research Paper

A discrete-event simulation of a queue, an inventory system or a communication network produces an output process Y={Y(t):t≥0}Y = \{Y(t) : t \ge 0\}Y={Y(t):t≥0}, and the quantity of interest is usually its steady-state mean μ\muμ, the long-run average of YYY. The natural estimator is the time average Yˉn(1)=1n∫0nY(s) ds\bar Y_n(1) = \frac1n\int_0^n Y(s)\,dsYˉn​(1)=n1​∫0n​Y(s)ds of a run of length nnn. A confidence interval…

6 thms3 active usersReviewed
🏆Completed
Graph TheoryLinear Optimization·Captain: mikedeng1

A Suggested Computation for Maximal Multi-Commodity Network Flows: With Nonnegative Simplex Multipliers, Shortest-Chain Labels Prove the Arc-Chain Basis Optimal or Find an Entering ChainResearch Paper

The maximal multi-commodity flow problem asks how much total flow several commodities, each travelling from its own sources to its own sinks, can send through a network whose arcs have shared capacities. It arises in communication and transportation planning: Kalaba and Juncosa's 1956 study of communication networks (Management Science 3(1)) leads to linear…

12 thms3 active usersReviewed
🏆Completed
Analysis·Captain: mikedeng1

A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem II: Under Linear Arc Delay αx(t) + β the Arc Exit Time Is Strictly Increasing (FIFO Holds)Research Paper

Dynamic traffic assignment models how commuters choose routes and departure times when travel times change over the day. In the model of Friesz, Bernstein, Smith, Tobin and Wie (Oper. Res. 41 (1993)), the time to traverse a path is built recursively from arc exit-time functions: a vehicle that enters an arc at time ttt leaves it at time τ(t)\tau(t)τ(t). The…

7 thms3 active usersReviewed
🏆Completed
Optimal TransportProbabilityStatistics·Captain: mikedeng1

Data-Driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulations III: Asymptotic Consistency of Wasserstein Robust SolutionsResearch Paper

Many decisions in operations research and machine learning minimize an expected cost EP[h(x,ξ)]\mathbb E^{P}[h(x,\xi)]EP[h(x,ξ)] whose distribution PPP is unknown and is seen only through NNN independent samples. The sample-average approximation replaces PPP by the empirical distribution and is known to produce decisions with poor out-of-sample performance when NNN is small. Distributi…

15 thms3 active usersReviewed
🏆Completed
Convex OptimizationOptimal TransportOptimization·Captain: mikedeng1

Data-Driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulations II: Worst-Case Distributions from a Finite Convex ProgramResearch Paper

In data-driven stochastic optimization a decision maker knows the distribution of an uncertain parameter ξ\xiξ only through NNN samples ξ^1,…,ξ^N\hat\xi_1,\dots,\hat\xi_Nξ^​1​,…,ξ^​N​. Wasserstein distributionally robust optimization hedges against this ignorance by evaluating a loss ℓ\ellℓ under the worst distribution in a ball, measured in the Wasserstein metric, around the…

17 thms3 active usersReviewed
🏆Completed
Algorithmic Game Theory·Captain: mikedeng1

Perfect Equilibrium in a Bargaining Model: The Perfect Equilibrium Partitions Are the Nonempty Closed Intervals A = Δ₁ and B = Δ₂ = A − εResearch Paper

Alternating-offer bargaining asks how an agreement is selected when two people can keep making proposals until one accepts. A prediction based only on behavior at the start may rely on threats that would no longer be sensible after a rejection. Ariel Rubinstein's 1982 paper studies strategies after every possible sequence of offers and gives a…

14 thms3 active usersReviewed
🏆Completed
Convex OptimizationOptimal TransportOptimization·Captain: mikedeng1

Data-Driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulations I: Wasserstein Worst-Case Expectations as Finite Convex ProgramsResearch Paper

A decision maker who must minimize an expected cost EP[h(x,ξ)]\mathbb E^{\mathbb P}[h(x,\xi)]EP[h(x,ξ)] rarely knows the distribution P\mathbb PP of the uncertain parameter ξ\xiξ; usually only NNN samples ξ^1,…,ξ^N\hat\xi_1,\dots,\hat\xi_Nξ^​1​,…,ξ^​N​ are available. Replacing P\mathbb PP by the empirical distribution (sample average approximation) tends to produce decisions that perform poorly out of…

17 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingLinear OptimizationProbability·Captain: mikedeng1

On the Convergence of Stochastic Dual Dynamic Programming and Related Methods: DOASA Reaches an Optimal Policy in Finitely Many Iterations Almost SurelyResearch Paper

Stochastic dual dynamic programming (SDDP), introduced by Pereira and Pinto in 1991, is the standard method for multistage stochastic linear programs with many stages, such as hydro-thermal scheduling and long-term energy planning. It approximates each stage's expected future cost from below by the maximum of finitely many linear functions (cuts), built…

10 thms3 active usersReviewed
🏆Completed
ProbabilityStochastic Systems·Captain: mikedeng1

Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions 2: Geometric Convergence Rate of the Random Directions Algorithm to UniformResearch Paper

Generating points uniformly distributed over a bounded region S⊆RnS\subseteq\mathbb R^nS⊆Rn is a basic subroutine in Monte Carlo integration, in estimating the volume of a region, in randomized search for optimization, and in identifying redundant constraints of mathematical programs. When SSS is given only implicitly, for instance by a system of inequalities, the…

10 thms3 active usersReviewed
🏆Completed
ProbabilityStochastic Systems·Captain: mikedeng1

Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions 1: Symmetric Mixing Algorithms Converge to the Uniform Distribution from Every Starting PointResearch Paper

Sampling uniformly from a bounded region can be difficult when direct transformation of a familiar random variable is unavailable and rejection sampling spends most of its trials outside the region. Robert L. Smith studied procedures that move within the region: from the current point, choose a direction, form the line set through that point inside the…

8 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryMechanism DesignOptimization·Captain: mikedeng1

Optimal Auction Design: Giving the Object to a Bidder with the Highest Priority Level c̄ᵢ(tᵢ) ≥ t₀ and Charging (6.8) Is an Optimal Auction MechanismResearch Paper

A seller with one indivisible object must decide whether to keep it or transfer it to one of several bidders whose values she does not observe. The allocation and the payment rule affect what bidders choose to report. Myerson's 1981 paper identifies a revenue-maximizing rule when bidders' private value estimates are independent, their densities are…

13 thms3 active usersReviewed
🏆Completed
CombinatoricsDynamic ProgrammingGraph Theory·Captain: mikedeng1

The Complexity of Markov Decision Processes IV: In a Deterministic Process a Cheapest T-Arc Walk Is a Walk of Fewer Than n³ Arcs Plus One Repeated CycleResearch Paper

Finite-horizon Markov decision processes ask which decisions minimize accumulated cost over a specified number of stages. In a stationary process, the same costs and transitions apply at every stage. This compact input can describe a horizon TTT much larger than the state set, so a method that processes all TTT stages one by one may take time exponential in the…

6 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryOptimization·Captain: mikedeng1

The Bargaining Problem: The Nash Product Maximizer Is the Unique Solution Satisfying Invariance, Symmetry, IIA and Pareto EfficiencyResearch Paper

Two parties who can cooperate for mutual benefit must still agree on how to share the benefit. In The Bargaining Problem (Econometrica, 1950) John Nash asked which agreement two rational bargainers of equal skill should reach. His answer is not a model of haggling: it is a list of conditions any reasonable rule should satisfy, together with a proof that…

10 thms3 active usersReviewed
🏆Completed
CombinatoricsProbabilityTheoretical Computer Science·Captain: mikedeng1

An Optimal Algorithm for On-line Bipartite Matching 2: No Randomized On-line Algorithm Guarantees an Expected Matching Larger Than n(1 − 1/e) + o(n)Research Paper

An online matching algorithm must commit to each assignment when a request arrives, before it sees later requests. This limitation arises whenever waiting for the full instance is impossible: an available resource can be assigned to a current request or saved for an unknown future request. The quality of the assignment is measured by how many requests can…

9 thms3 active usersReviewed
PreviousPage 54 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