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 ResearchProbability·Captain: iris

Stochastic Linear Programming: Models, Theory, and Computation XII: aggregating a stagewise independent multistage program gives a lower bound that refining never decreasesTextbook

A multi-stage stochastic linear program chooses decisions over TTT stages while a random process unfolds, each decision depending only on what has been observed so far. Such problems arise in planning under uncertainty, from production and energy systems to asset-liability management. With a non-discrete distribution the unknowns are functions, and the…

48 thms3 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: iris

Stochastic Linear Programming: Models, Theory, and Computation V: integrated chance constraints with a finite discrete distribution define polyhedraTextbook

A probability constraint in a stochastic linear program asks that a random linear inequality hold with high probability. It counts every violation the same, however large, and the feasible set it defines is in general not convex, as Klein Haneveld's examples show (Klein Haneveld 1986). Integrated chance constraints replace the probability of a shortfall…

17 thms3 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: iris

Combinatorial Optimization (Cook et al.) VI: The Tutte–Berge Formula for the Maximum Size of a MatchingTextbook

A matching pairs up nodes of a graph along its edges, each node being used at most once. Finding a largest matching is the model problem of combinatorial optimization: the obvious linear relaxation is not integral on non-bipartite graphs, and the methods developed for it (augmenting paths, odd-circuit shrinking, polyhedral descriptions) became standard…

37 thms3 active usersReviewed
🏆Completed
CombinatoricsLinear Optimization·Captain: iris

Combinatorial Optimization (Cook et al.) XII: Edmonds' Matroid Polytope TheoremTextbook

The Greedy Algorithm builds a set one element at a time, always adding the heaviest element that keeps the set feasible. For the forests of a graph it finds a maximum-weight forest (Kruskal's algorithm), but for the matchings of a graph it can fail: on a 4-cycle with edge weights 9, 7, 8, 3 it picks the edges of weight 9 and 3 when the edges of weight 7 and…

21 thms3 active usersReviewed
🏆Completed
CombinatoricsGraph Theory·Captain: iris

Combinatorial Optimization (Cook et al.) IV: In a Legal Ordering the Last Node's Star Is a Minimum Cut Separating the Last Two NodesTextbook

The global minimum cut problem asks, for a finite undirected graph with nonnegative edge capacities, for a partition of the nodes into two nonempty sides that is crossed by edges of least total capacity. With unit capacities the optimal value is the edge-connectivity of the graph, a basic measure of network reliability; with general capacities the problem…

14 thms3 active usersReviewed
🏆Completed
Numerical Analysis·Captain: iris

Error Analysis of Surrogate Models Constructed through Operations on Sub-models: a product of nnn models exact at x0x_0x0​ has Hessian accuracy of order min⁡{Nig,Nih}\min\{N^g_i,N^h_i\}min{Nig​,Nih​} with constant KFh(x0)K^h_F(x_0)KFh​(x0​)Research Paper

In derivative-free and blackbox optimization, the objective can often be evaluated but not differentiated, and algorithms work with surrogate models built from function values. Their convergence theory depends on how accurate those models are. Conn, Scheinberg and Vicente codified this through fully linear and fully quadratic models; a fully linear class…

17 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: Shuze Chen

Joint Estimation and Robustness Optimization: Support functions of estimate uncertainty sets via convex conjugatesResearch Paper

An optimization model often takes an estimated parameter as if it were known exactly. A decision that performs well at that estimate can perform poorly at another parameter value that fits the observations almost as well. Joint estimation and robustness optimization connects these two tasks by constructing the uncertainty set from the estimation procedure…

3 thms3 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: Shuze Chen

Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems: Exact reformulation of absolute regret with objective uncertaintyResearch Paper

A planner who commits resources before learning their eventual returns can evaluate a decision by how much better another decision would have performed after those returns became known. This absolute regret criterion compares against the best feasible hindsight decision under the same realization of uncertainty. It differs from protecting only the lowest…

6 thms3 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: Shuze Chen

Distribution-Free Inventory Risk Pooling in a Multilocation Newsvendor: Tight worst-case cost for two locationsResearch Paper

A retailer with stock at several locations can serve a customer from a nearby location when local inventory runs out. This flexibility reduces shortages, but shipping and unused inventory still cost money. Evaluating the benefit requires a joint demand distribution: high demand at one location is easier to absorb when demand elsewhere is low. In practice, a…

8 thms3 active usersReviewed
🏆Completed
Linear OptimizationProbability·Captain: Shuze Chen

The Price of Robustness: Tight probability bounds for symmetric uncertaintyResearch Paper

A linear optimization model can prescribe a decision that uses nearly all available capacity. If the coefficients measuring resource consumption are uncertain, even a small change can make that decision infeasible. Protecting against every simultaneous adverse change can instead sacrifice a substantial amount of the nominal objective. Budgeted robustness int…

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

A Nonparametric Algorithm for Optimal Stopping Based on Robust Optimization: Existence and finite characterization of optimal robust stopping rulesResearch Paper

An exercise decision can depend on today's observed state even when the evolution of that state depends on its history. Examples include deciding when to exercise an option whose reward depends on several asset prices or on earlier observations. A simulator can produce complete trajectories without providing the conditional distributions needed for a…

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

ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs: ALSO-X is at least as good as CVaRResearch Paper

A chance constrained program chooses a decision before observing uncertainty and limits the probability that its constraints fail. For example, a service system can allow a prescribed fraction of demand realizations to exceed its available capacity. The optimization problem combines a cost objective with a probability requirement. Even when each realized…

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

Assortment Optimization for a Multistage Choice Model: Revenue-ordered and nested optimal assortmentsResearch Paper

A seller may offer one catalog of products now and a different catalog later. A customer's first purchase can determine which products become available in the second stage. An airline ticket followed by an upgrade offer is one example. When customers anticipate those later offers, changing a continuation assortment can change demand in the first stage as…

10 thms3 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: Shuze Chen

Production Planning by Mixed Integer Programming V: Intersecting Constant-Capacity Lot-Sizing HullsTextbook

A production plan must meet demand on time while deciding which periods justify a setup. When each active period can supply at most the same amount, the capacity limit links setup decisions to cumulative demand. A linear relaxation that treats those decisions as fractional may admit plans that cannot be assembled from feasible binary setup schedules.…

6 thms3 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: Shuze Chen

Production Planning by Mixed Integer Programming III: The Wagner–Whitin Convex HullTextbook

A production planner must meet demand over several periods while deciding when to incur fixed setup costs. Producing early can combine several periods into one batch, but the resulting inventory carries a holding cost. Even for one item without a capacity limit, continuous production quantities interact with discrete setup decisions. An exact linear…

6 thms3 active usersReviewed
🏆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
🏆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
PreviousPage 20 of 70Next

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