A carregar...

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...

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Publicado no:J Inequal Appl
Main Authors: Shen, Peiping, Wang, Chunfeng
Formato: Artigo
Idioma:Inglês
Publicado em: Springer International Publishing 2017
Assuntos:
Acesso em linha: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: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!