Loading...

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

Tavakoli, R ; Sharif University of Technology | 2016

488 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/s11590-015-0866-7
  3. Publisher: Springer Verlag , 2016
  4. Abstract:
  5. 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
  6. Keywords:
  7. Knapsack problem ; Time-linear algorithm ; Algorithms ; Combinatorial optimization ; Convex optimization ; Computational costs ; Computational performance ; Computational science and engineerings ; Knapsack problems ; Linear algorithms ; Linearly constrained optimization ; Numerical experiments ; Quadratic knapsack problems ; Constrained optimization
  8. Source: Optimization Letters ; Volume 10, Issue 1 , 2016 , Pages 137-158 ; 18624472 (ISSN)
  9. URL: http://link.springer.com/article/10.1007/s11590-015-0866-7