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: mikedeng1

Project Scheduling with Time Windows and Scarce Resources III: Active, Semiactive, Pseudoactive and Quasiactive Schedules Are Minimal Points of the Feasible RegionTextbook

Exact and heuristic methods for resource-constrained project scheduling do not search the whole continuum of start-time vectors. They enumerate a finite candidate set that is guaranteed to contain an optimal schedule. For machine scheduling and precedence-only project scheduling the classical candidate sets (semiactive and active schedules) are defined by…

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

The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems I: The Łojasiewicz Inequality at Critical Points of Continuous Subanalytic FunctionsResearch Paper

For a real-analytic function f:U→Rf : U \to \mathbb{R}f:U→R on an open set U⊆RnU \subseteq \mathbb{R}^nU⊆Rn and a critical point aaa (so ∇f(a)=0\nabla f(a) = 0∇f(a)=0), the Łojasiewicz gradient inequality says that there is an exponent θ∈[0,1)\theta \in [0,1)θ∈[0,1) such that ∣f−f(a)∣θ/∥∇f∥|f - f(a)|^{\theta} / \|\nabla f\|∣f−f(a)∣θ/∥∇f∥ stays bounded near aaa. It is the standard tool for proving that bounded gradient trajectories …

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

Air Travel Demand and Airline Seat Inventory Management III: Gaussian EMSR Protection Levels and Their SensitivityTextbook

An airline sells the seats of one flight leg in several fare classes at different prices. Low-fare passengers usually book first, so the airline must decide how many seats to keep back, or protect, for later high-fare passengers. Peter Belobaba's 1987 MIT dissertation introduced the expected marginal seat revenue (EMSR) rule for this decision, and EMSR-type…

9 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: mikedeng1

Nonzero-Sum Stochastic Differential Games with Impulse Controls: A Verification Theorem with Applications 3: The Continuation Region Widens as the Fixed Intervention Cost GrowsResearch Paper

In an impulse control problem a controller does not steer a process continuously: at times of its choosing it shifts the state by a finite jump, paying a fixed cost plus a cost proportional to the jump. Such models describe central-bank interventions on an exchange rate, inventory replenishment and cash management. Aïd, Basei, Callegaro, Campi and Vargiolu (…

7 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryConvex OptimizationMachine Learning·Captain: mikedeng1

Blackwell Approachability and No-Regret Learning are Equivalent 1: Any Approachability Algorithm Yields Online Linear Optimization with Regret/T at Most 2κ Times Its Approachability RateResearch Paper

Online decision makers often have to choose an action before seeing the cost assigned to it. A no-regret algorithm performs almost as well, in total, as the best single action that could have been chosen after the costs were known. In a related repeated-game problem, Blackwell approachability asks a player to keep the average of vector payoffs close to a…

6 thms2 active usersReviewed
🏆Completed
Differential GeometryLinear algebra·Captain: mikedeng1

Projection-like Retractions on Matrix Manifolds III: Near a Locally Symmetric Point, the Projection onto a Spectral Manifold Is U Diag(P_M(λ(X))) UᵀResearch Paper

Riemannian optimization algorithms move along a manifold by taking a step in a tangent direction and then coming back to the manifold. The map that does the coming back is a retraction, and the most natural candidate on a submanifold of a Euclidean space is the projective retraction: add the tangent step, then take the nearest point of the manifold. Its…

8 thms2 active usersReviewed
🏆Completed
Bandit AlgorithmsMachine LearningReinforcement Learning·Captain: mikedeng1

Reinforcement Learning: An Introduction I: The Gradient Bandit Algorithm Is Stochastic Gradient AscentTextbook

The multi-armed bandit is the simplest setting in which a learner must trade off exploiting what it knows against exploring what it does not: one situation, kkk actions, and a reward drawn from an unknown distribution each time an action is taken. Chapter 2 of Sutton and Barto's Reinforcement Learning: An Introduction (2nd ed., MIT Press, 2018) uses it to…

11 thms2 active usersReviewed
🏆Completed
Graph TheoryLinear OptimizationOperations Research·Captain: mikedeng1

Project Scheduling with Time Windows and Scarce Resources VI: Stable, Semistable, Pseudostable and Quasistable Schedules Are Extreme Points of the Feasible RegionTextbook

Resource-constrained project scheduling with minimum and maximum time lags is the model behind make-to-order production, process-industry batch planning and large engineering projects. When the objective is the project duration or another regular function (nondecreasing in every start time), an optimum can be found among schedules that cannot be shifted to…

12 thms2 active usersReviewed
🏆Completed
CombinatoricsOperations Research·Captain: mikedeng1

Project Scheduling with Time Windows and Scarce Resources V: A Schedule Is Inventory-Feasible iff It Resolves Every Minimal Surplus and Shortage SetTextbook

In make-to-order production, chemical process industries and other manufacturing settings modelled as projects, activities do not only occupy machines for a while: they also consume intermediate products at their start and deposit products into storage facilities at their completion. Storage is bounded above by a tank or warehouse capacity and below by a…

7 thms2 active usersReviewed
🏆Completed
Convex OptimizationDiscrete GeometryLinear Optimization+1·Captain: mikedeng1

Understanding and Using Linear Programming XI: The KKT Conditions and the Unique Smallest Enclosing BallTextbook

The smallest enclosing ball problem asks, for finitely many points p1,…,pn∈Rdp_1,\dots,p_n\in\mathbb{R}^dp1​,…,pn​∈Rd, for a ball of the smallest radius that contains all of them. It appears in clustering, in collision detection and bounding-volume hierarchies, in facility location (placing one service point so that the farthest client is as close as possible), and in the…

7 thms2 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchTheoretical Computer Science·Captain: mikedeng1

Understanding and Using Linear Programming III: The Simplex Method with Bland's Rule Never CyclesTextbook

The simplex method, introduced by G. B. Dantzig in 1947, is the standard algorithm for linear programming and remains the core of commercial solvers. It moves from one basic feasible solution to another by pivot steps, and at each step a pivot rule chooses which variable enters and which leaves the basis. For several natural rules, including Dantzig's…

7 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations Research·Captain: mikedeng1

Dynamic Pricing Strategies with Reference Effects III: Global Monotone Convergence of Optimal PricesResearch Paper

Consumers judge a price against a reference price, an internal standard formed from the prices they have seen before. A price below the reference feels like a gain and raises demand; a price above it feels like a loss and lowers demand. The effect is documented empirically in marketing and behavioural economics (Kalyanaram and Winer 1995). It forces a…

10 thms2 active usersReviewed
🏆Completed
CombinatoricsDiscrete GeometryLinear Optimization+1·Captain: mikedeng1

Understanding and Using Linear Programming X: Pairwise Intersecting d-Intervals Have a Transversal of Size 2d²Textbook

A basic question of combinatorial geometry asks when a family of sets can be pierced (or stabbed) by few points. For intervals on the real line the answer is classical: if every two of finitely many closed intervals intersect, one point meets all of them, namely the rightmost left endpoint. This is the one-dimensional case of Helly's theorem. The situation…

8 thms2 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchRandom Matrix Theory·Captain: mikedeng1

Understanding and Using Linear Programming IX: Basis Pursuit Recovers Sparse Solutions Exactly iff the Kernel Misses the CrosspolytopeTextbook

A deep-space probe sends a vector w∈Rkw\in\mathbb{R}^kw∈Rk encoded as z=Qw∈Rnz=Qw\in\mathbb{R}^nz=Qw∈Rn, and up to about 8% of the transmitted numbers may be corrupted arbitrarily. Section 8.5 of Matoušek and Gärtner's Understanding and Using Linear Programming (Springer 2007, DOI 10.1007/978-3-540-30717-4) shows that decoding reduces to finding a sparse solution of an…

7 thms2 active usersReviewed
🏆Completed
CombinatoricsInformation TheoryLinear Optimization+1·Captain: mikedeng1

Understanding and Using Linear Programming VIII: The Delsarte Linear Programming Bound for Binary CodesTextbook

A binary error-correcting code is a set of nnn-bit words chosen so that the words stay distinguishable after a few bits have been corrupted in transmission. A code can correct any rrr errors exactly when every two of its words differ in at least 2r+12r+12r+1 positions. The more words the code has, the more information each transmitted block carries. So the central…

10 thms2 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchProbability·Captain: mikedeng1

A Randomized Linear Programming Method for Computing Network Bid Prices II: Directional Derivatives of Expected Perfect-Information Revenue Are Expected LP ValuesResearch Paper

Airlines, hotels and railways sell a fixed stock of capacity on several resources at once: a passenger flying from Boston to Los Angeles through Chicago uses a seat on two flight legs. Network revenue management decides which requests to accept, and the standard control is a bid price per leg: accept an itinerary if its fare exceeds the sum of the bid…

8 thms2 active usersReviewed
🏆Completed
Linear OptimizationOperations ResearchProbability·Captain: mikedeng1

A Randomized Linear Programming Method for Computing Network Bid Prices I: Averaged LP Dual Prices Are an Unbiased Estimate of the Gradient of Expected Perfect-Information RevenueResearch Paper

Airlines, hotels and railways sell fixed capacity on networks of resources. In network revenue management a request for an itinerary that uses several flight legs is accepted or rejected in real time, and the dominant industrial control is the bid-price control: every leg carries a price, and a request is accepted only if its fare is at least the sum of the…

8 thms2 active usersReviewed
🏆Completed
CombinatoricsLinear OptimizationOperations Research+1·Captain: mikedeng1

Understanding and Using Linear Programming VII: LP Rounding Schedules Unrelated Machines Within Twice the Optimal MakespanTextbook

Scheduling indivisible jobs on parallel machines to finish all of them as early as possible is a basic problem in operations research and in the theory of algorithms. In the unrelated machines model each job may take a different time on each machine, with no relation between the rows of the time table, as when machines of different types (black-and-white,…

7 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryLinear OptimizationOperations Research·Captain: mikedeng1

Understanding and Using Linear Programming VI: The Minimax Theorem for Zero-Sum GamesTextbook

A two-player zero-sum game models any situation in which one party's gain is exactly the other party's loss: a military allocation in the spirit of Colonel Blotto, a sealed-bid contest, rock–paper–scissors. The central question is what each player should do when the opponent is also reasoning about them. John von Neumann answered it in 1928 with the minimax…

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

Understanding and Using Linear Programming II: Optimal Basic Feasible Solutions and Vertices in Equational FormTextbook

Every finite algorithm for linear programming rests on one structural fact: if a linear program has an optimum at all, it has one at a point singled out by finitely many linear conditions. The simplex method walks between such points, and exact complexity analyses, sensitivity analysis and integrality arguments all start from them. Chapter 4 of J. Matoušek…

6 thms2 active usersReviewed
🏆Completed
Convex OptimizationLinear OptimizationOperations Research·Captain: mikedeng1

On the Choice-Based Linear Programming Model for Network Revenue Management II: Only Efficient Offer Sets Carry Time in an Optimal CDLP SolutionResearch Paper

Airlines, hotels and rail operators sell many products (an itinerary combined with a fare class) that share a network of finite resources (flight legs, room-nights). When customers choose among whatever products are on offer, the firm's control is no longer "accept or reject a request for product jjj" but which set of products to offer at each moment. The…

9 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryMechanism DesignOperations Research+1·Captain: mikedeng1

An Introduction to the Theory of Mechanism Design III: Impossibility of First-Best Public Goods ProvisionTextbook

Whether a community can finance a shared project out of voluntary contributions, when each member knows only her own benefit from it, is one of the founding questions of mechanism design. Bayesian mechanism design began with mechanisms for the provision of public goods: d'Aspremont and Gérard-Varet (1979) and Arrow (1979) showed that the efficient decision…

10 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryMechanism DesignOperations Research+1·Captain: mikedeng1

An Introduction to the Theory of Mechanism Design II: Myerson's Optimal Single-Unit AuctionTextbook

A seller with one indivisible good and several potential buyers, each of whom privately knows how much the good is worth to them, has to choose a selling procedure: a posted price, an English auction, a sealed-bid auction with a reserve price, or something more elaborate. Which procedure raises the most expected revenue? Myerson's answer (Myerson 1981) is…

12 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryFunctional AnalysisMechanism Design+1·Captain: mikedeng1

An Introduction to the Theory of Mechanism Design I: Screening and the Optimality of a Posted PriceTextbook

A seller with one good and one buyer whose valuation she does not know faces the simplest problem of mechanism design: choose a selling procedure, anticipating that the buyer will act in his own interest given what he knows. The textbook answer, "post the monopoly price", is usually derived by optimizing over prices alone. The question that opens Börgers' An…

16 thms2 active usersReviewed
🏆Completed
Control TheoryDynamic ProgrammingOperations Research+1·Captain: mikedeng1

Bellman's Dynamic Programming VI: Optimal Policies for the Continuous Gold-Mining ProcessTextbook

Chapter II of Richard Bellman's Dynamic Programming (Princeton University Press, 1957) solves a discrete gold-mining process: a single machine can be used in one of two mines, each use extracts a fixed fraction of the gold remaining in that mine, and each use carries a fixed risk of destroying the machine. Maximizing the expected total gold leads to an index…

11 thms2 active usersReviewed
PreviousPage 63 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