Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Linear Optimization

468 missions · 368 completed

Missions

Open100Completed368All468
CombinatoricsOperations ResearchTheoretical Computer Science·Captain: iris

Fitting Ultrametrics under any ℓp\ell_pℓp​ ObjectiveResearch Paper

An ultrametric is a distance in which, in every triangle, the two largest sides are equal. Equivalently, it is the leaf-to-leaf distance of a rooted tree whose leaves are all at the same depth, so an ultrametric is the same data as a hierarchical clustering. Fitting one to noisy pairwise measurements is a basic problem of numerical taxonomy: Cavalli-Sforza…

25 thms2 active usersReviewed
OptimizationProbabilityRandom Matrix Theory·Captain: iris

Interior Point Methods Solve Random LPs in polylog(n) iterationsResearch Paper

Interior point methods (IPMs) and the simplex method are the standard tools for solving linear programs in practice. Path-following IPMs carry a worst-case guarantee of O(nlog⁡(1/ε))O(\sqrt n\log(1/\varepsilon))O(n​log(1/ε)) iterations, proved in 1988–1989 (Renegar; Kojima–Mizuno–Yoshise; Monteiro–Adler) and never improved since. Production codes, however, solve programs with…

55 thms2 active usersReviewed
Linear algebraOptimization·Captain: iris

Newton Steps are Faster for Linear Complementarity ProblemsResearch Paper

The linear complementarity problem (LCP) asks, for a matrix M∈Rn×nM\in\mathbb R^{n\times n}M∈Rn×n and a vector q∈Rnq\in\mathbb R^nq∈Rn, for vectors x,sx,sx,s with Mx+q=sMx+q=sMx+q=s, x⊤s=0x^\top s=0x⊤s=0 and x,s≥0x,s\ge0x,s≥0. It contains the optimality conditions of linear and convex quadratic programs, and discounted stochastic games, mean-payoff and parity games reduce to it. For general MMM the problem is…

38 thms2 active usersReviewed
Optimization·Captain: iris

An Ω(N)\Omega(\sqrt{N})Ω(N​) Lower Bound for Path Following Interior Point Methods on Single-Source Shortest PathsResearch Paper

Path following interior point methods (IPMs) are the fastest known way to solve general linear programs in theory, and a core component of practical solvers. For a linear program with NNN inequality constraints, the classical analysis (Renegar 1988) reduces the duality gap by a constant factor every O(N)O(\sqrt N)O(N​) iterations. Practical solvers need far fewer…

33 thms2 active usersReviewed
Dynamic ProgrammingOperations Research·Captain: iris

Self-Adapting Network Relaxations for Weakly Coupled Markov Decision Processes: Every Feasibility Network Relaxation Bound Lies Between the Optimal Value and the Lagrangian BoundResearch Paper

Many sequential decision problems in operations research consist of a number of independent subsystems that interact only through shared resources: assortment and inventory decisions under a common budget, multi-armed bandits with a cap on the number of arms pulled, scheduling with capacity limits. Such problems are modelled as weakly coupled Markov…

14 thms2 active usersReviewed
Operations ResearchOptimizationProbability·Captain: iris

Degeneracy Is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions: Algorithms 1+2 Have Regret ≤((2κ1+2)/α+(4/α)∑j1/pj)log⁡2T+s0rmax⁡\le((2\kappa_1+2)/\alpha+(4/\alpha)\sum_j1/p_j)\log^2T+s_0r_{\max}≤((2κ1​+2)/α+(4/α)∑j​1/pj​)log2T+s0​rmax​Research Paper

Network revenue management (NRM) is the problem of selling several limited resources to customers who arrive one at a time and must be accepted or rejected on the spot. Examples are airline seats over flight legs, hotel rooms over nights, and cloud capacity over servers. Each request uses a fixed bundle of resources and offers a reward. The seller wants to…

25 thms2 active usersReviewed
Dynamic ProgrammingOperations ResearchProbability·Captain: iris

Technical Note—Revenue Management with Calendar-Aware and Dependent Demands: Asymptotically Tight Fluid Approximations: The Fluid-LP Policy Is 1/(4L)-Approximate and Asymptotically OptimalResearch Paper

Revenue management systems forecast demand over canonical intervals of time, such as a week, often with a general distribution for each week, and the demand of one week is a signal for the next. The prevalent demand model, a discrete-time approximation to a Poisson process, cannot reproduce this. With one arrival per period, arrival probabilities λt\lambda_tλt​ a…

22 thms2 active usersReviewed
Operations ResearchOptimizationProbability·Captain: iris

Effective Online Order Acceptance Policies for Omni-Channel Fulfillment: The Expected Total Cost Is Unimodal in the Global ThresholdResearch Paper

In omni-channel retail, a chain's stores double as shipping centres for online orders. Online orders arrive over a period and must be accepted or rejected as they come in. They are filled at the end of the period from whatever store inventory walk-in customers have left. An accepted order that cannot be filled is cancelled at a cost. A rejected order that…

25 thms2 active usersReviewed
Discrete GeometryOperations ResearchOptimization·Captain: iris

Proximity and Flatness Bounds for Linear Integer Optimization: With Integral bbb, an Optimal LP Vertex Is Strictly Within ℓ∞\ell_\inftyℓ∞​-Distance 4n+29Δn−1(A)\frac{4n+2}{9}\Delta_{n-1}(A)94n+2​Δn−1​(A) of an Integer OptimumResearch Paper

An integer linear program asks for the maximum of c⊤xc^\top xc⊤x over the integer points of a polyhedron P(A,b)={x∈Rn:Ax≤b}P(A,b)=\{x\in\mathbb R^n: Ax\le b\}P(A,b)={x∈Rn:Ax≤b}. Its linear relaxation is much easier to solve, so a basic question is how far an optimal vertex x∗x^*x∗ of the relaxation can be from the nearest optimal integer solution z∗z^*z∗. A bound on ∥x∗−z∗∥∞\|x^*-z^*\|_\infty∥x∗−z∗∥∞​ confines the search…

22 thms2 active usersReviewed
Dynamic ProgrammingOperations ResearchProbability·Captain: iris

Logarithmic Regret in Multisecretary and Online Linear Programs with Continuous Valuations: The Optimal Online Policy's Expected Regret Grows at Least Logarithmically in the HorizonResearch Paper

In an online linear program, customers arrive one at a time and a firm must accept or reject each one at once, spending a shared inventory of mmm resources. The model covers network revenue management, ad allocation and order fulfilment (Li and Ye, 2022). Its central performance measure is the regret: the gap between what an omniscient planner collects and…

25 thms2 active usersReviewed
Dynamic ProgrammingOperations ResearchProbability·Captain: iris

Robust Online Selection with Uncertain Offer Acceptance: The Best Robust Ratio Equals the Value of an Explicit Linear Program, and Its Optimal Solutions Give Optimal PoliciesResearch Paper

In the classical secretary problem a decision maker sees candidates in random order, learns only how each compares with those already seen, and must decide irrevocably whether to hire. Many real selection processes add one more source of uncertainty: the chosen candidate may refuse. Job offers are declined, customers ignore promotions, admitted students…

14 thms2 active usersReviewed
Operations ResearchOptimization·Captain: iris

Approximation Algorithms and LP Relaxations for Scheduling Problems Related to Min-Sum Set Cover: a 2Δ-Approximation for 0/1 Processing Times and a (2Δ+ε)-Approximation in GeneralResearch Paper

Min-sum set cover asks for an order of the elements of a ground set that minimizes the average time at which a hyperedge is first covered. Feige, Lovász and Tetali showed that the greedy algorithm is a 4-approximation and that no better constant is possible unless P = NP (Feige, Lovász, Tetali 2004). Min-sum vertex cover, pipelined set cover,…

49 thms2 active usersReviewed
Operations ResearchOptimization·Captain: iris

On Constrained Mixed-Integer DR-Submodular Minimization: DR Inequalities with the MIR, Box and Monotonicity Constraints Describe the Convex Hull of the EpigraphResearch Paper

A set function f:2V→Rf:2^{\mathcal V}\to\mathbb Rf:2V→R is submodular when its marginal gains shrink as the set grows. Submodular minimization over all subsets is solvable in polynomial time, and Edmonds' greedy description of the polymatroid gives the convex hull of the epigraph of a submodular set function through one linear inequality per permutation of V\mathcal VV.…

23 thms2 active usersReviewed
Discrete GeometryOperations ResearchOptimization·Captain: iris

On the Simplex Method for 0/1-Polytopes: The Ordered Shadow Pivot Rule Reaches an Optimal Solution in at Most d Non-degenerate PivotsResearch Paper

The simplex method moves between bases of a linear program, and its running time is governed by the pivot rule that picks the next basis. Whether some pivot rule needs only polynomially many pivots is a central open question in linear optimization. It is open even for 0/1-LPs, where the feasible region is a polytope whose vertices lie in {0,1}n\{0,1\}^n{0,1}n, although…

21 thms2 active usersReviewed
Operations ResearchOptimization·Captain: iris

Constrained Assortment Optimization Under the Paired Combinatorial Logit Model: Max-Dicut LP Rounding Gives a 0.5-Approximation for Cardinality-Constrained AssortmentResearch Paper

A retailer choosing which products to offer (an assortment) must predict how customers substitute between products. Discrete choice models make this prediction, and the paired combinatorial logit (PCL) model is a generalization of the multinomial and nested logit models in which every pair of products forms a nest, so that the correlation between the…

54 thms2 active usersReviewed
CombinatoricsGraph TheoryOperations Research·Captain: iris

Steiner Cut Dominants: For Each τ\tauτ, All Non-Trivial Facets with at Most τ\tauτ Terminals Arise by Subdivision and Gluing from Finitely Many Irreducible Steiner GraphsResearch Paper

The minimum cut of a graph and the minimum sss-ttt cut are among the oldest problems of combinatorial optimization, and both are polynomial. Between them lies the minimum TTT-Steiner cut: given a graph GGG, nonnegative edge weights and a set TTT of terminals, find a cheapest cut that separates at least two terminals. The polyhedral picture is much less even than the…

48 thms2 active usersReviewed
CombinatoricsGraph TheoryOperations Research·Captain: iris

Packing Feedback Arc Sets in Tournaments Exactly: A Tournament Is FAS Ideal iff FAS Mengerian iff Möbius-FreeResearch Paper

The feedback arc set (FAS) problem asks, for a digraph G=(V,A)G=(V,A)G=(V,A) with nonnegative integral arc weights www, for a set of arcs of minimum total weight whose deletion destroys every directed cycle. It is NPNPNP-hard, and it remains NPNPNP-hard on tournaments (Alon 2006; Charbit, Thomassé and Yeo 2007), where it models ranking from pairwise comparisons. A standard way to…

45 thms2 active usersReviewed
Operations ResearchOptimization·Captain: Shuze Chen

Production Planning by Mixed Integer Programming VI: Backlogging and Start-Up ReformulationTextbook

Production plans often allow demand to be served late and charge a separate cost for restarting production. These choices interact: keeping a machine set up can avoid a later start-up charge, while delaying production creates backlog costs. A formulation that represents each feature separately need not give an exact linear relaxation when the features are…

7 thms2 active usersReviewed
Control TheoryOperations ResearchOptimization·Captain: mikedeng1

An Optimal Control Framework for Online Job Scheduling with General Cost Functions: Algorithm 2 Is 2K-Speed 2-Competitive for Monotone Substitute Cost FunctionsResearch Paper

A single machine receives jobs over time. Each job jjj arrives at its release time rjr_jrj​ with a length vjv_jvj​ and a cost function gjg_jgj​, and all three become known only at arrival. The machine may interrupt a job and resume it later (preemption). The objective is the total delay cost ∑jgj(Cj)\sum_j g_j(C_j)∑j​gj​(Cj​), where CjC_jCj​ is the completion time of job jjj. Weighted flow time (…

12 thms2 active usersReviewed
Algorithmic Game TheoryMechanism DesignOperations Research·Captain: mikedeng1

Spatio-Temporal Pricing for Ridesharing Platforms: The STP Mechanism Is Subgame-Perfect Incentive Compatible, Welfare-Optimal, Envy-Free and Core-Selecting from Any HistoryResearch Paper

Ridesharing platforms set prices and dispatch drivers over a road network whose demand changes within minutes: a stadium empties, rush hour starts, a neighbourhood goes quiet. Drivers are not employees. They may decline a dispatch, drive somewhere else, or stop working, and the platform pays no one in advance for staying in place. Prices that look only at…

25 thms2 active usersReviewed
Algorithmic Game TheoryOperations ResearchProbability·Captain: mikedeng1

Tractable Equilibria in Sponsored Search with Endogenous Budgets: bidding valuations shaded by 1 + r_j with slack budgets is an ε-approximate equilibrium in large marketsResearch Paper

Sponsored-search platforms sell ad impressions through auctions in which advertisers submit both per-impression bids and a budget that caps their total spend. The platform then decides which auctions to run, subject to everybody's budget. Most auction theory treats budgets as exogenous constraints. In practice an advertiser chooses the budget, and…

13 thms2 active usersReviewed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources: The LP-Tracking Policy Is Asymptotically Optimal in Diffusion ScaleResearch Paper

In a fork-join network every arriving job is split into several tasks that are processed in parallel and then joined; the job leaves only when its last task is done. Such networks model parallel computing (map-reduce jobs split across machines), assembly and order fulfilment (an order waits for every component), and health care (a patient waits for several…

21 thms2 active usersReviewed
Markov ChainOperations ResearchProbability+1·Captain: mikedeng1

Dynamic Matching: Characterizing and Achieving Constant Regret I: Under General Position the Exhaustive Resolving Policy Has Regret at Most Γ/ϵ at All TimesResearch Paper

Centralized matching markets (kidney exchange, ride hailing, freight and labor platforms) repeatedly decide which waiting participants to match now and which to hold for a better opportunity later. Matching early collects value sooner; waiting lets the platform see more arrivals and avoid matches that later turn out to be wasteful. A natural yardstick is…

14 thms2 active usersReviewed
CombinatoricsOptimization·Captain: mikedeng1

The Running Intersection Relaxation of the Multilinear Polytope 2: If a Hypergraph Is Not β-Acyclic, Its Multilinear Polytope Is Strictly Contained in the Running Intersection RelaxationResearch Paper

Many nonconvex optimization problems in binary variables have a polynomial objective or polynomial constraints. The standard way to bring them into the reach of linear and mixed-integer programming solvers is to introduce one new variable per monomial and to study the convex hull of the resulting set of feasible 0/1 vectors, the multilinear polytope. Strong…

11 thms2 active usersReviewed
CombinatoricsOptimization·Captain: mikedeng1

The Running Intersection Relaxation of the Multilinear Polytope 1: For Kite-Free β-Acyclic Hypergraphs the Running Intersection Relaxation Equals the Multilinear PolytopeResearch Paper

Binary polynomial optimization asks to minimize a polynomial over {0,1}n\{0,1\}^n{0,1}n. The standard way to attack it with linear programming is to introduce one variable zez_eze​ for every monomial ∏v∈ezv\prod_{v\in e} z_v∏v∈e​zv​ and to work with the convex hull of the resulting set of binary points. This convex hull, the multilinear polytope, is the object behind the cutting planes…

14 thms2 active usersReviewed
PreviousPage 3 of 4Next

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