Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Equation (2.2): the Lagrangian maximum and dual value

Proved
KellyLossNetworks.Primal.lagrangian_max

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

convex-dualityloss-networksoperations-researchp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

For offered traffic νr>0\nu_r>0νr​>0 and any nonnegative multiplier vector yyy, let L(x,z;y)L(x,z;y)L(x,z;y) be the Lagrangian of the primal problem with nonnegative route flow xxx and slack zzz. Its maximum is attained at xr=νre−∑jyjAjrx_r=\nu_r e^{-\sum_jy_jA_{jr}}xr​=νr​e−∑j​yj​Ajr​ and z=0z=0z=0, with value

max⁡x,z≥0L(x,z;y)=∑rνre−∑jyjAjr+∑jyjCj.\max_{x,z\ge0}L(x,z;y)=\sum_r\nu_r e^{-\sum_jy_jA_{jr}}+\sum_jy_jC_j.x,z≥0max​L(x,z;y)=r∑​νr​e−∑j​yj​Ajr​+j∑​yj​Cj​.

This identifies the published dual objective as the Lagrangian maximum.

Preamble
import Mathlib
import Definitions.Def_KellyLossNetworks_Primal_Problem
Formal statement
namespace KellyLossNetworks.Primal

/-- Kelly, *Loss networks* (1991), §2.1, pp. 327–328, Lagrangian and (2.2)–(2.3).
Formalization Note: `z = 0` is a maximizing slack vector when `y ≥ 0`. -/
theorem lagrangian_max {J R : ℕ} (A : Fin J → Fin R → ℕ)
    (ν : Fin R → ℝ) (C : Fin J → ℕ) (hν : ∀ r, 0 < ν r)
    (y : Fin J → ℝ) (hy : ∀ j, 0 ≤ y j) :
    (∀ (x : Fin R → ℝ) (z : Fin J → ℝ),
      (∀ r, 0 ≤ x r) → (∀ j, 0 ≤ z j) →
      lagrangian A ν C x z y ≤ KellyStochasticNetworks.dualObjective A ν C y) ∧
    lagrangian A ν C (primalPoint A ν y) (fun _ => 0) y =
      KellyStochasticNetworks.dualObjective A ν C y := by sorry

end KellyLossNetworks.Primal
Source
Kelly, Loss networks, Ann. Appl. Probab. 1(3):319–378 (1991), DOI 10.1214/aoap/1177005872, pp. 327–328, §2.1, (2.2) and the display following it
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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