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
Linear OptimizationProbabilityTheoretical Computer Science·Captain: mikedeng1

Competitive Randomized Algorithms for Nonuniform Problems IV: The Optimal Randomized Two-Server Ratio 1652/1069 on the 3-4-5 TriangleResearch Paper

The kkk-server problem is a basic model of on-line decision making. kkk mobile servers move in a metric space, requests for points arrive one at a time, and each request has to be covered by a server before the next one arrives. The cost is the total distance the servers move. The problem includes paging, caching and disk-head scheduling as special cases (Manass…

7 thms4 active usersReviewed
🏆Completed
Linear OptimizationProbabilityTheoretical Computer Science·Captain: mikedeng1

Competitive Randomized Algorithms for Nonuniform Problems I: Optimal Competitiveness of Randomized Block Snoopy CachingResearch Paper

In a shared-memory multiprocessor, each processor keeps copies of memory blocks in its own cache, and all caches listen ("snoop") on a common bus. Every bus cycle spent keeping these copies consistent is a cycle not available for useful work, so the protocol that decides when a block is shared by several caches and when it is private to one cache directly…

8 thms4 active usersReviewed
🏆Completed
Convex OptimizationOptimizationProbability·Captain: mikedeng1

Random Gradient-Free Minimization of Convex Functions III: Accelerated Random SearchResearch Paper

Many optimization problems in engineering, simulation-based design and machine learning give access only to function values: the objective is the output of a simulator or a black-box program, and its gradient is unavailable or too expensive. Derivative-free (or zeroth-order) methods address this setting. Nesterov and Spokoiny (Found. Comput. Math. 17 (2017))…

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

Random Gradient-Free Minimization of Convex Functions II: Random Gradient Descent for Smooth and Strongly Convex ProblemsResearch Paper

Many optimization problems in engineering, simulation-based design and machine learning give access to the objective only through its values: the function is computed by a black-box code, and derivatives are unavailable or too expensive to program. Zeroth-order (derivative-free) methods address this setting. Classical derivative-free methods (pattern…

14 thms4 active usersReviewed
🏆Completed
Convex OptimizationOptimizationProbability·Captain: mikedeng1

Random Gradient-Free Minimization of Convex Functions I: Random Search for Nonsmooth Convex ProblemsResearch Paper

Many optimization problems in engineering, simulation-based design and machine learning give access to the values of an objective function but not to its gradient: the function is computed by a black-box program, by a simulator, or by a model whose derivatives are unavailable or too expensive. Zeroth-order (or derivative-free) methods use only function…

14 thms4 active usersReviewed
🏆Completed
CombinatoricsOptimizationProbability·Captain: mikedeng1

The Distributionally Robust Chance-Constrained Vehicle Routing Problem I: With a Subadditive Demand Estimator the Two-Index Vehicle Flow Formulation Is ExactResearch Paper

The capacitated vehicle routing problem (CVRP) asks for delivery routes of minimum cost. Each route starts and ends at a depot, every customer is visited exactly once, and the demand served on a route does not exceed the vehicle capacity. The problem is central in logistics and one of the most studied problems in combinatorial optimization. Its standard…

12 thms4 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine LearningProbability+1·Captain: mikedeng1

Optimal Best Arm Identification with Fixed Confidence III: δ-PAC Guarantee of Chernoff's Stopping Rule for Bernoulli BanditsResearch Paper

In best arm identification with fixed confidence, a learner samples KKK unknown distributions ("arms") one at a time, and must eventually stop and name the arm with the largest mean, with an error probability at most a prescribed risk δ\deltaδ, while using as few samples as possible. The problem goes back to the sequential design of experiments (Chernoff, 1959;…

10 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryMechanism DesignOptimization·Captain: mikedeng1

Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders IV: A Truthful Value-Query Mechanism for Subadditive BiddersResearch Paper

In a combinatorial auction a seller offers several indivisible items at once, and bidders value bundles of items rather than items one at a time. Allocating the items to maximize total value is the central optimization problem of the area, and it arises in spectrum licensing, procurement and transport contracting (Cramton, Shoham and Steinberg, Combinatorial…

8 thms4 active usersReviewed
🏆Completed
Control TheoryDynamic ProgrammingOptimization·Captain: mikedeng1

Robust Control of Markov Decision Processes with Uncertain Transition Matrices 2: The Robust Bellman Recursion for Discounted Infinite-Horizon MDPsResearch Paper

A Markov decision process (MDP) is solved by dynamic programming only when its transition probabilities are known. In practice they are estimated from data, and the optimal policy of the estimated model can perform badly on the true one. Nilim and El Ghaoui (Oper. Res. 53(5), 2005) showed that, when the uncertainty on the transition matrices has a product…

10 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingOptimizationProbability·Captain: Shuze Chen

Markov Decision Processes XVIII: Terminal Wealth in Jump Markets and Trade ExecutionTextbook

Two problems in this mission, both about markets that do not behave the way the textbook Black–Scholes market does, and both solved by the same technique.

10 thms4 active usersReviewed
🏆Completed
CombinatoricsConvex OptimizationDiscrete Geometry+1·Captain: Shuze Chen

Discrete Convex Analysis XX: Integral Convexity of L-Convex SetsTextbook

Shortest-path distances and network potentials are among the oldest objects in combinatorial optimization: a directed graph with arc lengths, its shortest-path distances, and the "feasible potentials" (vertex labels consistent with those lengths) underlie duality in min-cost flow, scheduling, and difference-constraint systems. Murota's Discrete Convex…

23 thms4 active usersReviewed
🏆Completed
Discrete GeometryLinear OptimizationOptimization·Captain: mikedeng1

Elementare Theorie der konvexen Polyeder II: Finitely Many Linear Inequalities Define a Convex Polytope Iff Their Normals Positively Span and the Region Has an Interior PointResearch Paper

A convex polytope has two standard descriptions: as the convex hull of finitely many points, and as the intersection of finitely many half-spaces. Linear programming uses both at once. The feasible region of a linear program is given by inequalities, while the simplex method and the theory of basic solutions work with its vertices. That the two descriptions…

14 thms4 active usersReviewed
🏆Completed
Dynamic ProgrammingOptimizationProbability·Captain: Shuze Chen

Markov Decision Processes VI: Multiperiod Terminal Wealth ProblemsTextbook

An investor with a fixed planning horizon, an initial fortune, and a personal attitude toward risk (a utility function) wants to allocate wealth between a riskless bond and several risky assets, rebalancing at each of NNN periods, to maximize the expected utility of terminal wealth. This is the oldest and most basic problem of mathematical finance's…

15 thms4 active usersReviewed
🏆Completed
AnalysisOptimization·Captain: mikedeng1

A Nonsmooth Version of Newton's Method III: Semismoothness of the Augmented Lagrangian GradientResearch Paper

The augmented Lagrangian method (method of multipliers) of Hestenes, Powell and Rockafellar solves a constrained nonlinear program by repeatedly minimizing an unconstrained merit function in the primal variables and then updating the multipliers. For inequality constraints, the augmented Lagrangian in the form the paper takes from Rockafellar (Rockafellar…

8 thms4 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Robust Mean-Covariance Solutions for Stochastic Optimization III: Concave Utilities with a Monotone Second Derivative Have a Closed-Form Robust ObjectiveResearch Paper

A decision maker who chooses a portfolio x∈Rnx\in\mathbb R^nx∈Rn of risky assets with random return vector RRR receives the scalar return x′Rx'Rx′R and evaluates it by an expected utility E[u(x′R)]E[u(x'R)]E[u(x′R)]. In practice the law of RRR is not known; what can be estimated with some confidence are its mean μ\muμ and covariance Σ\SigmaΣ. The robust mean-covariance objective replaces the…

11 thms4 active usersReviewed
🏆Completed
Convex OptimizationDiscrete GeometryOptimization·Captain: Shuze Chen

Discrete Convex Analysis XVI: Substitutes and Complements in Network FlowsTextbook

In economics, a pair of goods are substitutes if raising the price of one increases demand for the other, and complements if it decreases it; formally, a utility or value function is submodular in the substitutes case and supermodular in the complements case. A natural question is which of these two regimes a given optimization problem's value function…

41 thms4 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Cubic Regularization of Newton Method and Its Global Performance IV: Local Quadratic Convergence to a Non-degenerate MinimumResearch Paper

Newton's method converges quadratically near a non-degenerate minimum, but on its own it has no global guarantee: far from a minimum the Newton step may not exist or may increase the objective. Nesterov and Polyak (Math. Program. 108 (2006) 177–205) replaced the Newton step by the minimizer of a cubic-regularized second-order model. The resulting method has…

21 thms4 active users
🏆Completed
Convex OptimizationGraph TheoryLinear algebra+1·Captain: mikedeng1

Lifts of Convex Sets and Cone Factorizations III: Stable Set Polytopes Have No Small Semidefinite LiftsResearch Paper

Many polytopes of combinatorial optimization have exponentially many facets, yet linear optimization over them is tractable because they are projections of simpler convex sets: affine slices of a nonnegative orthant (linear programming) or of the cone of positive semidefinite matrices (semidefinite programming). The size of such a representation, the number…

19 thms4 active usersReviewed
🏆Completed
CombinatoricsDiscrete GeometryOptimization·Captain: Shuze Chen

Discrete Convex Analysis I: Valuated MatroidsTextbook

Matroids abstract the combinatorial content of linear independence: which sets of columns of a matrix are independent, which are maximal (bases), and how bases relate to each other. This abstraction, isolated independently by Whitney (1935) and van der Waerden's school, turned out to be exactly the right level of generality for a large family of greedy and…

13 thms4 active usersReviewed
🏆Completed
Machine LearningOptimizationProbability+1·Captain: mikedeng1

A Distributional Interpretation of Robust Optimization II: Box-Robust Sample Average Optimization Is ConsistentResearch Paper

Many decision problems under uncertainty take the form of a stochastic program: choose a decision vvv from a feasible set F\mathcal FF to maximise the expected utility Ex∼μ[f(v,x)]\mathbb E_{x\sim\mu}[f(v,x)]Ex∼μ​[f(v,x)], where the distribution μ\muμ of the uncertain parameter x∈Rmx\in\mathbb R^mx∈Rm is known only through i.i.d. samples x1,…,xnx_1,\dots,x_nx1​,…,xn​. The standard remedy, sample average…

7 thms4 active usersReviewed
🏆Completed
Linear OptimizationOptimizationProbability·Captain: mikedeng1

Robust solutions of Linear Programming problems contaminated with uncertain data: A Violation-Probability Bound for the Robust CounterpartResearch Paper

Linear programs solved in practice carry data that are measured, estimated or rounded. Ben-Tal and Nemirovski (Math. Program. 88, 2000) examined the NETLIB collection of real-world LPs and found that in 13 of them a relative perturbation of only 0.01% in the "ugly" coefficients of the inequality constraints can make the nominal optimal solution more than…

12 thms4 active usersReviewed
🏆Completed
Algorithmic Game TheoryLinear Optimization·Captain: mikedeng1

The Assignment Game I: The Core 2: The High-Price and Low-Price Corners of the CoreResearch Paper

A two-sided market in which each seller owns one indivisible good (a house, in the paper's example) and each buyer wants at most one is the simplest model in which prices emerge from bargaining between individuals rather than from a supply curve. Shapley and Shubik, The Assignment Game I: The Core (Int. J. Game Theory 1 (1971)), treat this market as a…

7 thms4 active usersReviewed
🏆Completed
ProbabilityStochastic Systems·Captain: Shuze Chen

Processing Networks VIII: Maximal Stability of Back-Pressure ControlTextbook

Every stability result up through mission VII proves that a particular control policy — a fixed priority list, HLSPS, a policy tailored to one network's topology — keeps a specific processing network stable throughout its subcritical region. None of them answer a more practical question a system designer actually faces: given an arbitrary Leontief network…

14 thms4 active usersReviewed
🏆Completed
Discrete GeometryLinear OptimizationNumber Theory+1·Captain: mikedeng1

Maximal Lattice-Free Convex Sets in Linear Subspaces I: Characterization of Maximal Lattice-Free Convex Sets in a SubspaceResearch Paper

Cutting planes for mixed-integer linear programs are often derived from convex sets that contain no integer point in their interior. Balas observed in 1971 that every such lattice-free convex set containing the current fractional LP solution in its interior yields a valid inequality, the intersection cut (Balas, Intersection cuts, Oper. Res. 19, 1971). The…

18 thms4 active usersReviewed
🏆Completed
Control TheoryDynamic ProgrammingOptimization·Captain: mikedeng1

Robust Control of Markov Decision Processes with Uncertain Transition Matrices 1: Perfect Duality and the Robust Dynamic Programming Recursion for Finite-Horizon MDPsResearch Paper

A Markov decision process (MDP) is solved by dynamic programming once its transition probabilities are known. In practice they are estimated from data, and the optimal policy of an MDP can be sensitive to estimation error: a policy computed from point estimates may perform much worse under the true transition matrices. Nilim and El Ghaoui (Oper. Res. 53(5),…

11 thms4 active usersReviewed
PreviousPage 30 of 145Next

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