Polaroids: A new tool in non‐convex and in integer programming

Claude‐Alain Burdet

Naval Research Logistics Quarterly, 1973, vol. 20, issue 1, 13-24

Abstract: This paper presents a generalization, called polaroid, of the concept of polar sets A list of properties satisfied by polaroids is established indicating that the new concept nay be fruitfully used in an area of non‐convex (called here polar) programming as well as in integer programming, by means of polaroid cuts; this class of new cuts contains the ones defined by Tuy for concave programming (a special case of polar programming) and by Balas integer programming; it furthermore provides for new degrees of freedom in the construction of algorithms in the above‐mentioned areas of mathematical programming.

Date: 1973
References: Add references at CitEc
Citations: View citations in EconPapers (1)

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

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:20:y:1973:i:1:p:13-24

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