Technical Note—Bounding Nonconvex Programs by Conjugates

DOI10.1287/OPRE.21.1.346MaRDI QIDQ5682161zbMATH OpenOpenAlexFDO

Authors Harvey J. Greenberg

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

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cited in

(2)

• 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

This page was built for publication: Technical Note—Bounding Nonconvex Programs by Conjugates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5682161)