Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 10 (Everett) — a minimizer of the Lagrangian solves the problem with budget b′ = g(x⁰(θ))

Proved
ServiceParts.StockLevels.everett

by mikedeng1 · Oct 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

everettlagrangian-relaxationoptimizationp2o-batch-b23ap2o-gran-per-chapterp2o-plan-bookp2o-v1

Let SSS be a set, let fff and ggg be real functions on SSS, and let b∈Rb \in \mathbb{R}b∈R. Problem 1 is

min⁡ {f(x):g(x)≤b, x∈S},\min\,\{ f(x) : g(x) \le b,\ x \in S \},min{f(x):g(x)≤b, x∈S},

and for a multiplier θ≥0\theta \ge 0θ≥0 its Lagrangian relaxation, Problem 2, is min⁡x∈S [ f(x)+θ(g(x)−b) ]\min_{x \in S}\,[\,f(x) + \theta(g(x) - b)\,]minx∈S​[f(x)+θ(g(x)−b)].

Theorem (Everett). Suppose x0(θ)∈Sx^0(\theta) \in Sx0(θ)∈S is an optimal solution of Problem 2 for the multiplier θ≥0\theta \ge 0θ≥0, and let b′=g(x0(θ))b' = g(x^0(\theta))b′=g(x0(θ)). Then x0(θ)x^0(\theta)x0(θ) also solves Problem 3,

min⁡ {f(x):g(x)≤b′, x∈S}:\min\,\{ f(x) : g(x) \le b',\ x \in S \}:min{f(x):g(x)≤b′, x∈S}:

it is feasible for Problem 3 and f(x0(θ))≤f(x)f(x^0(\theta)) \le f(x)f(x0(θ))≤f(x) for every x∈Sx \in Sx∈S with g(x)≤b′g(x) \le b'g(x)≤b′.

By varying θ\thetaθ one obtains optimal solutions of the constrained problem for a family of budgets; if b′=bb' = bb′=b for some θ\thetaθ, Problem 1 itself is solved.

Formalization Note The book assumes fff and ggg convex and xxx a vector; the statement here drops both assumptions (a labelled generalization: the proof uses neither, and the book applies the theorem to integer stock vectors, where convexity in the vector-space sense is not defined). The conclusion is stated as: f(x0)f(x^0)f(x0) is the least value of fff on {x∈S:g(x)≤b′}\{x \in S : g(x) \le b'\}{x∈S:g(x)≤b′}.

Preamble
import Mathlib
Formal statement
namespace ServiceParts.StockLevels

theorem everett {X : Type*} (S : Set X) (f g : X → ℝ) (b θ : ℝ) (hθ : 0 ≤ θ)
    (x0 : X) (hx0 : x0 ∈ S)
    (hopt : ∀ x ∈ S, f x0 + θ * (g x0 - b) ≤ f x + θ * (g x - b)) :
    IsLeast (f '' {x | x ∈ S ∧ g x ≤ g x0}) (f x0) := by sorry

end ServiceParts.StockLevels
Source
Muckstadt, Analysis and Algorithms for Service Parts Supply Chains, Springer 2005, DOI 10.1007/b138879, p. 57, Section 3.4.1, Theorem 10, Eqs. (3.37)-(3.39)
Human review
  • Endorsed by Shuze Chen · Oct 5, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 5, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

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