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
CombinatoricsGraph TheoryLinear Optimization+1·Captain: Shuze Chen

Flows in Networks VII: Maximal Dynamic Flows from Temporally Repeated FlowsTextbook

Many transportation and evacuation questions ask how much can be shipped from a source to a sink within a time horizon, when every arc has both a capacity per period and a traversal time. Ford and Fulkerson posed this maximal dynamic flow problem in 1958 and solved it by a reduction that is now standard in network optimization: instead of solving a linear…

7 thms2 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryOperations Research·Captain: Shuze Chen

Flows in Networks II: Maximal Flow Value as a Function of Two Arc CapacitiesTextbook

The value of a maximal flow is the basic output of network-flow models of transport, communication and supply systems. A planner who can enlarge the capacity of a link wants to know what the enlargement buys. For a single link the answer is simple. For two links it is a question about interaction: does enlarging one make enlarging the other more valuable…

9 thms2 active usersReviewed
🏆Completed
Convex OptimizationNumerical AnalysisOperations Research·Captain: Shuze Chen

Lectures on Modern Convex Optimization X: Complexity of the Ellipsoid MethodTextbook

A convex program whose objective and feasible set are known only through oracles, routines that answer queries about one point at a time, can still be solved to any prescribed accuracy with a number of queries bounded in advance. The ellipsoid method is the classical algorithm that achieves this. It was introduced for convex minimization by Yudin and…

6 thms2 active usersReviewed
🏆Completed
Convex OptimizationLinear algebraNumerical Analysis+1·Captain: Shuze Chen

Lectures on Modern Convex Optimization XI: Primal-Dual Path-Following for Semidefinite ProgrammingTextbook

Semidefinite programming (SDP), the optimization of a linear function over the intersection of an affine subspace with the cone of positive semidefinite matrices, is the workhorse behind relaxations in combinatorial optimization, robust optimization and control. Its practical and theoretical tractability rests on interior point methods: algorithms that…

9 thms2 active usersReviewed
🏆Completed
Control TheoryConvex OptimizationOperations Research·Captain: Shuze Chen

Lectures on Modern Convex Optimization VIII: The Matrix Cube TheoremTextbook

Many questions in robust control and robust optimization reduce to one test: does a whole family of symmetric matrices, generated by perturbing a nominal matrix along several directions at once, stay positive semidefinite? A linear system whose coefficients are only known to lie in intervals is a typical case. Showing that one quadratic Lyapunov function…

10 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: Shuze Chen

Lectures on Modern Convex Optimization VII: The S-Lemma with Two Quadratic ConstraintsTextbook

A homogeneous quadratic inequality xTBx≥0x^TBx \ge 0xTBx≥0 may hold at every point where other quadratic inequalities xTAix≥0x^TA_ix \ge 0xTAi​x≥0 hold. Deciding when this happens is the quadratic analogue of the question the Farkas lemma answers for linear inequalities. It is the core of robust optimization with ellipsoidal uncertainty, of absolute stability in control (where it is…

10 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: Shuze Chen

Lectures on Modern Convex Optimization IV: The Compliance of a Truss Is Conic Quadratic RepresentableTextbook

Truss topology design asks for the stiffest elastic bar construction that can be built from a given set of potential bars with a given amount of material. It is one of the oldest test cases of structural optimization (Bendsøe and Sigmund, Topology Optimization, Springer 2003) and one of the main applications in Ben-Tal and Nemirovski's Lectures on Modern…

9 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: Shuze Chen

Lectures on Modern Convex Optimization II: The Conic Duality TheoremTextbook

Linear, second-order cone and semidefinite programming are three instances of one format: minimize a linear objective subject to the requirement that an affine image of the decision vector lie in a fixed convex cone. Ben-Tal and Nemirovski's Lectures on Modern Convex Optimization (SIAM 2001) builds its whole treatment of modelling and algorithms on this coni…

9 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: Shuze Chen

Lectures on Modern Convex Optimization III: The Convex Hull of Conic Quadratic Representable SetsTextbook

Conic quadratic programs (second-order cone programs) minimize a linear objective subject to finitely many constraints of the form ∥Dx−d∥2≤pTx−q\|Dx - d\|_2 \le p^Tx - q∥Dx−d∥2​≤pTx−q. They are solved by interior-point methods in polynomial time, and a large share of convex models in engineering, statistics and robust optimization can be rewritten in this form. Whether a given convex…

8 thms2 active usersReviewed
🏆Completed
Convex OptimizationLinear OptimizationOperations Research·Captain: Shuze Chen

Lectures on Modern Convex Optimization I: The Linear Programming Duality TheoremTextbook

Every linear program comes with a second linear program, its dual, whose feasible points certify lower bounds on the first program's optimal value. The duality theorem says that these certificates are complete: the best bound equals the optimal value whenever either is finite. It is the reason an LP solver can return a proof of optimality alongside a…

11 thms2 active usersReviewed
🏆Completed
EconomicsOperations Research·Captain: mikedeng1

Partial Completion as a Nonprofit Strategy: Under a Budget Constraint, the Optimal Variety and Completion Levels Follow Three Budget Regimes and Both Rise With the BudgetResearch Paper

A nonprofit choosing how to serve people with different needs may have two ways to use an additional dollar: offer more product variants, or deliver a larger fraction of each product. Beneficiaries can sometimes finish an incomplete product themselves, but doing so takes effort. Zhang, Atasu and Ramachandran study this choice for services such as…

8 thms2 active usersReviewed
🏆Completed
EconomicsOperations Research·Captain: mikedeng1

Technological Determinants of Financial Constraints: Peak Cumulative Likelihood Ratio Ranks Agency Rents at Low Disutility of Effort; the Left-Tail Entrepreneur Has the Lower Rent at High DisutilityResearch Paper

Financial constraints, the gap between what a firm could produce and what it can raise from outside investors, are a central object of corporate finance. In moral-hazard models of financing, an entrepreneur must be paid an agency rent to exert unobservable effort, and the investor can only be repaid out of what is left; the agency rent therefore fixes the…

11 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchTheoretical Computer Science·Captain: mikedeng1

A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems: The Dynamic Program over Great-Looking States Finds a Testing Scheme Within Factor 1 + O(ε) of OptimalResearch Paper

A series system works only if every one of its components works. Deciding whether it works by inspecting components one at a time, in the order that minimizes the expected inspection cost, is the classic sequential testing problem for series systems (Mitten 1960; Butterworth 1972; Simon & Kadane 1975). It is solved by sorting the components by the ratio …

16 thms2 active usersReviewed
🏆Completed
Operations ResearchTheoretical Computer Science·Captain: mikedeng1

Online Capacity Scaling Augmented With Unreliable Machine Learning Predictions: Adaptive Balanced Capacity Scaling Is min((1+(√(2ωβ)+θ)η)·OCR, PCR)-Competitive with η-Accurate PredictionsResearch Paper

A data center can save energy by running fewer servers when demand is low, but restarting servers costs energy and queued work delays users. A controller must choose capacity while demand arrives, with limited knowledge of future traffic. Forecasts can help, yet an inaccurate forecast can make a controller perform worse than one that ignores it. Rutten and…

9 thms2 active usersReviewed
🏆Completed
Linear algebraStatisticsTheoretical Computer Science·Captain: mikedeng1

Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design: Sampling with an α-Approximate (d−1, d)-Wise Independent Measure Gives an α-ApproximationResearch Paper

In linear regression with a budget, an experimenter holds nnn candidate experiments, each described by a vector vi∈Rdv_i\in\mathbb R^dvi​∈Rd, and may run only kkk of them. If the experiments in S⊆[n]S\subseteq[n]S⊆[n] are run and the unknown parameter is estimated by least squares, the covariance of the estimate is proportional to (∑i∈Svivi⊤)−1\big(\sum_{i\in S}v_iv_i^\top\big)^{-1}(∑i∈S​vi​vi⊤​)−1. A-optimal…

10 thms2 active usersReviewed
🏆Completed
Control TheoryEconomics·Captain: mikedeng1

Extrapolation Bias and Dynamic Liquidity Management: Ambiguity-Averse Worst-Case Beliefs Shift Pessimism toward Temporary Cash-Flow Shocks as Cash Runs LowResearch Paper

A firm can have valuable operations yet fail when a temporary cash shortfall leaves it unable to pay its bills. Cash reserves protect the firm, but holding them is costly. In Lee and Rivera’s study, the manager also doubts the probability model for future shocks. The manager evaluates a policy under the least favorable model within a prescribed set of…

6 thms2 active usersReviewed
🏆Completed
EconomicsOperations Research·Captain: mikedeng1

Tail Risk and Robust Portfolio Decisions: Under Jump Ambiguity the Robust Optimal Portfolio Splits into a Closed-Form Diffusion Exposure and a Jump Exposure Solving a Reduced ProblemResearch Paper

Investors who hold risky assets face losses from occasional jumps in prices. Such jumps are infrequent, so their frequency and size distribution can be harder to estimate than ordinary price fluctuations. Jin, Luo, and Zeng study how a portfolio changes when an investor treats both the arrival rate and the size distribution of jumps as uncertain. Their 2017…

7 thms2 active usersReviewed
🏆Completed
Linear algebraOperations ResearchStatistics·Captain: mikedeng1

A Theory of Statistical Inference for Ensuring the Robustness of Scientific Results: Closed-Form Tethered Hacking Interval for the Least Squares Average Treatment EffectResearch Paper

Scientific conclusions based on a fitted model can move when an analyst changes the model while keeping its fit to the observed data nearly as good. Coker, Rudin, and King call the resulting range of conclusions a tethered hacking interval. The range measures the sensitivity of a reported statistic to the choice among models under a fixed loss tolerance.…

7 thms2 active usersReviewed
🏆Completed
Operations ResearchStatistics·Captain: mikedeng1

Flexible Drug Approval Policies: The Optimal Significance Level Is Higher for Diseases with Long Clinical Trials, High Attrition and Low R&D IntensityResearch Paper

A drug regulator approves a candidate drug when its clinical trial rejects the null hypothesis of no effect at a fixed significance level α\alphaα. FDA guidelines recommend the same threshold, α=2.5%\alpha = 2.5\%α=2.5%, for every disease (Bravo, Corcoran and Long, p. 2). A uniform threshold balances the wrong errors for some diseases. For a severe disease with no…

12 thms2 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: mikedeng1

Optimally Scheduling Heterogeneous Impatient Customers: The Fluid-Optimal Schedule Splits at Most One Customer Class into Two SubclassesResearch Paper

Call centers and other many-server service systems serve several classes of customers, each with its own service-time distribution, patience distribution and cost of waiting or abandoning. A customer who waits longer than its patience time abandons. The system manager decides, whenever an agent becomes free, which class to serve and which customer inside…

4 thms2 active usersReviewed
🏆Completed
Convex OptimizationMachine Learning·Captain: mikedeng1

Naive Feature Selection: A Nearly Tight Convex Relaxation for Sparse Naive Bayes: The Sparse Multinomial Relaxation Bound Is Tight up to Four Features, ψ(k − 4) ≤ ϕ(k) ≤ ψ(k) ≤ ϕ(k + 4)Research Paper

Naive Bayes is one of the oldest and cheapest classifiers for text and count data: given word counts for documents in two classes, it fits one multinomial distribution per class by maximum likelihood and classifies by the likelihood ratio. Its cost is a single pass over the data. In high-dimensional applications (text, genomics) one also wants the…

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

Systemic Risk-Driven Portfolio Selection: Closed-Form Portfolio Maximizing Co-Expected Returns When the System Is at Its VaR Level and Portfolio Returns Are below CoVaRResearch Paper

A portfolio can look attractive on average and still perform poorly when the financial system is under stress. Capponi and Rubtsov's Systemic Risk Driven Portfolio Selection asks an investor to choose asset weights using the portfolio return expected in a specified system stress state, rather than using only an unconditional mean or variance. The question…

10 thms2 active usersReviewed
🏆Completed
EconomicsOperations Research·Captain: mikedeng1

A Two-Sided Incentive Program for Coordinating the Influenza Vaccine Supply Chain: The Modified Program Coordinates Supply and Demand, Is Ex-Ante Budget-Neutral and Splits Welfare ArbitrarilyResearch Paper

Influenza vaccine is made in fertilized chicken eggs, and how many doses an egg yields is not known until production is under way. By the time the season begins, the realized supply can fall short of, or exceed, what a planner would want. Two inefficiencies then compound. On the supply side, a manufacturer paid a wholesale price per dose sold carries all…

7 thms2 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

New-Product Diffusion in Closed-Loop Supply Chains: Immediate Fulfillment Is Optimal When Remanufactured-Item Demand Never Falls Short of the Accumulated ReturnsResearch Paper

When a new durable product is launched, demand typically follows a diffusion curve. A few innovators buy on their own, and later buyers, the imitators, are drawn in by word of mouth from earlier adopters. Bass's diffusion model (Bass 1969) is the standard description of this process and is used throughout marketing and operations to forecast the sales of…

6 thms2 active usersReviewed
🏆Completed
Operations Research·Captain: mikedeng1

The Effect of Multi-Channel and Omni-Channel Retailing on Physical Stores: A Higher Return Rate Calls for Fewer Physical Stores, a Broader Assortment, and Larger Stores When hr(1 − 2γ) > hoResearch Paper

Retailers that sell through both a website and physical stores must choose how many stores to operate and which products to stock in them. Product returns change that decision: a customer who is uncertain about a product may inspect it in a store instead of purchasing it online and later returning it. Gao, Agrawal, and Cui study this tradeoff in a model…

6 thms2 active usersReviewed
PreviousPage 49 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