arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.05256math.OC
收藏

对数线性连续背包问题的精确求解过程

Exact Solution Procedure for the Log-Linear Continuous Knapsack Problem

Somdeb Lahiri

AI总结:

本研究针对对数线性连续(分式)背包问题,基于弱对偶定理与互补松弛定理推导的两个引理,提出了一种精确求解算法。

摘要:

我们提出一种精确算法,用于求解对数线性连续(分式)背包问题。该算法基于两个引理,这两个引理由弱对偶定理和互补松弛定理应用于线性目标函数的线性优化问题推导而来,该线性优化问题与任意具有(可微)凹目标函数的线性优化问题的解相关联。

英文摘要:

We provide an exact algorithm to solve the log-linear continuous (fractional) knapsack problem. The algorithm is based on two lemmas that follow from the application of weak duality theorem and complementary slackness theorem to the linear optimization problem with linear objective function that is associated with any solution of a linear optimization problem with (differentiable) concave objective function.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑