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
Optimal TransportOptimizationProbability·Captain: mikedeng1

On a Problem of Optimal Transport Under Marginal Martingale Constraints 5: For c = ϕ(x)ψ(y), ψ Strictly Convex, ϕ Strictly Decreasing, the Left-Curtain Coupling Is the Unique OptimizerResearch Paper

Martingale optimal transport asks for the cheapest way to couple two given laws μ\muμ and ν\nuν on R\mathbb RR by a one-step martingale: a pair (X,Y)(X,Y)(X,Y) with X∼μX\sim\muX∼μ, Y∼νY\sim\nuY∼ν and E[Y∣X]=XE[Y\mid X]=XE[Y∣X]=X. The problem arises in mathematical finance, where μ\muμ and ν\nuν are the risk-neutral laws of an asset at two maturities, implied by quoted vanilla option prices, and the…

11 thms2 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Approximation Algorithms for Product Framing and Pricing 2: With Type-Dependent Choice and IFR Page Views, the TRUNC Algorithm Earns at Least 1/3 of the Optimal RevenueResearch Paper

Online retailers, search engines and streaming services show products on a sequence of pages, and most consumers look at only the first few. Which products are seen therefore depends on where they are placed. Gallego, Li, Truong and Wang (Operations Research, 2020) call the problem of placing products on pages to maximize expected revenue product framing.…

12 thms2 active usersReviewed
🏆Completed
Convex OptimizationOptimizationStatistics·Captain: mikedeng1

Sparse Regression at Scale: Branch-and-Bound rooted in First-Order Optimization 1: The Perspective Interval Relaxation Is a Least Squares Problem with a Separable Reverse-Huber or ℓ1 PenaltyResearch Paper

Best subset selection with ridge shrinkage asks for a sparse linear model: given a design matrix X∈Rn×pX\in\mathbb R^{n\times p}X∈Rn×p and responses y∈Rny\in\mathbb R^ny∈Rn, minimize

6 thms2 active usersReviewed
🏆Completed
CombinatoricsOptimal TransportOptimization·Captain: mikedeng1

Computational Optimal Transport VI: On Termination the Auction Algorithm Returns an Assignment Whose Cost Is Within nε of the OptimumTextbook

The optimal assignment problem asks for a one-to-one matching of nnn points to nnn objects of least total cost. It is the discrete optimal transport problem between two uniform measures with the same number of atoms, and by the Birkhoff–von Neumann theorem it coincides with the Kantorovich linear program on that instance (Peyré and Cuturi, Computational Optimal…

5 thms2 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Responsible Sourcing in Supply Chains: When Each of the Four Sourcing Strategies Is OptimalResearch Paper

A buyer can reduce production cost by using a supplier whose operations carry a risk of a responsibility violation. That choice can also bring a direct penalty and cause customers to leave. Guo, Lee, and Swinney study how the cost saving, consumer demand, and violation risk jointly determine the buyer’s sourcing decision in a transparent supply chain. Their…

8 thms2 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Approximation Algorithms for Product Framing and Pricing 1: The NEST Framing Algorithm Earns at Least 6/π² of the Optimal Expected Revenue When Page Views Are NBUEResearch Paper

An online retailer does not show its catalogue at once. Products are arranged on a sequence of pages, and a consumer looks at the first few pages and then chooses among what she has seen, or leaves. Where a product is placed therefore decides whether it is considered at all. Gallego, Li, Truong and Wang (Operations Research, 2020) call the placement…

16 thms2 active usersReviewed
🏆Completed
AnalysisOptimization·Captain: mikedeng1

Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs 3: Enhanced e-PSG Cluster Points Are Strong Lifted Stationary Points for Max-Type DenominatorsResearch Paper

Fractional programs minimize a ratio f(x)/g(x)f(x)/g(x)f(x)/g(x) over a constraint set. They arise whenever a quantity has to be normalized: the scale-invariant sparse recovery model minimizes ∥x∥1/∥x∥2\|x\|_1/\|x\|_2∥x∥1​/∥x∥2​ (Rahimi, Wang, Dong, Lou 2019), robust Sharpe-ratio portfolio selection maximizes a mean-to-worst-case-risk ratio, and generalized eigenvalue problems minimize Rayleigh…

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

Proximal Algorithms II: The Proximal Operator of a Norm Is v − λΠ_B(v/λ), B the Unit Ball of the Dual NormResearch Paper

Norms are the most common nonsmooth terms in convex optimization models. The ℓ1\ell_1ℓ1​ norm promotes sparsity in the lasso and in compressed sensing, the Euclidean norm of blocks of variables promotes group sparsity in the group lasso, and the nuclear norm promotes low rank. First-order methods for such models, notably the proximal gradient method, ADMM and…

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

Constrained Assortment Optimization for the Nested Logit Model 6: Under Space Constraints, the Linear Program (13) over Knapsack-Relaxation Solutions Bounds the Optimal Expected RevenueResearch Paper

A retailer that sells products in several categories has to decide which products to put on display. Under the nested logit model a customer first picks a category (a nest) and then a product inside it, so offering a product changes the purchase probabilities of every other product. Choosing the assortment that maximizes expected revenue is assortment…

9 thms2 active usersReviewed
🏆Completed
Linear OptimizationOptimization·Captain: mikedeng1

Constrained Assortment Optimization for the Nested Logit Model 1: The Assortment Stitched from the Linear Program (4) Is the Best Among All Combinations of the Candidate AssortmentsResearch Paper

An assortment planner chooses which products to offer to arriving customers. When products are grouped into nests, a customer's choice of nest depends on all the assortments offered at once. A planner may nevertheless be able to generate only a short list of promising assortments for each nest. The remaining task is to choose one assortment from each list…

5 thms2 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Constrained Assortment Optimization for the Nested Logit Model 5: For Joint Assortment and Pricing, O(pb²) Candidate Assortments per Nest Include an Optimal Solution of Problem (7) for Every u ≥ 0Research Paper

A retailer that sells through a choice model decides two things at once: which products to put on the shelf and at what price. Under the nested logit model of discrete choice, products are grouped into nests (brands, categories, store sections); a customer first picks a nest, or leaves without buying, and then picks a product inside the nest. The price of a…

5 thms2 active usersReviewed
🏆Completed
Convex OptimizationLinear algebraNumerical Analysis+1·Captain: mikedeng1

A Primal-Dual Interior-Point Algorithm for Nonsymmetric Exponential-Cone Optimization 2: Rank-One Recursions Factor Y₀(Y₀ᵀS₀)⁻¹Y₀ᵀ = VVᵀ and S₀(Y₀ᵀS₀)⁻¹S₀ᵀ = UUᵀResearch Paper

Quasi-Newton methods replace the Hessian of an objective by a matrix H≻0H \succ 0H≻0 that is updated from observed pairs of steps and gradient changes. The secant equation HS=YHS = YHS=Y asks the new matrix to map the observed steps SSS to the observed changes YYY. The best-known update is BFGS, which for ppp simultaneous pairs S,Y∈Rn×pS, Y \in \mathbb{R}^{n\times p}S,Y∈Rn×p reads

7 thms2 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem 1: The Multiple-Choice Knapsack Relaxation Gives a Valid Lower Bound for Every Admissible Choice of PenaltiesResearch Paper

In city logistics, goods often cannot be carried by large trucks all the way to the final customers. A common design routes the goods through intermediate depots, called satellites: large first-level vehicles carry freight from a central depot to the satellites, and small second-level vehicles deliver it from the satellites to the customers. The two-echelon…

10 thms2 active usersReviewed
🏆Completed
CombinatoricsOptimization·Captain: mikedeng1

A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems: Biased-Fitness Survivor Selection Never Removes an Elite Individual Outside XResearch Paper

Genetic algorithms with local search ("memetic" or hybrid genetic algorithms) are among the most effective heuristics for vehicle routing. Their recurring weakness is premature convergence: selection and local improvement both favour good individuals, so the population fills with near-copies of a few solutions and the search stalls. Vidal, Crainic,…

5 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOptimization·Captain: mikedeng1

Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model 3: Robust Dynamic Assortments Grow with Remaining Capacity and over TimeResearch Paper

Single-leg capacity allocation under customer choice is the basic dynamic problem of revenue management: a firm holds a fixed stock of a perishable resource (seats on a flight leg, rooms on a night), and in every period of a finite selling horizon it decides which products (fare classes) to offer to the arriving customer. Talluri and van Ryzin (Management…

17 thms2 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model 2: Rectangular Uncertainty Reduces the Size-Constrained Robust Problem to Known Weights (u₀, l₁, …, lₙ)Research Paper

Assortment optimization is the problem a retailer faces in deciding which subset of its products to put in front of customers. Under the multinomial logit (MNL) choice model each product carries a preference weight, and a customer facing an offered set buys each product with probability proportional to its weight, or buys nothing. The optimal assortment…

8 thms2 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

Hedging Inventory Risk Through Market Instruments II: A Small Fair Hedge Raises the Newsvendor's Expected UtilityResearch Paper

A retailer that orders stock months before the selling season carries inventory risk: its profit depends on a demand it cannot observe when it commits. For many goods that demand moves with a quantity traded on financial markets: sales of housing-related products with an interest-rate or construction index, sales of fashion or luxury goods with a stock…

5 thms2 active usersReviewed
🏆Completed
Control TheoryProbabilityStochastic Systems·Captain: mikedeng1

Time-Inconsistent Stochastic Linear–Quadratic Control II: With a Scalar State and Deterministic Coefficients, Coupled Riccati Equations Give an Explicit Linear Feedback EquilibriumResearch Paper

In a time-inconsistent control problem, a control that is optimal when planned at time ttt stops being optimal when the problem is re-solved at a later time. Two sources of time inconsistency are common in finance and economics. One is a variance term in the objective, as in continuous-time Markowitz mean–variance portfolio selection (Zhou–Li 2000; Basak–Chaba…

12 thms2 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Quantity Flexibility Contracts and Supply Chain Performance 2: The Minimum Commitment Policy Is Optimal for the Open-Loop Program (F-OLFC) and AdmissibleResearch Paper

Manufacturers routinely share rolling schedules with their suppliers: each period the buyer commits to a purchase for the current period and issues non-binding estimates for future periods, then revises those estimates as the horizon rolls forward. Unconstrained revisions push forecast risk upstream and are a recognized source of the bullwhip effect. A quant…

6 thms2 active usersReviewed
🏆Completed
Optimization·Captain: mikedeng1

Robust Assortment Optimization in Revenue Management Under the Multinomial Logit Choice Model 1: The Optimal Robust Assortment Is Revenue-Ordered, S*(V) = {i : rᵢ > Z*(V)}Research Paper

Assortment optimization asks which subset of products a firm should offer when customers choose among the offered products, or leave without buying. It underlies shelf-space planning in retail, the choice of which fare classes to keep open in airline revenue management, and the selection of items shown on a web page. The multinomial logit (MNL) model is the…

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

Some Useful Functions for Functional Limit Theorems 1: Composition Preserves J₁ Convergence When the Outer Path Is Continuous or the Inner Path Is Continuous and Strictly IncreasingResearch Paper

Random time changes occur when a process is observed on an operational clock rather than calendar time. In queueing models, for example, an arrival-count path may be evaluated at an evolving service clock. A functional limit theorem for the outer path and another for the clock are useful together only when evaluating one path at the times supplied by the…

6 thms2 active usersReviewed
🏆Completed
Convex OptimizationNumerical AnalysisOptimization·Captain: mikedeng1

Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems 5: RCDM with Adaptive Lipschitz Estimates (RACDM) Has Expected Error at Most 8nR₁²(x₀)/(16 + 3k)Research Paper

Random coordinate descent minimizes a smooth convex function f:Rn→Rf:\mathbb R^n\to\mathbb Rf:Rn→R by updating one coordinate at a time, chosen at random. Each iteration needs a single partial derivative instead of the full gradient, which is what makes the method usable on problems whose dimension is in the millions or billions ("huge-scale" problems). Nesterov's…

8 thms2 active usersReviewed
🏆Completed
OptimizationProbability·Captain: mikedeng1

The Quantity Flexibility Contract and Supplier-Customer Incentives I: Without Commitment the Manufacturer Underproduces for Every Transfer Price and the Supply Chain Is InefficientResearch Paper

A manufacturer must commit to production before a retailer knows how much it will buy. In practice the retailer sends a forecast first, and the manufacturer plans against it. When the forecast binds neither party, the retailer has no reason to report it honestly, and the manufacturer has no reason to plan for the market rather than for its own margin.…

5 thms2 active usersReviewed
🏆Completed
ProbabilityTheoretical Computer Science·Captain: mikedeng1

Matroid Prophet Inequalities 3: Stopping at the First Value Above E[max X_i]/2 Earns at Least Half the Prophet's Expected MaximumResearch Paper

A prophet inequality compares two players facing the same random sequence of rewards X1,X2,…,XnX_1, X_2, \dots, X_nX1​,X2​,…,Xn​. The gambler sees the values one at a time and must decide, as each value arrives, whether to stop and collect it; a value passed over is lost. The prophet knows the whole sequence in advance and simply takes its maximum. In 1978 Krengel, Sucheston and…

5 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryTheoretical Computer Science·Captain: mikedeng1

Hardness of Approximating Flow and Job Shop Scheduling Problems 2: Coloring Reduction Gap: Makespan 2L·lb if G Is L-Colorable, Independent Set of Size n/(8L) if Half the Jobs Finish by L·lbResearch Paper

In the job shop problem, jobs are sequences of operations, each to be processed on a given machine for a given time, and the goal is a schedule of minimum makespan (the time at which the last job finishes). Two numbers bound the optimum from below: the longest job and the most loaded machine. Their maximum is written lb\mathrm{lb}lb. The best approximation…

12 thms2 active usersReviewed
PreviousPage 89 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