Lagrangian duality for a quadratic threshold Created 2026-10-18 Updated 2026-10-31
Choose the one-variable quadratic programWithout the optimization constraint, the global minimum is at . On the feasible set , write with : then . Hence is the unique primal optimizer and .
For any , completing the square in the optimization Lagrangian givesThe inner minimization problem is over all real numbers, so its unique optimizer is . ThereforeThe best lower bound is , attained at . At , the inner optimizer is , which is infeasible for the primal problem; nevertheless is a valid lower bound. At , the inner optimizer is , which is feasible, but is weaker than . Feasibility of an inner optimizer alone does not make the bound exact.
At , the Karush-Kuhn-Tucker conditions reduce toThe last equality is complementary slackness. The strongest certificate is visible without solving another optimization problem: , so every feasible point satisfiesThe same Lagrange multiplier simultaneously makes the inner optimizer feasible and removes the slack between and . This is a convex KKT optimality certificate; also verifies Slater's condition.
The domain in the inner infimum is essential. If one mistakenly keeps when computing , the restricted minimum becomes , whereas the actual Lagrange dual function has value . Constraints deliberately retained in are allowed in a Lagrangian relaxation, but that is a different choice of which restrictions to dualize.
The nonzero gradient condition in the equality Lagrange multiplier rule cannot simply be dropped. Minimize subject to . The only feasible point is , so it is a global minimum and a global maximum of on that feasible set. Nevertheless,and no real number satisfies . The point is singular for this representation of the optimization constraint; the usual constraint qualification fails. The linearized equation permits every direction, even though the actual feasible set permits no motion at all. This example explains why blindly solving the multiplier equations can miss an optimum.
Lagrange multiplier as a marginal cost 2026-10-18
The chosen quadratic objective function above gives more than an optimal allocation: its Lagrange multiplier predicts how much the best cost changes when the required total changes. For this example,This is an explicit derivative of a constrained value function and an instance of the envelope theorem. At , one extra small unit of required output costs approximately units per unit of output, in the chosen normalized model. Increasing makes this equality-constrained minimization problem more expensive; it is not a gain from relaxing an upper resource limit. The sign and meaning depend on how the optimization constraint and optimization Lagrangian are written.[ref]
For an actual finite change , the cost difference is exactlyAt , the linear approximation predicts , while the exact increase is . The extra comes from the squared term in this polynomial, rather than numerical error. A Lagrange multiplier gives a local sensitivity analysis; treating it as a constant price over a large change generally loses the change in the optimum itself.
For a smooth optimizer of an equality problem , the short chain rule calculation explains the result: and imply . The differentiability and stationarity assumptions matter: an optimizer can fail to be unique or vary smoothly. The envelope theorem records when this interpretation is justified.
Lagrange multiplier for quadratic cost 2026-10-18
Suppose two adjustable inputs must deliver a prescribed total , and their combined cost is the quadratic form . These are chosen, dimensionless quantities; the coefficient makes concentrating an input in more expensive. Initially allow all real numbers , with the equality optimization constraint . The optimization Lagrangian with our chosen sign isThe stationary point equations give , , and . ConsequentlyFor , the unique global minimum is at , with cost and Lagrange multiplier . Equal allocation would cost ; assigning everything to would cost . At the optimum, the two marginal costs agree: . Moving a little input from one component to the other therefore has zero first-order effect on cost. When , this solution also meets the extra nonnegativity optimization constraints , so it remains optimal with those added.
Here the Lagrange multiplier equations locate a candidate, and a short independent check certifies it. On the entire feasible set, substitute and use completing the square:The squared term is nonnegative and vanishes only at . Thus the candidate is the unique global minimum; there is no global maximum on this unbounded feasible set, a line. This separates finding a stationary point from proving optimality. The geometric beauty is that equal marginal costs, parallel gradients, tangency of level sets, and completing the square identify the same allocation.
At a regular constrained stationary point of on , the Lagrange multiplier equations make the two gradients linearly dependent. Eliminating gives the displayed zero determinant. This condition is necessary, not sufficient for an extremum. At a singular constraint point where , the determinant is automatically zero even when no multiplier exists; for example and at the origin.
Ladder around a right-angled corner 2026-10-18
A rigid stick of negligible width can turn horizontally between perpendicular corridors of widths precisely when its length does not exceed the displayed value, allowing contact with the walls. A position touching the two outer walls and the inner corner has endpoint intercepts and with . Collinearity with the inner corner is equivalent to .
Minimize the squared intercept length under this optimization constraint. The Lagrange multiplier equations imply . Substituting gives , so the admissible point is , . There . Along the positive constraint branch tends to infinity at both ends and has this one stationary point, proving it is the minimum available clearance over orientations. That minimum is the maximum stick length which can pass through every intermediate orientation.
For , a rectangular cross section of width and height , capped by a symmetric triangular roof at angle , has area . Its total sloping roof length is . A cost with has the same minimizing shape as this roof length, since the fixed wall term is constant.
The Lagrange multiplier equations for under the area constraint give . This is the first displayed condition; it also implies . Eliminating gives the second condition.
For a global check, the squared roof length is for . Its derivative has the sign of , a strictly increasing expression with one root in that interval. Thus this root is the unique minimum. The shape is independent of the positive roof-cost coefficient and the constant wall cost. If , every feasible shape has the same cost and these conditions are no longer necessary.
Maximum-volume open rectangular box at fixed surface area Created 2026-10-18 Updated 2026-10-20
For a lidless rectangular parallelepiped with positive dimensions and prescribed external surface area , the largest volume is attained at . The arithmetic-geometric mean inequality applied to giveswith equality exactly when these three face-area terms are equal. This proves both the claimed global bound and its attainable equality case. Lagrange multipliers produce the same dimensions from the interior stationarity equations. The weighted open-box minimization is the corresponding fixed-volume formulation with general positive face weights.
Work by Ladislav Sieger 2026-10-18
Work by Krzysztof Pachucki 2026-10-18
Work by Kristin Ackerman 2026-10-18
Work by Konstantin Novoselov 2026-10-18
Work by Klaus von Klitzing 2026-10-18
Work by Klaus Hasselmann 2026-10-18
Work by Kip S. Thorne Created 2026-10-18 Updated 2026-10-24
Speed distribution 2026-10-18
A speed distribution is the probability distribution of the magnitude of velocity. When it has a probability density function , the fraction of particles with speeds between and is , and . The Maxwell speed distribution describes an equilibrium ideal gas; the effusive beam speed distribution weights that population by its rate of arrival.
Thermal motion 2026-10-18
Thermal motion is microscopic random motion associated with a system's temperature; Brownian motion makes its effects on larger suspended grains visible.
Kinetic estimates of gas transport coefficients Created 2026-10-18 Updated 2026-10-20
In a dilute gas whose mean free path is short compared with macroscopic gradient lengths, particles carry properties from their previous collisions over distances of order . A first-gradient isotropic estimate gives a transported flux for a property carried per particle. Applying this reasoning to species abundance, directed momentum and thermal energy with per-particle heat capacity gives diffusivity , dynamic viscosity and thermal conductivity . These numerical prefactors are estimates, not exact collision-integral results.
For a constant hard-sphere diameter , and . Consequently , and . At fixed pressure the last scales as . The near pressure-independence of viscosity and thermal conductivity applies only while gas-gas collisions, rather than apparatus walls, determine the mean free path. Temperature-dependent cross-sections and internal molecular excitations change the simple power laws.
Work by Kevin E. Strecker Created 2026-10-18 Updated 2026-10-31
There are unlisted articles, also show them or only show them.


