(0, 1) hyperbolic programming problems

Pierre Robillard

Naval Research Logistics Quarterly, 1971, vol. 18, issue 1, 47-57

Abstract: In the first part of this paper we study the unconstrained {0, 1} hyperbolic programming problem treated in [1]. We describe a new algorithm for this problem which produces an optimal solution by scanning just once the set of fractions to be analysed. This algorithm shows better computing performance than the one described in [1]. In the second part we study the {0, 1} hyperbolic programming problem with constraints given by inequalities on nondeereasing pseudo‐boolean functions. We describe a “branch and bound” type algorithm for this problem.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (2)

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

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:18:y:1971:i:1:p:47-57

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