Technical Note—Bounding Nonconvex Programs by Conjugates

Harvey J. Greenberg
Additional contact information
Harvey J. Greenberg: Southern Methodist University, Dallas, Texas

Operations Research, 1973, vol. 21, issue 1, 346-348

Abstract: We point out that the Lagrangian dual conjugation in response space provides a stronger bound and requires less computation than conjugate convexification in decision space. A homotopy is then described to lend economic interpretation in the presence of gaps.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.1.346 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:21:y:1973:i:1:p:346-348

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().