首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Solving the continuous nonlinear resource allocation problem with an interior point method
Institution:1. Department of Statistics, Miami University, Oxford, OH 45056, United States;2. Department of Mathematics, North Carolina State University, Raleigh, NC 27695, United States
Abstract:Resource allocation problems are usually solved with specialized methods exploiting their general sparsity and problem-specific algebraic structure. We show that the sparsity structure alone yields a closed-form Newton search direction for the generic primal-dual interior point method. Computational tests show that the interior point method consistently outperforms the best specialized methods when no additional algebraic structure is available.
Keywords:Convex programming  Interior point methods  Continuous knapsack
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号