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
Dynamic ProgrammingMarkov ChainOperations Research·Captain: mikedeng1

Inventory Control in a Fluctuating Demand Environment I: With Linear Order Costs, a World-Dependent Basestock Policy Is Optimal over the Infinite HorizonResearch Paper

An inventory controller must decide how much to order while demand changes with an observed external condition. A single demand rate misses that dependence: the same inventory position can justify different orders when the condition changes. Song and Zipkin's 1993 study asks whether a simple policy remains optimal when the condition follows a…

12 thms3 active usersReviewed
🏆Completed
Complexity TheoryLinear OptimizationOperations Research·Captain: mikedeng1

On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming 1: The Predictor–Corrector Algorithm Between N₂(1/4) and N₂(1/2) Attains Precision t in O(√n·t) IterationsResearch Paper

Linear programming asks for the best value of a linear objective subject to linear equations and inequalities. Primal-dual interior-point methods seek feasible primal and dual solutions while keeping every constrained coordinate positive. The resulting pair has a measurable gap between its objective values, so an algorithm can stop when the gap is below a…

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

Optimal Pricing and Return Policies for Perishable Commodities I: Unlimited Returns at Partial Credit Coordinate the Channel for Every Demand DistributionResearch Paper

A manufacturer of a perishable good (newspapers, magazines, bread, seasonal fashion, printed books) sells through a retailer who must commit to an order before demand is known. Unsold units lose most of their value; unmet demand costs goodwill. When the retailer alone bears the risk of leftovers, it orders less than an integrated firm would, and the channel…

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

A Functional Equation and Its Application to Resource Allocation and Sequencing Problems 2: Under Precedence Constraints, All Deadlines Can Be Met iff They Are Met in Order of Modified DeadlinesResearch Paper

A single machine must process nnn jobs, each with a processing time and a deadline, and some jobs must be finished before others may start. The first question of any planner is whether the deadlines can be met at all. Without precedence constraints the answer is classical: Jackson's rule (J. R. Jackson, 1955, reported by W. E. Smith, 1956) says that all jobs…

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

The Fritz John Necessary Optimality Conditions in the Presence of Equality and Inequality Constraints: Every Minimizer of a C¹ Program Admits Multipliers (ū₀, ū, v̄) ≠ 0 with ū ≥ 0Research Paper

For problems with inequality constraints only, F. John (1948) showed that every minimizer admits nonnegative multipliers (uˉ0,uˉ1,…,uˉm)≠0(\bar u_0, \bar u_1, \dots, \bar u_m) \ne 0(uˉ0​,uˉ1​,…,uˉm​)=0, one of which belongs to the objective. The Kuhn–Tucker conditions (1951) are the stronger statement in which the objective's multiplier can be taken equal to one; they need a constraint…

7 thms3 active usersReviewed
🏆Completed
Dynamic ProgrammingLinear OptimizationMarkov Chain+1·Captain: mikedeng1

Linear Programming and Finite Markovian Control Problems VII: Bias Optimality — Four Equivalent Characterizations of a Bias Optimal Pure Stationary PolicyTextbook

A finite Markov decision problem can have several policies with the same long-run average reward even though they behave differently before reaching a recurrent class. Average reward discards a finite initial advantage: dividing total reward by the horizon sends any fixed transient contribution to zero. In applications where the process runs for a long but…

8 thms3 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryOperations Research·Captain: mikedeng1

Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem 1: The Spanning-Tree Interchange Tour ψ* Is a Minimal Cost TourResearch Paper

The traveling salesman problem is NP-hard in general, so special cost structures under which it can be solved exactly in polynomial time are of lasting interest in combinatorial optimization and scheduling. One of the earliest and most cited such cases comes from sequencing on a machine whose condition is described by a single real number: a furnace…

15 thms3 active usersReviewed
🏆Completed
Convex OptimizationFunctional Analysis·Captain: mikedeng1

A Dual Algorithm for the Solution of Nonlinear Variational Problems via Finite Element Approximation 1: For 0 < ρ < 2r, the Modified Dual Algorithm Converges Strongly to (v*, Av*)Research Paper

Many problems in mechanics and optimal control are posed as the minimization of a convex functional of the form f(Av)−⟨b,v⟩f(Av)-\langle b,v\ranglef(Av)−⟨b,v⟩, where AAA is a differential operator and fff is non-smooth: an obstacle, a friction term, a plasticity threshold. Splitting the variable, y=Avy=Avy=Av, separates the linear operator from the non-smooth function, and a Lagrange…

16 thms3 active usersReviewed
🏆Completed
Numerical AnalysisOperations Research·Captain: mikedeng1

Globally Convergent Inexact Newton Methods I: Inexact Newton Backtracking Converges to Every Limit Point Where F′ Is Invertible, That Point Is a Zero of F, and Initial Steps Are Eventually AcceptedResearch Paper

Newton's method for a nonlinear system F(x)=0F(x) = 0F(x)=0, with F:Rn→RnF:\mathbb R^n\to\mathbb R^nF:Rn→Rn, solves the linear system F′(xk)sk=−F(xk)F'(x_k)s_k = -F(x_k)F′(xk​)sk​=−F(xk​) at every step. For large systems that solve is itself iterative (a Krylov method such as GMRES), and it is stopped early. The resulting inexact Newton methods, introduced by Dembo, Eisenstat and Steihaug (SIAM J. Numer. Anal. 19…

12 thms3 active usersReviewed
Convex OptimizationLinear OptimizationOperations Research·Captain: mikedeng1

The Ellipsoid Method and Its Consequences in Combinatorial Optimization: With a Weak Separation Oracle, the Rounded Ellipsoid Method Is ε-Optimal After N = 4n²⌈log(2R²‖c‖/(rε))⌉ StepsResearch Paper

The ellipsoid method decides questions about a convex set K⊆RnK \subseteq \mathbb{R}^nK⊆Rn by maintaining an ellipsoid that contains the relevant part of KKK and shrinking it step by step. Introduced for convex minimization by Yudin and Nemirovskii and by Shor in the 1970s, it became famous in 1979 when Khachiyan used it to show that linear programming is solvable in…

10 thms3 active usersReviewed
🏆Completed
Operations ResearchProbabilityStatistics·Captain: mikedeng1

Statistics of Robust Optimization: A Generalized Empirical Likelihood Approach 3: Robust Optimal Values and Solution Sets over f-Divergence Balls Are ConsistentResearch Paper

Stochastic optimization asks for a decision xxx in a set X⊂Rd\mathcal X\subset\mathbb R^dX⊂Rd that minimises an expected loss EP0[ℓ(x;ξ)]E_{P_0}[\ell(x;\xi)]EP0​​[ℓ(x;ξ)] when the distribution P0P_0P0​ of the data ξ\xiξ is known only through a sample ξ1,…,ξn\xi_1,\dots,\xi_nξ1​,…,ξn​. The classical estimator, sample average approximation, replaces P0P_0P0​ by the empirical distribution P^n\widehat P_nPn​. Distributionally…

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

Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints 1: Under Normality, the E-Model Chance Constraints Are Equivalent to the Convex Program (29)Research Paper

Chance-constrained programming replaces a linear program max⁡c′x\max c'xmaxc′x subject to Ax≤bAx\le bAx≤b by a problem in which some data are random and each constraint only has to hold with a prescribed probability. Charnes and Cooper introduced the idea in 1959 for scheduling heating-oil production against weather-dependent demand, and the formulation is now a standard…

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

Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey 2: The Optimal Preemptive Open Shop Makespan Equals the Largest Machine Load or Job LengthResearch Paper

Open shops model production and service systems in which every job must visit every machine, but the order of the visits is free: a car that needs an inspection, a wash and a tyre change, a patient who needs several tests, a student who sits several exams. The survey of Graham, Lawler, Lenstra and Rinnooy Kan (Ann. Discrete Math. 5, 1979) fixed the…

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

Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey 1: The Optimal Two-Machine Open Shop Makespan Is max{T₁, T₂, maxⱼ(aⱼ + bⱼ)}Research Paper

Shop scheduling asks how to sequence jobs that each need processing on several machines. In an open shop, a job's operations may be executed in any order, as in testing stations, repair bays, or classroom and examination timetables, where the order in which a candidate visits the stations is irrelevant. The objective studied here is the makespan Cmax⁡C_{\max}Cmax​,…

9 thms3 active usersReviewed
🏆Completed
Linear OptimizationOperations Research·Captain: mikedeng1

On the Relation Between Integer and Noninteger Solutions to Linear Programs: Deep in the Optimal-Basis Cone, z₂(b) = z₁(b) + φ(b) and the Group Problem Gives an Integer OptimumResearch Paper

An integer program is a linear program whose variables must take integer values. Its linear relaxation can be solved efficiently, while the integer program itself is NP-hard in general, so a recurring question in integer programming is how much the optimal solution of the relaxation says about the integer optimum. Simple rounding of the fractional optimum…

11 thms3 active usersReviewed
Algorithmic Game TheoryConvex OptimizationOperations Research·Captain: mikedeng1

Cooperative Fuzzy Games 1: A Balanced Game without Side Payments Has a Nonempty Core Containing the Core of Its Fuzzy ExtensionResearch Paper

A game without side payments (an NTU game) describes cooperation in which utility cannot be transferred between players: each coalition AAA of players is assigned the set V(A)V(A)V(A) of payoff vectors it can secure on its own. The core is the set of payoffs to the grand coalition that no coalition can improve upon. Whether the core is nonempty is the basic stability…

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

Data-Driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulations II: Worst-Case Distributions from a Finite Convex ProgramResearch Paper

In data-driven stochastic optimization a decision maker knows the distribution of an uncertain parameter ξ\xiξ only through NNN samples ξ^1,…,ξ^N\hat\xi_1,\dots,\hat\xi_Nξ^​1​,…,ξ^​N​. Wasserstein distributionally robust optimization hedges against this ignorance by evaluating a loss ℓ\ellℓ under the worst distribution in a ball, measured in the Wasserstein metric, around the…

17 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimal Transport·Captain: mikedeng1

Data-Driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulations I: Wasserstein Worst-Case Expectations as Finite Convex ProgramsResearch Paper

A decision maker who must minimize an expected cost EP[h(x,ξ)]\mathbb E^{\mathbb P}[h(x,\xi)]EP[h(x,ξ)] rarely knows the distribution P\mathbb PP of the uncertain parameter ξ\xiξ; usually only NNN samples ξ^1,…,ξ^N\hat\xi_1,\dots,\hat\xi_Nξ^​1​,…,ξ^​N​ are available. Replacing P\mathbb PP by the empirical distribution (sample average approximation) tends to produce decisions that perform poorly out of…

17 thms3 active usersReviewed
🏆Completed
Numerical Analysis·Captain: mikedeng1

On the Convergence of Interior-Reflective Newton Methods for Nonlinear Minimization Subject to Bounds 1: The Interior-Reflective Line Search Algorithm Drives D_k²g_k to ZeroResearch Paper

Minimizing a smooth function subject to simple bounds on the variables, l≤x≤ul\le x\le ul≤x≤u, is one of the most common problems in nonlinear optimization: it arises on its own (nonnegativity constraints, box-constrained least squares, parameter estimation with physical ranges) and as the subproblem of augmented Lagrangian and penalty methods. The classical…

8 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryMechanism DesignOperations Research·Captain: mikedeng1

Optimal Auction Design: Giving the Object to a Bidder with the Highest Priority Level c̄ᵢ(tᵢ) ≥ t₀ and Charging (6.8) Is an Optimal Auction MechanismResearch Paper

A seller with one indivisible object must decide whether to keep it or transfer it to one of several bidders whose values she does not observe. The allocation and the payment rule affect what bidders choose to report. Myerson's 1981 paper identifies a revenue-maximizing rule when bidders' private value estimates are independent, their densities are…

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

The Bargaining Problem: The Nash Product Maximizer Is the Unique Solution Satisfying Invariance, Symmetry, IIA and Pareto EfficiencyResearch Paper

Two parties who can cooperate for mutual benefit must still agree on how to share the benefit. In The Bargaining Problem (Econometrica, 1950) John Nash asked which agreement two rational bargainers of equal skill should reach. His answer is not a model of haggling: it is a list of conditions any reasonable rule should satisfy, together with a proof that…

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

Wait-and-Judge Scenario Optimization 2: Over Generic Sets, P^N{V(x_N) > ε(s_N)} ≤ γ*, the Least ξ(1) over Degree-N Polynomials Feasible for (31)Research Paper

A solution of a scenario optimization program is chosen after observing finitely many uncertain constraints. Its future reliability depends on constraints that were not sampled. The usual advance question asks how many samples are needed to make every output reliable. Campi and Garatti instead ask what can be certified after solving the program, when the…

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

Supply Chain Coordination with Contracts VI: With a Forecast Update, Buy-Back Terms with w₁ − w₂ + λc₂ = λc₁ Give the Retailer λΩ₁(q₁) and a Lower Period-2 Margin w₂ − c₂ < w₁ − c₁Textbook

A newsvendor retailer who may order twice faces a tradeoff. Ordering late lets the retailer use a better demand forecast. Ordering early lets the supplier produce more cheaply, with longer procurement lead times and no overtime labor. Fisher and Raman (1996) document such forecast improvements between ordering epochs in fashion apparel. A decentralized…

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

Supply Chain Coordination with Contracts VII: In the Single-Location Base-Stock Model the Transfers t_I = (1 − λ)h_r, t_B = β_r − λβ Make the Retailer's Cost λc(s_r)Textbook

A retailer can keep too little inventory even when its own stocking decision is optimal. In the single-location model of Cachon, Supply Chain Coordination with Contracts (2003), the supplier suffers a cost when the retailer has backorders, but the retailer does not bear that part of the cost. The supplier and retailer therefore prefer different base-stock…

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

Assortment Optimisation Under a General Discrete Choice Model: A Tight Analysis of Revenue-Ordered Assortments VI: Revenue-Ordered Offer Sets Grow with Capacity Left and Shrink with Time LeftResearch Paper

In airline and hotel revenue management a firm sells a fixed stock of a perishable resource (seats on a flight leg, rooms on a night) over a finite selling horizon, and in each period decides which fare classes to open. Customers do not buy a fixed fare: they choose among the fares on offer, or leave. Talluri and van Ryzin (Management Science, 2004)…

14 thms3 active usersReviewed
PreviousPage 46 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