We introduce a new class of nonlinear knapsack problems. We show that the constrained and unconstrained versions of the problem are NPNP-hard. We provide lower and upper bounds adopting piecewise linear approximation. We use a linearization technique to solve the problem exactly. We propose a branch-infer-and-bound hybrid approach to solve the problem exactly.