Characterization of the optimal solution of the convex separable continuous knapsack problem and related problems

• Published in: Journal of information & optimization sciences Vol. 42; no. 1; pp. 1 - 16
• Main Author: Stefanov, Stefan M.
• Format: Journal Article
• Language: English
• Published: Taylor & Francis 02.01.2021
• Subjects: Convex programming; Knapsack problem; Optimality conditions; Separable programming

A separable convex continuous knapsack problem with a single equality constraint and bounded variables is considered in this paper. Necessary and sufficient condition (characterization) for a feasible solution to be an optimal solution to this problem is stated, and characterization theorem in terms...