Technical Note—Bounding Nonconvex Programs by Conjugates
From MaRDI portal
Publication:5682161
DOI10.1287/opre.21.1.346zbMath0264.90040OpenAlexW2110744288MaRDI QIDQ5682161
Publication date: 1973
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.21.1.346
Related Items
Some relationships between lagrangian and surrogate duality in integer programming, The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization