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

Open936Completed2678All3614
🏆Completed
Optimization·Captain: mikedeng1

On Augmented Lagrangian Methods with General Lower-Level Constraints III: Penalty Parameters Stay Bounded for Equality-Constrained ProblemsResearch Paper

Augmented Lagrangian methods solve a constrained problem by minimizing a sequence of penalized subproblems while updating estimates of the Lagrange multipliers. Each subproblem carries a penalty parameter ρk\rho_kρk​. When ρk\rho_kρk​ grows without bound the subproblems become ill-conditioned and hard to solve, and the method behaves like a plain external penalty…

8 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOptimizationProbability·Captain: mikedeng1

Robust Dynamic Programming 2: The Discounted Robust Value Function Is the Unique Fixed Point of the Robust Bellman OperatorResearch Paper

Markov decision processes model sequential decisions under uncertainty, and their optimal policies are computed from transition probabilities that in practice are estimated from data. Optimal policies can be sensitive to estimation error in those probabilities. Robust dynamic programming replaces each transition law by a set of plausible laws and evaluates…

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

Primal and Dual Linear Decision Rules in Stochastic and Robust Optimization 3: In Multistage Programs, the Primal and Dual Linear Decision Rule Problems Equal the LPs (4.2) and (4.6)Research Paper

A linear multistage stochastic program chooses decisions over TTT stages while a random vector is revealed one piece at a time; each decision may depend only on what has been observed so far. Such programs model production planning, capacity expansion, hydro scheduling and portfolio problems. Computing their optimal value exactly is intractable in general:…

10 thms2 active usersReviewed
🏆Completed
Convex OptimizationFunctional Analysis·Captain: mikedeng1

Optimization of Convex Risk Functions 2: On a Banach Lattice, a Proper Convex Monotone Risk Function Is Continuous and Subdifferentiable on the Interior of Its DomainResearch Paper

Risk-averse stochastic optimization replaces the expected cost E[X]\mathbb E[X]E[X] of an uncertain outcome XXX by a risk function ρ(X)\rho(X)ρ(X): conditional value-at-risk, mean–semideviation and mean–upper-semideviation models, and the coherent and convex risk measures of Artzner, Delbaen, Eber and Heath and of Föllmer and Schied. Ruszczyński and Shapiro, Optimization of…

9 thms2 active usersReviewed
🏆Completed
Convex OptimizationFunctional Analysis·Captain: mikedeng1

Optimization of Convex Risk Functions 1: Dual Representation of a Lower Semicontinuous Convex Risk Function, with Monotonicity, Translation Equivariance and Homogeneity Read Off Its Dual DomainResearch Paper

A risk function assigns to an uncertain cost XXX (a function of the random state ω\omegaω) a single number ρ(X)\rho(X)ρ(X) that a decision maker can minimize. Artzner, Delbaen, Eber and Heath (Math. Finance 9, 1999) singled out four axioms, convexity, monotonicity, translation equivariance and positive homogeneity, and called real-valued functions satisfying all four co…

8 thms2 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Theoretical and Numerical Comparison of Relaxation Methods for Mathematical Programs with Complementarity Constraints 3: Kadrani et al. Relaxation Limits Are M-Stationary under MPEC-CPLDResearch Paper

Mathematical programs with complementarity constraints (MPCCs, also called MPECs) model optimization problems in which some constraints say that, for every index iii, at least one of two nonnegative quantities Gi(x)G_i(x)Gi​(x), Hi(x)H_i(x)Hi​(x) must vanish. They arise in bilevel optimization, Stackelberg games, the design of equilibria in traffic and electricity markets, and…

9 thms2 active usersReviewed
🏆Completed
CombinatoricsLinear Optimization·Captain: mikedeng1

A Branch-and-Cut Algorithm for the Dial-a-Ride Problem: The Generalized Order-Matching Inequality x(H) + Σ x(T_h) ≤ |H| + Σ|T_h| − 2m Is Valid for Every Feasible Route PlanResearch Paper

The dial-a-ride problem (DARP) asks for minimum-cost vehicle routes that carry users from individual pick-up points to individual drop-off points, subject to vehicle capacities, time windows, route durations and a bound on each user's ride time. It models door-to-door transport for elderly and disabled people, shared taxis and on-demand microtransit.…

7 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOptimizationProbability·Captain: mikedeng1

Robust Dynamic Programming 1: The Robust Bellman Recursion and Optimality of Deterministic Markov Policies in Finite HorizonResearch Paper

Markov decision processes assume that the transition law is known exactly. In practice it is estimated from data, and the optimal policy computed for the point estimate can perform badly when the true law differs. Robust dynamic programming replaces each transition law by a set of plausible laws and evaluates a policy by its worst-case expected reward over…

7 thms2 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Stability of Multistage Stochastic Programs: Optimal Values Are Locally Lipschitz in the L_r Distance of the Inputs plus a Filtration DistanceResearch Paper

A multistage stochastic program chooses decisions x1,…,xTx_1, \dots, x_Tx1​,…,xT​ over TTT time periods while a random input ξ1,…,ξT\xi_1, \dots, \xi_Tξ1​,…,ξT​ is revealed one stage at a time; the decision at stage ttt may use what has been observed so far and nothing more. Such models are used for capacity expansion, hydro-thermal power scheduling, asset–liability management and production…

9 thms2 active usersReviewed
🏆Completed
Complexity TheoryTheoretical Computer Science·Captain: wurtle

The approximation threshold for metric k-medianResearch Paper

In metric kkk-median, a finite set JJJ (or DDD) of clients and a finite set FFF of candidate facilities lie in a common finite metric with rational distances. Given an integer k≥1k\ge1k≥1, one opens a nonempty set S⊆FS\subseteq FS⊆F with ∣S∣≤k|S|\le k∣S∣≤k and pays

22 thms2 active usersReviewed
🏆Completed
Theoretical Computer Science·Captain: wurtle

Single-exponential recovery and bounded-price strictness for metric k-medianResearch Paper

In metric kkk-median, a finite set JJJ (or DDD) of clients and a finite set FFF of candidate facilities lie in a common finite metric with rational distances. Given an integer k≥1k\ge1k≥1, one opens a nonempty set S⊆FS\subseteq FS⊆F with ∣S∣≤k|S|\le k∣S∣≤k and pays

25 thms2 active usersReviewed
🏆Completed
Complexity TheoryTheoretical Computer Science·Captain: wurtle

Uniform computation of the squared-logarithmic k-server boundResearch Paper

In the kkk-server problem, kkk labelled servers occupy points of a metric space, requests arrive online, and each request is served by moving one server onto it; the cost is the total distance moved, compared with the offline optimum through the competitive ratio. A companion OpenAI preprint claims that on every metric there exists a randomized policy with…

8 thms2 active usersReviewed
🏆Completed
Theoretical Computer Science·Captain: wurtle

Squared-logarithmic randomized k-server on arbitrary metricsResearch Paper

In the kkk-server problem, kkk servers sit at points of a metric space; requests arrive one at a time, and each request must be served by moving some server onto it, at a cost equal to the distance travelled. An online policy sees only the requests revealed so far, and its quality is measured by its competitive ratio: how much more it moves, in expectation,…

5 thms2 active usersReviewed
🏆Completed
Complexity TheoryTheoretical Computer Science·Captain: wurtle

A Direct Proof of Optimal Max-Cut HardnessResearch Paper

Max-Cut asks for a partition of the vertices of a graph that maximizes the number of edges crossing it. Its decision version is one of Karp's original NP-complete problems, so the natural question is how well it can be approximated in polynomial time. Goemans and Williamson's semidefinite-programming algorithm with random-hyperplane rounding achieves ratio…

11 thms2 active usersReviewed
🏆Completed
AnalysisProbabilityStochastic Systems·Captain: mikedeng1

Law of Large Numbers Limits for Many-Server Queues 1: The Fluid Equations Have at Most One Solution, Given Explicitly by the Age Representation (3.11)Research Paper

Large service systems such as call centers and hospital wards are modelled as many-server queues: NNN identical servers, customers arriving according to a general process, service requirements drawn independently from a general distribution GGG, and a single first-come-first-served queue. When GGG is not exponential the number of customers in system is not…

10 thms2 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Optimization of Convex Risk Functions 3: A Distribution-Invariant Risk Function Is Consistent with the Increasing Convex Order Iff It Is Monotone and Risk AverseResearch Paper

Risk-averse optimization replaces the expected cost E[X]\mathbb E[X]E[X] of a random outcome by a risk function ρ(X)\rho(X)ρ(X) that also penalizes dispersion: mean–deviation, mean–semideviation, conditional value-at-risk (CVaR) and their combinations are the standard examples in stochastic programming and portfolio selection. A decision maker who uses ρ\rhoρ should not…

9 thms2 active usersReviewed
🏆Completed
CombinatoricsProbabilityRandom Matrix Theory·Captain: mikedeng1

Phase Transition of the Largest Eigenvalue for Nonnull Complex Sample Covariance Matrices 4: The Exponential Last Passage Time Has the Law of the Largest Sample EigenvalueResearch Paper

Random growth models and random matrices share limit laws. The first exact instance was found by Johansson (Shape fluctuations and random matrices, Comm. Math. Phys. 2000), who showed that the last passage time of a lattice model with geometric or exponential weights has the law of the largest eigenvalue of a Laguerre (complex Wishart) random matrix. Baik,…

14 thms2 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Mitigating Supply Risk: Dual Sourcing or Process Improvement? 4: The Advantage of Single Sourcing with Improvement over Dual Sourcing Increases in Supplier Cost HeterogeneityResearch Paper

Firms that buy from unreliable suppliers have two broad ways to protect themselves against supply disruptions: dual sourcing, which splits the order between two suppliers so that a shortfall at one is cushioned by the other, and process improvement, which invests in a supplier's operations so that it fails less often. Wang, Gilland and Tomlin, Mitigating…

6 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: mikedeng1

On Metric Generators of Graphs 3: A Connected Minimum T-Join Exists Exactly When μ_G|T Is a Tree Metric Whose Minimal Realization Is a T′-Join Embedding Isometrically in GResearch Paper

A TTT-join of a graph GGG is a set of edges FFF such that exactly the vertices of a prescribed even set TTT have odd degree in FFF. Minimum TTT-joins are a classical object of combinatorial optimization: they contain shortest paths (∣T∣=2|T|=2∣T∣=2), Chinese postman tours and perfect matchings as special cases, and their duality with TTT-cuts connects them to integral multiflows.…

9 thms2 active usersReviewed
🏆Completed
CombinatoricsComplexity TheoryGraph Theory·Captain: mikedeng1

On Metric Generators of Graphs 2: The Gadget Graph of a 3-Dimensional Matching Instance Has a Minimum T-Join With at Most q Components Exactly When a Matching ExistsResearch Paper

Let GGG be a connected graph and TTT a set of vertices of even cardinality. A TTT-join is a set of edges FFF in which exactly the vertices of TTT have odd degree. A TTT-cut is a cut δ(X)\delta(X)δ(X) with ∣X∩T∣|X\cap T|∣X∩T∣ odd. Write τ(G,T)\tau(G,T)τ(G,T) for the minimum size of a TTT-join and ν(G,T)\nu(G,T)ν(G,T) for the maximum number of pairwise disjoint TTT-cuts. Every TTT-cut meets every TTT-join, so …

8 thms2 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Mitigating Supply Risk: Dual Sourcing or Process Improvement? 2: With No Committed Cost, Expected Profit Is Concave in the Supplier's Reliability Index, with an Explicit First-Order ConditionResearch Paper

Supply disruptions — fires, quality failures, capacity shortfalls at a supplier — are a first-order risk in manufacturing supply chains. A buying firm has two broad responses. It can dual source, splitting orders between suppliers so that one supplier's shortfall is partly covered by the other, or it can invest in process improvement at a single supplier…

9 thms2 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Mitigating Supply Risk: Dual Sourcing or Process Improvement? 1: Region-by-Region Optimal Dual-Sourcing Quantities under Random Capacity, Including the Quantity HedgeResearch Paper

Firms that buy from unreliable suppliers face two broad remedies: spread orders across several suppliers (dual sourcing), or invest in making a supplier more reliable (process improvement). Wang, Gilland and Tomlin, Mitigating Supply Risk: Dual Sourcing or Process Improvement? (M&SOM 12(3):489–510, 2010), compare the two in a single newsvendor model in…

8 thms2 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

On Implementing a Primal-Dual Interior-Point Method for Conic Quadratic Optimization III: A Newton Step Scales the Homogeneous Residuals and the Complementarity Gap by 1 − α(1 − γ)Research Paper

Conic quadratic optimization — linear optimization over products of quadratic (second-order, Lorentz) cones — covers robust linear programming, portfolio problems with risk constraints, norm minimization and many engineering design problems. Andersen, Roos and Terlaky describe the primal-dual interior-point method implemented in the MOSEK optimizer for this…

9 thms2 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Supply Chain Coordination Under Channel Rebates with Sales Effort Effects III: Returns Alone, Linear Rebates Alone or Target Rebates Alone Cannot Coordinate Effort and QuantityResearch Paper

Manufacturers of computer hardware, software and automobiles routinely pay channel rebates to their retailers: a payment for each unit the retailer sells to end customers, either for every unit (a linear rebate) or only for units beyond a target (a target rebate). In the same industries manufacturers also accept returns, crediting the retailer for unsold…

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

Models for Minimax Stochastic Linear Optimization Problems with Risk Aversion 4: With Random Right-Hand Side and Known Dual Extreme Points, a Distribution in 𝒫 Attains Ẑ(x) = Ẑ_DD(x)Research Paper

Two-stage stochastic linear programs model decisions taken before uncertainty is revealed (a first-stage plan xxx) followed by a corrective recourse action once it is. The classical model needs the full probability distribution of the uncertain data. In practice usually only estimates of a few moments are available, and the computed plan can be sensitive to…

10 thms2 active usersReviewed
PreviousPage 90 of 108Next

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