New Lagrangian dual algorithms for solving the continuous nonlinear resource allocation problem
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908179321847808 |
|---|---|
| author | Hu, Kaixiang Kou, Caixia Yuan, Jianhua |
| author_facet | Hu, Kaixiang Kou, Caixia Yuan, Jianhua |
| contents | The continuous nonlinear resource allocation problem (CONRAP) has broad applications in economics, engineering, production and inventory management, and often serves as a subproblem in complex programming. Without relying on monotonicity assumptions for the objective and constraint functions, we propose two Lagrangian dual algorithms for solving two types of CONRAP. Both algorithms determine an update strategy for the Lagrange multiplier, utilizing the values of the objective and constraint functions at the current and previous iterations. This strategy accelerates the process of finding dual optimal solutions. Subsequently, leveraging the problem's convexity, the primal optimal solution is either directly identified or derived by solving a one-dimensional linear equation. We also prove that both algorithms converge to optimal solutions within a finite number of iterations. Numerical experiments on six types of practical test problems illustrate the superior computational efficiency of the proposed algorithms. For test problems with a general inequality constraint, the first algorithm achieves a CPU time reduction exceeding an order of magnitude compared to solvers such as Gurobi and CVX. For test problems with a linear equality constraint, the second algorithm consistently outperforms four existing algorithms, delivering an improvement of over two orders of magnitude in computational efficiency. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_01899 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | New Lagrangian dual algorithms for solving the continuous nonlinear resource allocation problem Hu, Kaixiang Kou, Caixia Yuan, Jianhua Optimization and Control The continuous nonlinear resource allocation problem (CONRAP) has broad applications in economics, engineering, production and inventory management, and often serves as a subproblem in complex programming. Without relying on monotonicity assumptions for the objective and constraint functions, we propose two Lagrangian dual algorithms for solving two types of CONRAP. Both algorithms determine an update strategy for the Lagrange multiplier, utilizing the values of the objective and constraint functions at the current and previous iterations. This strategy accelerates the process of finding dual optimal solutions. Subsequently, leveraging the problem's convexity, the primal optimal solution is either directly identified or derived by solving a one-dimensional linear equation. We also prove that both algorithms converge to optimal solutions within a finite number of iterations. Numerical experiments on six types of practical test problems illustrate the superior computational efficiency of the proposed algorithms. For test problems with a general inequality constraint, the first algorithm achieves a CPU time reduction exceeding an order of magnitude compared to solvers such as Gurobi and CVX. For test problems with a linear equality constraint, the second algorithm consistently outperforms four existing algorithms, delivering an improvement of over two orders of magnitude in computational efficiency. |
| title | New Lagrangian dual algorithms for solving the continuous nonlinear resource allocation problem |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2411.01899 |