Cargando...
Linear decomposition approach for a class of nonconvex programming problems
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 pro...
Gardado en:
| Publicado en: | J Inequal Appl |
|---|---|
| Main Authors: | , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
Springer International Publishing
2017
|
| Assuntos: | |
| Acceso en liña: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5393259/ https://ncbi.nlm.nih.gov/pubmed/28473733 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/s13660-017-1342-y |
| Tags: |
Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|