We study the complexity of the 2-dimensional knapsack problem
, where
. The problem is defined in terms of real numbers and we study it where an integral solution is sought under a real number
model of computation. We obtain a tight complexity bound
, where
.
Received: November 1998 / Accepted: December 1998