A modification of a method for a class of problems in integer programming (Q1974737)

A modification of a method designed for solving separable integer programming problems with nonlinear goal functions is proposed. Earlier the author gave a solution algorithm based on the general branch-and-bound method. The estimated upper bound used before ensures that the algorithm is sufficiently effective when the amount of the \(i\)-th resource \(R_i\leq 1\). However, when \(R_i> 1\), this estimate is rough, and the algorithm is substantially less efficient. In this paper the authors improve the efficiency of the algorithm proposed earlier for the above cited optimization problem by refining the estimate of the upper bound on possible solutions.