Continuous linear knapsack problems revisited

被引：0
|
作者：
Stefanov, Stefan M. [1 ]
机构：
[1] South West Univ Neofit Rilski, Dept Math, Blagoevgrad 2700, Bulgaria
来源：
JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES | 2023年 / 44卷 / 05期
关键词：
Knapsack problem; Linear programming; Convex programming; RESOURCE-ALLOCATION; CONVEX; ALGORITHM; SUBJECT; MINIMIZATION; CONSTRAINT;
D O I：
10.47974/JIOS-1184
中图分类号：
G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];
学科分类号：
1205 ; 120501 ;
摘要：
In this paper, the continuous linear knapsack problem is considered. Some preliminary results are formulated and proved, and theorems concerning the optimal solution of the considered problem are stated and proved.
引用
收藏
页码：909 / 922
页数：14
相关论文
共 50 条
12345