Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

The relaxed problem (9.17) subject to (9.18) has an optimal solution

Proved
InventoryControl.serial_relaxed_min_exists

by naimengye · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

convex-optimizationinventory-controllot-sizingmulti-echelonoperations-research

For a serial system with NNN stages, final demand d>0d > 0d>0, ordering costs Ai>0A_i > 0Ai​>0 and echelon holding costs ei>0e_i > 0ei​>0, there are positive nested batch quantities Q1rel≤⋯≤QNrelQ^{\mathrm{rel}}_1 \le \dots \le Q^{\mathrm{rel}}_NQ1rel​≤⋯≤QNrel​ that minimize the cost (9.17) over all positive batch quantities satisfying the relaxed constraints (9.18).

The book speaks of "the unique solution of the relaxed problem" and computes it by aggregation; that a minimum exists is presupposed. It does because each term eiQi/2+Aid/Qie_iQ_i/2 + A_id/Q_iei​Qi​/2+Ai​d/Qi​ tends to infinity as Qi→0Q_i \to 0Qi​→0 or Qi→∞Q_i \to \inftyQi​→∞, so the search can be confined to a compact box, on which the continuous objective attains its minimum, and the constraint set is closed. Positivity of every AiA_iAi​ and eie_iei​ is needed: with ei=0e_i = 0ei​=0 the cost decreases without bound as Qi→∞Q_i \to \inftyQi​→∞, and with Ai=0A_i = 0Ai​=0 as Qi→0Q_i \to 0Qi​→0.

Formalization Note Uniqueness is not asserted here.

Preamble
import Definitions.Def_InventoryControl_serial
Formal statement
namespace InventoryControl

theorem serial_relaxed_min_exists {N : ℕ} (A e : Fin N → ℝ) (d : ℝ) (hd : 0 < d)
    (hA : ∀ i, 0 < A i) (he : ∀ i, 0 < e i) :
    ∃ Qrel : Fin N → ℝ, (∀ i, 0 < Qrel i) ∧ SerialNested Qrel ∧
      ∀ Q : Fin N → ℝ, (∀ i, 0 < Q i) → SerialNested Q →
        serialCost A e d Qrel ≤ serialCost A e d Q := by sorry

end InventoryControl
Source
Sven Axsäter, Inventory Control, 3rd ed., Springer 2015, DOI 10.1007/978-3-319-15729-0, p. 179, Sect. 9.2.2: 'The objective function (9.17) is convex and the constraints (9.18) are linear. The unique solution of the relaxed problem can therefore be obtained through the Lagrangean relaxation'; existence is presupposed
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 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