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
CombinatoricsLinear OptimizationOptimization·Captain: mikedeng1

An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem II: Geometric Grouping with Residual LP RoundingResearch Paper

One-dimensional bin packing asks for the fewest unit-capacity bins that hold a given list of items with sizes in (0,1)(0,1)(0,1). Deciding whether two bins suffice is NP-hard (it contains the partition problem), so no polynomial-time algorithm guarantees a ratio below 3/23/23/2 unless P = NP. The natural question is therefore asymptotic: how small can the additive error …

21 thms5 active usersReviewed
🏆Completed
Discrete GeometryLinear OptimizationOptimization·Captain: mikedeng1

Selected Topics in Column Generation I: Discretization — Every Integer Point of a Rational Polyhedron Is a Generating Integer Point Plus an Integer Combination of Integer RaysResearch Paper

Dantzig–Wolfe decomposition and column generation solve large integer programs by replacing a set of "easy" constraints with a description of its feasible points, and then pricing out the points one at a time. For linear programs this rests on the Minkowski–Weyl representation: every point of a polyhedron is a convex combination of its extreme points plus a…

5 thms5 active usersReviewed
🏆Completed
Linear OptimizationProbabilityTheoretical Computer Science·Captain: mikedeng1

Competitive Randomized Algorithms for Nonuniform Problems III: The Optimal Randomized Two-Server Ratio on the 1-d-d Isosceles TriangleResearch Paper

The k-server problem of Manasse, McGeoch and Sleator (J. Algorithms 11 (1990)) asks how kkk mobile servers in a metric space should respond, on-line, to a sequence of requests at points of the space, each of which must be covered by a server. It is the central model of on-line computation: paging is the special case of a uniform metric, and many caching and…

9 thms5 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine LearningProbability+1·Captain: mikedeng1

Optimal Best Arm Identification with Fixed Confidence IV: Asymptotic Optimality of the Track-and-Stop StrategyResearch Paper

In best arm identification with fixed confidence, a learner samples KKK unknown distributions (arms) sequentially and must, as early as possible, name the arm with the largest mean, while being wrong with probability at most a prescribed risk δ\deltaδ. The problem models adaptive A/B/n testing, clinical and simulation-based selection among alternatives, and the…

17 thms5 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine LearningProbability+1·Captain: mikedeng1

Optimal Best Arm Identification with Fixed Confidence I: Non-Asymptotic Lower Bound on the Sample ComplexityResearch Paper

Best arm identification with fixed confidence is the pure-exploration counterpart of the multi-armed bandit problem. A learner faces KKK unknown reward distributions ("arms"), samples them sequentially, and must stop and name the arm with the largest mean, being wrong with probability at most a prescribed δ\deltaδ. The question is how many samples this…

15 thms5 active usersReviewed
🏆Completed
Convex OptimizationDiscrete GeometryOptimization·Captain: Shuze Chen

Discrete Convex Analysis XXV: L-Convex Functions via Minimizer PolyhedraTextbook

Chapter 5 characterized L-convex sets — sublattice-closed, translation-periodic subsets of ZV\mathbb Z^VZV — and showed they interact cleanly with integral convexity. Chapter 7 asks the functional analogue: which functions on the integer lattice deserve to be called convex in the "L" sense, and how do they relate back to L-convex sets? This mission (continuing…

41 thms5 active usersReviewed
🏆Completed
Convex OptimizationFunctional Analysis·Captain: mikedeng1

On the Maximal Monotonicity of Subdifferential Mappings II: Subdifferentials Are Exactly the Maximal Cyclically Monotone Operators, Unique up to an Additive ConstantResearch Paper

A differentiable convex function on Rn\mathbb{R}^nRn is determined, up to an additive constant, by its gradient, and a vector field is a gradient of a convex function exactly when it satisfies a monotonicity condition along closed cycles. Convex analysis and optimization need the same statement for nonsmooth and extended-valued functions on infinite-dimensional…

16 thms5 active usersReviewed
🏆Completed
Convex OptimizationFunctional AnalysisOptimization+1·Captain: mikedeng1

Dual Stochastic Dominance and Related Mean-Risk Models 2: Mean–Gini Optimal Portfolios Exist and Are SSD-EfficientResearch Paper

Portfolio selection and other decisions under risk are routinely solved as mean–risk models: maximize the expected outcome minus a multiple of a risk measure over the feasible set. Such a model is computationally convenient, but it is only defensible if its answers agree with the preferences of risk-averse decision makers. The standard formal expression of…

13 thms5 active usersReviewed
🏆Completed
AnalysisControl TheoryDynamical Systems+1·Captain: mikedeng1

Generalized Gradients and Applications II: Flow-Invariant Sets of Lipschitz Differential InclusionsResearch Paper

A closed set F⊆RnF\subseteq\mathbb R^nF⊆Rn is flow-invariant for a dynamical system when every trajectory that starts in FFF stays in FFF. Invariance of sets underlies state constraints in optimal control, safety certificates for controlled systems, comparison and maximum principles for differential equations, and the positivity of solutions of kinetic and population…

17 thms5 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine Learning·Captain: mikedeng1

Improved Algorithms for Linear Stochastic Bandits II: Constant High-Probability Regret of UCB(δ)Research Paper

The stochastic multi-armed bandit is the basic model of sequential decision making under uncertainty: a learner repeatedly chooses one of ddd actions, observes a noisy reward for the chosen action only, and must balance exploring poorly known actions against exploiting the one that currently looks best. It underlies adaptive clinical trials, online…

6 thms5 active usersReviewed
🏆Completed
Linear OptimizationOptimization·Captain: Shuze Chen

Disjunctive Programming XII: Intersection Cuts, Generalized Intersection Cuts, and Lift-and-Project CutsTextbook

Intersection cuts (Balas, 1971) are the founding construction of cutting-plane theory for mixed 0-1 and mixed-integer programs: given a fractional LP solution xˉ\bar xxˉ and a convex region SSS around it known to contain no feasible integer point, the hyperplane through the points where SSS's boundary meets the extreme rays of the LP cone at xˉ\bar xxˉ cuts off xˉ\bar xxˉ w…

14 thms5 active users
🏆Completed
Linear OptimizationOptimization·Captain: Shuze Chen

Disjunctive Programming V: Moving Between Conjunctive and Disjunctive Normal FormsTextbook

Chapter 2 gives a compact lifted description of the closed convex hull of a disjunctive set once it is written as a union of polyhedra (its disjunctive normal form, DNF). But most discrete optimization problems present their feasible region the opposite way: as a conjunction of many small disjunctions (the conjunctive normal form, CNF) — "linear…

11 thms5 active usersReviewed
🏆Completed
Linear OptimizationOptimization·Captain: Shuze Chen

Disjunctive Programming IV: Sequential Convexification of Disjunctive SetsTextbook

Computing the convex hull of a disjunctive set — a union of finitely many polyhedra — is generally hard in direct proportion to how many polyhedra are in the union: Chapter 2's Theorem 2.1 gives a compact lifted description, but working with it still means reasoning about all the disjunctions of the program simultaneously. A natural question, with obvious…

6 thms5 active usersReviewed
🏆Completed
Linear OptimizationOptimization·Captain: Shuze Chen

Disjunctive Programming III: Projecting Polyhedra and the Convex Hull via PolarityTextbook

Theorem 2.1 (the previous mission in this series) shows that the closed convex hull of a union of polyhedra has a compact description after lifting to a higher-dimensional space. That description comes in two dual flavors: a primal one, as the projection of an explicit lifted polyhedron, and a polar one, characterizing the hull's facets directly via a cone…

20 thms5 active users
🏆Completed
Complexity TheoryLinear algebraOptimization·Captain: mikedeng1

Some NP-Complete Problems in Quadratic and Nonlinear Programming: Copositivity Testing Is NP-Hard via Subset SumResearch Paper

Nonlinear programming algorithms are routinely advertised as finding a local minimum. Most of them only certify first-order conditions (a KKT point), and the natural next question is whether a given feasible point is in fact a local minimum. For smooth problems where the Hessian is nonsingular this is a second-order test, but in the degenerate case the test…

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

Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach 1: Exact Worst-Case VaR under Known Mean and Covariance and Its SDP RepresentationsResearch Paper

Value-at-Risk (VaR) is the standard regulatory measure of downside risk of a portfolio: the loss level that is exceeded only with a prescribed small probability ε\varepsilonε. Computing it requires the full distribution of asset returns, which is rarely known. In practice one estimates a mean vector and a covariance matrix and then assumes a Gaussian…

8 thms5 active usersReviewed
🏆Completed
Linear OptimizationNumber TheoryOptimization·Captain: mikedeng1

An Application of Simultaneous Diophantine Approximation in Combinatorial Optimization: A Small Integral Objective with the Same Optimal Solutions and Dual BasesResearch Paper

An algorithm for linear programming is strongly polynomial if the number of arithmetic operations it performs is bounded by a polynomial in the dimension of the problem alone (the number of variables and constraints), independently of the bit lengths of the numbers in the input. Many combinatorial optimization problems are linear programs over polyhedra of…

11 thms5 active usersReviewed
🏆Completed
CombinatoricsTheoretical Computer Science·Captain: mikedeng1

Competitive Paging Algorithms IV: An Algorithm Competitive against Several Others Exists iff the Reciprocal Ratios Sum to at Most 1Research Paper

Paging is the problem of managing a fast memory that holds kkk pages out of nnn: when a requested page is not in fast memory (a page fault), some resident page must be evicted, and the cost of an algorithm is its number of faults. Practitioners have many eviction rules. Least-recently-used (LRU) performs well on real workloads but can be kkk times worse than the…

9 thms5 active usersReviewed
🏆Completed
Convex OptimizationOptimization·Captain: mikedeng1

The Generalized Quasi-Variational Inequality Problem II: Existence via Projection and the Brouwer Fixed Point TheoremResearch Paper

A variational inequality asks for a point xxx of a set K⊆RnK\subseteq\mathbb R^nK⊆Rn at which a vector field fff makes a non-obtuse angle with every feasible direction: (x′−x)Tf(x)≥0(x'-x)^T f(x)\ge 0(x′−x)Tf(x)≥0 for all x′∈Kx'\in Kx′∈K. It is the common form of the first-order optimality condition of a constrained optimization problem, of complementarity problems in mathematical programming, and of…

11 thms5 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

On Properties of Stochastic Inventory Systems I: Using the EOQ Order Quantity in the Stochastic (Q, r) Model Raises Costs by at Most 1/8Research Paper

The economic order quantity (EOQ) is the most widely used formula in inventory management. It assumes that demand is a deterministic constant stream. Real demand is random, and the model that accounts for this, the continuous-review (Q,r)(Q, r)(Q,r) policy with stochastic demand, has no closed-form optimum: for decades its optimal parameters were computed…

18 thms5 active usersReviewed
🏆Completed
AnalysisOptimization·Captain: mikedeng1

Robust Mean-Covariance Solutions for Stochastic Optimization II: An Inverse S-Shaped Derivative with Finite Limits Gives the Two-Point Support PropertyResearch Paper

In stochastic optimization the law of a random return rrr is rarely known exactly, while its mean and variance can be estimated. A robust mean-covariance decision maker therefore evaluates a utility uuu by its worst case

10 thms5 active usersReviewed
Computational GeometryLinear OptimizationTheoretical Computer Science·Captain: mikedeng1

Linear Programming in Linear Time When the Dimension Is Fixed: Fixed-Dimension LP Feasibility Decided in Linear Time on the Real RAMResearch Paper

A linear program asks for a point x∈Rdx\in\mathbb{R}^dx∈Rd minimizing cTxc^TxcTx subject to nnn linear inequalities ∑j=1daijxj≥bi\sum_{j=1}^d a_{ij}x_j\ge b_i∑j=1d​aij​xj​≥bi​. Many problems in computational geometry and statistics are linear programs with few variables and very many constraints: separating two point sets by a line or plane, fitting a line in the Chebyshev (L∞L_\inftyL∞​) norm, finding the…

16 thms5 active usersReviewed
🏆Completed
Convex OptimizationMachine LearningOptimization·Captain: mikedeng1

Logarithmic Regret Algorithms for Online Convex Optimization 1: Logarithmic Regret of Online Gradient DescentResearch Paper

Online convex optimization is a repeated game between a learner and an adversary. In each round t=1,…,Tt=1,\dots,Tt=1,…,T the learner commits to a point xtx_txt​ of a convex set P⊆Rn\mathcal P\subseteq\mathbb R^nP⊆Rn; only then is a convex cost function ftf_tft​ revealed, and the learner pays ft(xt)f_t(x_t)ft​(xt​). The learner is judged by its regret: its total cost minus the total cost of the best…

5 thms5 active usersReviewed
🏆Completed
Machine LearningOptimizationStatistics·Captain: mikedeng1

Generalization Bounds in the Predict-then-Optimize Framework I: Natarajan-Dimension Generalization Bound for Polyhedral Feasible RegionsResearch Paper

In many operational problems (shortest paths, assignment, planning) the decision solves a linear program whose cost vector is unknown at decision time and is predicted from contextual features. The predict-then-optimize pipeline fits a model fff that maps a feature vector xxx to a predicted cost vector c^=f(x)\hat c=f(x)c^=f(x), and then acts on the decision that is optimal…

9 thms5 active usersReviewed
🏆Completed
Bandit AlgorithmsOptimizationProbability·Captain: naimengye

Multi-armed Bandit Allocation Indices III: Superprocesses, Condition D and the Index Theorem for a SFASTextbook

The index theorem says that among several Markov reward processes, of which one may be advanced at each decision time, the right one to advance is the one of greatest Gittins index. Chapter 4 of Gittins, Glazebrook and Weber, Multi-armed Bandit Allocation Indices (2nd ed., doi:10.1002/9780470980033), asks how far this extends when the constituents are not…

10 thms5 active usersReviewed
PreviousPage 11 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