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


Incremental allocation of a discrete and convex resource to concave activities
Authors:K. M. Mjelde
Affiliation:(1) Det norske Veritas, P.O. Box 300, N-1322 Høvik, Oslo, Norway
Abstract:The problem considered is that of the allocation of a given quantity of a discrete resource to activities described by concave return functions. The resource-consumption corresponding to each allocation is described by a convex function of the quantity allocated. An incremental solution algorithm is given, which specializes to the algorithm of Fox if the resource is linear, and to an algorithm of Katoh, Ibaraki and Mine if the return functions are linear.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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