AbstractIn 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 pr