Exact Solution Procedure for the Log-Linear Continuous Knapsack Problem
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929465211224064 |
|---|---|
| author | Lahiri, Somdeb |
| author_facet | Lahiri, Somdeb |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_05256 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Exact Solution Procedure for the Log-Linear Continuous Knapsack Problem Lahiri, Somdeb Optimization and Control 90C30, 90C05, 90C46 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. |
| title | Exact Solution Procedure for the Log-Linear Continuous Knapsack Problem |
| topic | Optimization and Control 90C30, 90C05, 90C46 |
| url | https://arxiv.org/abs/2408.05256 |