On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs N-simplex

Coupled continuous quadratic knapsack problems (CCK) are introduced in the present study. The solution of a CCK problem is equivalent to the projection of an arbitrary point onto the volume constrained Gibbs N-simplex, which has a wide range of applications in computational science and engineering. Three algorithms have been developed in the present study to solve large scale CCK problems. According to the numerical experiments of this study, the computational costs of presented algorithms scale linearly with the problem size, when it is sufficiently large. Moreover, they show competitive or even superior computational performance compared to the advanced QP solvers. The ease of implementation and linear scaling of memory usage with the problem size are the other benefits of the presented algorithms. Keywords knapsack problem · convex optimization · linearly constrained optimization · time-linear algorithm Mathematics Subject Classification (2000) 65K05 · 90C20 · 90C25 · 91B32

• Type: Journal
• Year: 2016
• Where: OL
• Authors: Rouhollah Tavakoli
• Keywords: OL 2016