Convex and polaroid extensions

Claude‐Alain Burdet

Naval Research Logistics Quarterly, 1977, vol. 24, issue 1, 67-82

Abstract: In an effort towards a comprehensive and unified theory, this note presents some new results in the area of non‐convex programming within the framework of convex (sets and function) analysis. The entire study is primarily devoted to the development of useful tools for extreme point programs (such as concave or integer programs).

Date: 1977
References: Add references at CitEc
Citations:

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

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:67-82

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 ().