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
CombinatoricsOperations ResearchTheoretical Computer Science·Captain: mikedeng1

Approximation Techniques for Average Completion Time Scheduling III: From One Machine to Many with Delay ListResearch Paper

Minimizing the sum of weighted completion times ∑jwjCj\sum_j w_jC_j∑j​wj​Cj​ is one of the standard objectives of machine scheduling: it measures the average time a job spends in the system, weighted by its importance. With release dates or precedence constraints the problem is NP-hard already on one machine, and on mmm identical parallel machines it is harder still, so the…

12 thms3 active usersReviewed
🏆Completed
CombinatoricsOperations ResearchTheoretical Computer Science·Captain: mikedeng1

Approximation Techniques for Average Completion Time Scheduling II: A 2.83-Approximation for Parallel Machines with Release DatesResearch Paper

Minimizing the average completion time of jobs that arrive over time is a basic objective in machine scheduling. It measures how long a job spends in the system on average. With several identical machines, release dates and no preemption (written P∣rj∣∑CjP|r_j|\sum C_jP∣rj​∣∑Cj​), the problem is strongly NP-hard already on one machine. Research has therefore looked for…

11 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations ResearchProbability·Captain: mikedeng1

The Allocation of Inventory Risk in a Supply Chain: Push, Pull, and Advance-Purchase Discount Contracts 3: Advance-Purchase Discounts Pareto-Improve Pull Contracts under At-Once Shipping CostsResearch Paper

A supplier and a retailer who trade a seasonal product must decide who carries the inventory risk: the stock left unsold, or the demand left unserved, when the season ends. With a push contract the retailer orders everything before the season and bears the risk; with a pull contract he orders during the season from the supplier's stock at a single wholesale…

9 thms3 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations ResearchProbability·Captain: mikedeng1

The Allocation of Inventory Risk in a Supply Chain: Push, Pull, and Advance-Purchase Discount Contracts 2: Advance-Purchase Discounts Coordinate the Supply ChainResearch Paper

A supplier who must produce before a selling season, and a retailer who sells into uncertain demand, have to decide who holds the inventory that may go unsold. Cachon (Management Science 50(2), 2004) studies this allocation of inventory risk using nothing but wholesale prices. With a push contract the retailer orders everything before production and bears…

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

The Allocation of Inventory Risk in a Supply Chain: Push, Pull, and Advance-Purchase Discount Contracts 1: The Pareto Set of Push and Pull ContractsResearch Paper

A supplier and a retailer trade a product with a single selling season and uncertain demand. Someone has to decide, before demand is known, how many units exist, and someone has to be left holding the units that do not sell. With a push contract the retailer orders (prebooks) before the season and bears all of this risk; with a pull contract the supplier…

15 thms3 active usersReviewed
🏆Completed
Convex OptimizationOperations Research·Captain: mikedeng1

Generalization Bounds in the Predict-then-Optimize Framework III: Strongly Convex Sets Satisfy the Strength PropertyResearch Paper

In the predict-then-optimize framework, a machine-learning model predicts the cost vector c^\hat cc^ of a linear optimization problem min⁡w∈Sc^⊤w\min_{w\in S}\hat c^\top wminw∈S​c^⊤w, and a decision is made by solving that problem with the prediction. Elmachtoub and Grigas (Smart "Predict, then Optimize", Management Science 2022) proposed judging predictions by the SPO loss, the…

7 thms3 active usersReviewed
🏆Completed
CombinatoricsOperations ResearchTheoretical Computer Science·Captain: mikedeng1

Local Search Heuristics for k-Median and Facility Location Problems IV: Local Search with Multi-Copy Moves for Capacitated Facility Location Has Locality Gap 4Research Paper

Facility location asks where to open service points (warehouses, plants, servers) and how to connect customers to them so that the total opening cost plus the total connection cost is minimum. In the capacitated version each facility can serve only a limited number of customers, which is the situation in most applications: a warehouse has a floor area, a…

10 thms3 active usersReviewed
🏆Completed
CombinatoricsOperations ResearchTheoretical Computer Science·Captain: mikedeng1

Local Search Heuristics for k-Median and Facility Location Problems I: Single-Swap Local Search for k-Median Has Locality Gap 5Research Paper

The k-median problem asks where to open kkk facilities so that the total distance from a set of clients to their nearest open facility is as small as possible. It is a basic model of facility location in operations research (placing depots, warehouses or servers) and of clustering with representative centres, and it is NP-hard, so the question of interest is…

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

Jointly Constrained Biconvex Programming I: A Biconcave Function Attains Its Minimum on the BoundaryResearch Paper

The bilinear program

7 thms3 active usersReviewed
🏆Completed
Machine LearningProbability·Captain: naimengye

Understanding Machine Learning XVIII: Dimensionality ReductionTextbook

Dimensionality reduction maps data in Rd\mathbb{R}^dRd to Rn\mathbb{R}^nRn, n≪dn \ll dn≪d, by a linear map x↦Wxx \mapsto Wxx↦Wx, for computational reasons, for generalization (Chapter 19's curse of dimensionality) and for interpretability. Chapter 23 of Shalev-Shwartz and Ben-David, Understanding Machine Learning: From Theory to Algorithms (doi:10.1017/CBO9781107298019), studies…

7 thms3 active usersReviewed
🏆Completed
CombinatoricsMachine Learning·Captain: naimengye

Understanding Machine Learning XVII: ClusteringTextbook

Clustering is the most widely used tool of exploratory data analysis and, at the same time, the least well defined: similar points should share a cluster and dissimilar points should not, but similarity is not transitive while cluster membership is, and without labels there is no ground truth against which to evaluate a proposed grouping. Chapter 22 of…

7 thms3 active usersReviewed
🏆Completed
Bandit AlgorithmsOperations ResearchProbability+1·Captain: naimengye

Multi-armed Bandit Allocation Indices VI: Bandit Sampling Processes, Favourable Priors and Invariance of the IndexTextbook

The bandit processes that motivated the index theorem are sampling processes: an arm is a population from which one draws i.i.d. observations whose distribution has an unknown parameter, and each draw both earns something and teaches something. Chapter 7 of Gittins, Glazebrook and Weber, Multi-armed Bandit Allocation Indices (2nd ed., doi:10.1002/97804709800…

9 thms3 active usersReviewed
🏆Completed
Bandit AlgorithmsDynamic ProgrammingOperations Research+1·Captain: naimengye

Multi-armed Bandit Allocation Indices V: Restless Bandits, Indexability and Whittle Indices for Monotone ModelsTextbook

Every proof of the index theorem in Gittins, Glazebrook and Weber, Multi-armed Bandit Allocation Indices (2nd ed., doi:10.1002/9780470980033), uses the fact that a bandit not being processed is frozen. Chapter 6 drops that: Whittle's restless bandits evolve under the passive action too, by a different law, and mmm of nnn must be active at every time. The…

7 thms3 active usersReviewed
🏆Completed
Bandit AlgorithmsLinear OptimizationOperations Research+1·Captain: naimengye

Multi-armed Bandit Allocation Indices IV: The Achievable Region, Generalized Conservation Laws and the Adaptive Greedy AlgorithmTextbook

Chapter 5 of Gittins, Glazebrook and Weber, Multi-armed Bandit Allocation Indices (2nd ed., doi:10.1002/9780470980033), presents the achievable region methodology of Tsoucas, Bertsimas and Niño-Mora, Glazebrook and Garbe, and Dacre, Glazebrook and Niño-Mora: instead of arguing about policies, one argues about the set of performance vectors they can produce.…

8 thms3 active usersReviewed
🏆Completed
Operations ResearchProbability·Captain: naimengye

Inventory Control VIII: The Clark-Scarf Decomposition for a Serial SystemTextbook

Chapter 10 of Axsäter's Inventory Control turns to reorder points and safety stocks in multi-echelon systems, where the installations cannot be treated separately: a large stock downstream lets an upstream site run lean, and a long upstream lead-time argues for stock at the top. The best-known exact technique for serial systems is the decomposition of Clark…

10 thms3 active usersReviewed
🏆Completed
Control TheoryOperations ResearchStochastic Systems·Captain: mikedeng1

Resource Allocation and Cross-Layer Control in Wireless Networks III: Lyapunov Optimization for Utility and FairnessTextbook

Chapters 3-4 of Georgiadis, Neely & Tassiulas's survey Resource Allocation and Cross-Layer Control in Wireless Networks (Foundations and Trends in Networking, 2006) answer "can the network stay stable?" — the backpressure algorithm's throughput optimality (Theorem 4.5) says yes, for any arrival rate inside the capacity region. But networks are usually…

5 thms3 active users
🏆Completed
Control TheoryOperations ResearchStochastic Systems·Captain: mikedeng1

Resource Allocation and Cross-Layer Control in Wireless Networks II: The Dynamic Backpressure AlgorithmTextbook

Every stability result in Georgiadis, Neely & Tassiulas's survey Resource Allocation and Cross-Layer Control in Wireless Networks (Foundations and Trends in Networking, 2006) — the throughput optimality of the dynamic backpressure algorithm (Theorem 4.5), the utility-optimal Lyapunov drift bound of Chapter 5, the energy-constrained control algorithm of…

7 thms3 active users
🏆Completed
Convex OptimizationMachine LearningOperations Research·Captain: mikedeng1

First-Order and Stochastic Optimization Methods for Machine Learning I: The Separation Theorem, Strong Duality and the KKT ConditionsTextbook

Every convex optimization algorithm in machine learning — from projected gradient descent to support vector machines to the mirror-descent methods of later chapters of this book — is justified by a small set of optimality certificates: a checkable condition on a candidate solution that guarantees it actually solves the problem, without searching the whole…

11 thms3 active users
Convex OptimizationMachine Learning·Captain: mikedeng1

Introduction to Online Convex Optimization VI: Bandit Convex Optimization via Gradient EstimationTextbook

Every algorithm in Chapters I–V observes the full cost function ftf_tft​ after playing xtx_txt​. Many applications only reveal the scalar cost ft(xt)f_t(x_t)ft​(xt​) incurred — routing a network and observing total latency, or placing an ad and observing the click-through revenue, without ever seeing the cost of a path or bid not taken. This is the bandit feedback model, and…

10 thms3 active users
🏆Completed
Convex OptimizationMachine Learning·Captain: mikedeng1

Introduction to Online Convex Optimization V: RFTL and the Regret Bound of Follow-the-Regularized-LeaderTextbook

Online convex optimization (OCO) asks a learner to repeatedly pick a point in a convex set KKK, pay a cost that an adversary reveals only after the choice is made, and be judged against the best fixed point in hindsight. Chapter III of this series formalized the simplest general-purpose answer, online gradient descent (OGD): take a gradient step, project back…

6 thms3 active users
🏆Completed
Convex OptimizationOperations ResearchProbability·Captain: mikedeng1

Introduction to Stochastic Programming VIII: Multistage Jensen Bounds and AggregationTextbook

A multistage stochastic program's exact deterministic equivalent grows exponentially with the number of periods, even when each period's random data takes only a handful of values (Chapter 9's concern was the growth in the number of realizations; Chapter 10 adds growth in the number of periods). One remedy, generalizing Chapter 8's single-period Jensen…

4 thms3 active users
🏆Completed
Convex OptimizationLinear OptimizationOperations Research+1·Captain: mikedeng1

Introduction to Stochastic Programming III: The L-Shaped Method and Its Finite ConvergenceTextbook

Two-stage stochastic programs with recourse — choose a first-stage decision xxx now, observe a random outcome ξ\xiξ, then choose a second-stage recourse decision y(ξ)y(\xi)y(ξ) to repair whatever xxx left infeasible or suboptimal — are the workhorse model of the field, used for capacity planning, inventory and financial portfolio problems since the 1950s (Dantzig 1955;…

6 thms3 active users
🏆Completed
Algorithmic Game TheoryOperations Research·Captain: naimengye

Stochastic Networks IV: Decentralized Optimization and Wardrop EquilibriaTextbook

A network of resistors solves an optimization problem. Nobody tells the electrons what to do; each one moves under a purely local rule, and the current distribution that emerges minimizes energy dissipation over all distributions satisfying Kirchhoff's node law. Add a wire and the network can only become easier to traverse. This is the encouraging case, and…

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

Supermodularity and Complementarity II: Topkis's Monotonicity Theorem for Parameterized OptimizationTextbook

A recurring question in economics and operations research is: when a decision problem depends on a parameter, does the optimal decision move monotonically as the parameter changes? A firm's optimal input mix as a price rises, a consumer's optimal consumption bundle as income grows, a Cournot firm's optimal output as a rival's output changes — in each case…

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

Introduction to Stochastic Programming II: The Value of Perfect Information and of the Stochastic SolutionTextbook

Every stochastic program is, in practice, compared against a shortcut. A decision maker facing genuine uncertainty is tempted either to replace the random data by its mean and solve one deterministic problem, or to imagine that perfect information about the future were available and solve a separate deterministic problem per scenario. Both temptations have…

8 thms3 active usersReviewed
PreviousPage 55 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