Back to Search
Start Over
Linear decomposition approach for a class of nonconvex programming problems.
- Source :
-
Journal of Inequalities & Applications . 4/13/2017, Vol. 2017 Issue 1, p1-11. 11p. - Publication Year :
- 2017
-
Abstract
- This paper presents a linear decomposition approach for a class of nonconvex programming problems by dividing the input space into polynomially many grids. It shows that under certain assumptions the original problem can be transformed and decomposed into a polynomial number of equivalent linear programming subproblems. Based on solving a series of liner programming subproblems corresponding to those grid points we can obtain the near-optimal solution of the original problem. Compared to existing results in the literature, the proposed algorithm does not require the assumptions of quasi-concavity and differentiability of the objective function, and it differs significantly giving an interesting approach to solving the problem with a reduced running time. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 10255834
- Volume :
- 2017
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- Journal of Inequalities & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 122459114
- Full Text :
- https://doi.org/10.1186/s13660-017-1342-y