Elements of a theory in non‐convex programming

Claude‐Alain Burdet

Naval Research Logistics Quarterly, 1977, vol. 24, issue 1, 47-66

Abstract: The question of necessary and sufficient optimality conditions for non‐convex programs is analyzed in the general context of subadditivity. Several types of convex set extensions are investigated to generate valid inequalities from the corresponding gauge functions.

Date: 1977
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800240105

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:wly:navlog:v:24:y:1977:i:1:p:47-66

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().