Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

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

Optimization

2,311 missions · 1,728 completed

Missions

Open583Completed1728All2311
🏆Completed
Linear OptimizationOperations Research·Captain: Shuze Chen

Production Planning by Mixed Integer Programming I: Facility Location Reformulation of Uncapacitated Lot-SizingTextbook

Production planning combines continuous quantities with discrete decisions about when a machine is prepared to produce. A setup can incur a fixed charge even when the amount subsequently produced is small. Relaxing the setup decision to a fraction can therefore give a cost bound that is too optimistic. For a single product without capacity limits, a…

4 thms3 active usersReviewed
🏆Completed
Operations Research·Captain: Shuze Chen

Price Discrimination with Fairness Constraints: Welfare effects of a little fairnessResearch Paper

A seller can charge different customer groups different prices when their willingness to pay differs. Limiting that discrimination changes both the seller's profit and what buyers receive. Equal prices are one possible fairness objective; equal purchase probabilities, equal consumer surplus and equal valuations among non-buyers express different concerns.…

24 thms3 active users
🏆Completed
Markov ChainOperations ResearchStochastic Systems·Captain: mikedeng1

Pricing and Optimization in Shared Vehicle Systems: An Approximation Framework: Elevated-Flow-Relaxation Prices Earn an m/(m+n−1) Fraction of the Optimal State-Dependent ObjectiveResearch Paper

Bike-sharing and car-sharing systems, and ride-hailing platforms, all move a fixed fleet of units between stations. Every ride takes a unit away from its origin and leaves it at its destination, so demand that is unbalanced across stations drains some stations and floods others. Pricing is the main lever an operator has: raising the price of rides out of a…

15 thms3 active usersReviewed
🏆Completed
CombinatoricsOperations Research·Captain: mikedeng1

M-Convex Function Minimization Under L1-Distance Constraint and Its Application to Dock Reallocation in Bike-Sharing System: Steepest Descent from the Center Is Optimal at Every L1 RadiusResearch Paper

Bike-sharing operators periodically move docks between stations: a station that often runs out of bikes or of open docks frustrates users, but every moved dock costs money. Freund, Henderson and Shmoys modelled this dock re-allocation problem as a separable nonlinear integer program with a budget on the number of moved docks (Freund–Henderson–Shmoys, IPCO…

17 thms3 active usersReviewed
Control TheoryOperations ResearchPartial Differential Equations·Captain: mikedeng1

Hamilton-Jacobi Equations with Semilinear Costs and State Constraints, with Applications to Large Deviations in Games: Verification Theorem for the State-Constrained Target ProblemResearch Paper

Stochastic evolutionary game dynamics model a population of NNN agents who occasionally revise their actions by a noisy best-response rule with noise level η>0\eta>0η>0. As η→0\eta\to0η→0, the population spends long periods near Nash equilibria and occasionally transits between them; the exponential rates of these transitions, and hence which equilibrium is stochastically…

13 thms3 active usersReviewed
CombinatoricsLinear OptimizationOperations Research+1·Captain: mikedeng1

Improved Guarantees for the A Priori TSP: Random Sampling with Probability 1 − (1 − p)^0.663 and a 3/2-Approximate Master Tour Has Approximation Guarantee Below 3.1 on Instances with a DepotResearch Paper

In the a priori traveling salesman problem with independent activation, a tour through all customers must be fixed before it is known which customers need a visit; each customer is active independently with a known probability, and the fixed tour is afterwards cut short to the active ones. The model, introduced by Jaillet and by Bertsimas as the…

19 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingLinear OptimizationOperations Research·Captain: mikedeng1

Revenue Management with Repeated Customer Interactions: the myopic policy earns at least a (1 − γ) fraction of the optimal revenue under bang-per-buck heterogeneity γResearch Paper

Network revenue management studies how a platform with limited supply should allocate products to customers at given prices. Most of the literature treats each interaction as one-shot: a request arrives, is served or rejected, and leaves. Examples are the fluid models of Gallego and van Ryzin (1997) and the bid-price controls of Talluri and van Ryzin (1998).…

13 thms3 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Distribution-Free Pricing: Knowing Only the Mean and Variance, the Price μ − k*σ Is Maximin-Optimal and Earns a Fraction ρ of the Optimal ProfitResearch Paper

A seller who posts a single price ppp for a product with marginal cost ccc earns (p−c)(p-c)(p−c) from every customer whose valuation is at least ppp. Choosing ppp well requires the distribution of valuations, which in practice is rarely known: a new product, a new market, or a short sales history typically yields an estimate of the mean and the spread of willingness to pay,…

10 thms3 active usersReviewed
🏆Completed
Experimental DesignOperations ResearchStatistics·Captain: mikedeng1

Correlated Cluster-Based Randomized Experiments: Robust Variance Minimization: The Optimal Independent Block Randomization Experiment Is Asymptotically Optimal at Rate O(√(w₁²/Σwᵢ²))Research Paper

Online platforms run randomized experiments on users who interact with each other. When the treatment of one user affects the outcome of another, comparing treated and control users is biased. A standard remedy is cluster-based randomization: users are grouped into clusters with few edges between them, and whole clusters are assigned to treatment or control…

11 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: mikedeng1

The Cost of Nonconvexity in Deterministic Nonsmooth Optimization: Deterministic Bisection Finds a Small Goldstein Subgradient Within an Oracle-Call Budget Set by the Nonconvexity ModulusResearch Paper

Minimizing a nonsmooth, nonconvex Lipschitz function is intractable in general, so nonsmooth optimization asks for a weaker certificate: a point near which a small convex combination of nearby subgradients exists. Such a vector is a Goldstein subgradient, a notion going back to Goldstein in the 1970s. Zhang, Lin, Jegelka, Sra and Jadbabaie (2020) gave the…

12 thms3 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Optimal Prototyping with Noisy Measurements: A Fidelity-Adjusted Reservation Price Policy Is Optimal for Sequential Search with Noisy EvaluationsResearch Paper

Product development is often organized as a search over prototypes: several candidate designs exist, each must be built or tested at a cost before its quality is known, and the firm wants to end up launching the best one without spending too much on testing. When each test reveals the true quality of a prototype, this is Pandora's box problem, solved by…

7 thms3 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: mikedeng1

Portfolio Optimization Based on Almost Second-Degree Stochastic Dominance: Approximate ASSD Under a Discretization Scheme Implies ASSDResearch Paper

Second-order stochastic dominance (SSD) is the standard ordering of risky prospects for risk-averse investors: a return XXX dominates a return YYY by SSD when every investor with a nondecreasing concave utility weakly prefers XXX. Portfolio models that require a chosen portfolio to dominate a benchmark by SSD go back to Dentcheva and Ruszczyński (2003) and are…

8 thms3 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

Cross-Category Retailing Management: Substitution and Complementarity: Optimal Cross-Selling Prices Equalize Aggregate Markups, and the Optimal Profit Is the Unique Fixed Point of HResearch Paper

Retailers often sell products from two categories that are bought one after the other: a television and then a speaker, a laptop and then a mouse, a suit and then a tie. The first purchase changes how much the second is worth to the consumer, which is called a complementarity effect, and online stores act on it by showing secondary products only after a…

6 thms3 active usersReviewed
🏆Completed
Machine LearningOperations ResearchStatistics·Captain: mikedeng1

Stochastic Optimization Forests: the approximate risk criterion consistently approximates the oracle splitting criterion as the region to split shrinksResearch Paper

In contextual stochastic optimization a decision z∈Rdz\in\mathbb R^dz∈Rd is chosen after observing features X∈RpX\in\mathbb R^pX∈Rp, and the ideal policy solves, for each feature value,

9 thms3 active usersReviewed
🏆Completed
Operations ResearchOptimal TransportProbability·Captain: mikedeng1

Distributionally Robust Linear and Discrete Optimization with Marginals: the worst-case expected optimal value over a Fréchet class equals its Lagrangian primal and dual formsResearch Paper

Many decision problems in operations research end in a linear optimization over a finite set of alternatives whose objective coefficients are random: the longest path in a project network with random activity durations, a maximum-weight assignment or spanning tree with random weights, the best item in a ranking with random utilities. The quantity of…

11 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Surge Pricing and Its Spatial Supply Response: Within an Attraction Region, Supply Fills the Congestion Bound Outward from the Sink at Locally Optimal Prices Without Loss of RevenueResearch Paper

Ride-hailing platforms change prices by location in real time, and drivers respond by moving. A price increase at one location changes where drivers go, how congested each location becomes, and therefore what every driver earns everywhere else. Besbes, Castro and Lobel, Surge Pricing and its Spatial Supply Response (SSRN 3124571, version of May 17, 2019;…

12 thms3 active usersReviewed
🏆Completed
Convex OptimizationProbability·Captain: mikedeng1

Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization: Lower Bounds on the Smallest Eigenvalue of Boltzmann Covariance Matrices over a Convex BodyResearch Paper

Interior point methods for convex optimization need a self-concordant barrier for the feasible set, and for many convex bodies, such as the subtour elimination polytope, membership can be decided in polynomial time while no efficiently computable barrier is known. The entropic barrier of Bubeck and Eldan (arXiv:1412.1587) is a self-concordant barrier…

14 thms3 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

On Optimality Conditions for Nonlinear Conic Programming: Under the Generalized Łojasiewicz Inequality, Feasible Limit Points of the Augmented Lagrangian Method Satisfy CAKKTResearch Paper

Nonlinear conic programming covers nonlinear programming (NLP), nonlinear semidefinite programming (NLSDP) and nonlinear second-order cone programming (NSOCP) in one model: minimize a smooth objective subject to the requirement that a smooth map takes values in a closed convex cone. The classical first-order necessary condition, the Karush–Kuhn–Tucker (KKT)…

10 thms3 active usersReviewed
Convex OptimizationProbability·Captain: mikedeng1

Universal Barrier is n-Self-Concordant: The Universal Barrier of Every Proper Convex Domain in ℝⁿ Is an n-Self-Concordant BarrierResearch Paper

Interior-point methods minimize a linear function over a convex set K⊆RnK\subseteq\mathbb R^nK⊆Rn by following the minimizers of t cTx+φ(x)t\,c^{\mathsf T}x+\varphi(x)tcTx+φ(x), where φ\varphiφ is a self-concordant barrier for KKK. The number of Newton steps the path-following method needs to reach accuracy ϵ\epsilonϵ is O(νlog⁡(1/ϵ))O(\sqrt{\nu}\log(1/\epsilon))O(ν​log(1/ϵ)), where ν\nuν is the barrier's self-concord…

16 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: mikedeng1

Convex Optimization for Bundle Size Pricing Problem: the Cross-Moment-Model Profit Is Concave in Choice ProbabilitiesResearch Paper

In bundle size pricing (BSP) a seller of many products offers a menu of bundles in which the price of a bundle depends only on its size, the number of items in it. Customers choose which items to put in a bundle and which size to buy. Season tickets for theatres and sports teams, cable-TV channel packages and streaming plans priced by the number of…

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

Display Optimization for Vertically Differentiated Locations Under Multinomial Logit Preferences: Revenue Lower Bound for the Assignment Rounded from Dynamic-Programming ActionsResearch Paper

Retailers, online travel agencies and search engines display products in an ordered list or on a physical layout, and customers inspect only a prefix of it. Display optimization asks how to assign products to positions so as to maximize expected revenue when each customer considers only the products shown in the first kkk positions, with kkk random. Aouad and…

8 thms3 active usersReviewed
🏆Completed
Machine LearningOperations ResearchProbability·Captain: mikedeng1

Distributed Stochastic Optimization with Large Delays: Under Polynomially Growing Delays, Asynchronous SGD with Tuned Step-Sizes Drives the Mean-Square Gradient Norm to ZeroResearch Paper

Large-scale learning problems, such as empirical risk minimization over millions of samples, are solved in practice by stochastic gradient descent (SGD) run on many processors at once. In a master–worker system, or in a multi-processor system with shared memory, a worker reads the current parameter, computes a stochastic gradient and writes its update back.…

13 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchProbability·Captain: mikedeng1

Model-Free Bounds for Multi-Asset Options Using Option-Implied Information and Their Exact Computation: Under No-Arbitrage with Bid–Ask Spreads, the Superhedging Price ϕ(f) Equals sup_{μ∈Q} ∫f dμResearch Paper

A trader who quotes an exotic option written on several underlying assets (a basket call, a spread option, a best-of option) needs a price range that does not rest on a particular stochastic model. What is observed in the market is a finite set of liquid derivatives (vanilla calls and puts on each asset, and possibly some traded basket options), each with a …

9 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchProbability·Captain: mikedeng1

Time Consistency of the Mean-Risk Problem: The Upper Images of the Dynamic Mean-Risk Problem Satisfy a Set-Valued Bellman RecursionResearch Paper

Markowitz's mean-variance problem trades off the expected terminal wealth of a portfolio against its risk. Over several periods the scalarized form of this problem is time inconsistent: a strategy that is optimal today for a fixed risk-aversion parameter is generally no longer optimal tomorrow for the same parameter, so the investor would deviate from her…

11 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: mikedeng1

A Moment-Sum-of-Squares Hierarchy for Robust Polynomial Matrix Inequality Optimization with Sum-of-Squares Convexity: Both Bounds of the Hierarchy Decrease to the Robust Optimum f⋆Research Paper

Many problems in control, robust semidefinite programming and risk management ask for a decision yyy that keeps a matrix positive semidefinite for every value of an uncertain parameter xxx in a set X\mathcal XX. Examples include robust polynomial SDPs (Scherer and Hol, 2006), Lyapunov-type conditions that must hold on a region of the state space, and robust…

11 thms3 active usersReviewed
PreviousPage 28 of 93Next

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