We consider a generalization of the classical knapsack problem. While in the standard setting a fixed capacity may not be exceeded by the weight of the chosen items, we replace this hard constraint by a weight-dependent cost function. The objective is to maximize the total profit of the chosen items minus the cost induced by their total weight. In my talk I will focus on convex cost functions and present an FPTAS and a fast 2-approximation algorithm for this setting.