Cargando…
An efficient method for generalized linear multiplicative programming problem with multiplicative constraints
We present a practical branch and bound algorithm for globally solving generalized linear multiplicative programming problem with multiplicative constraints. To solve the problem, a relaxation programming problem which is equivalent to a linear programming is proposed by utilizing a new two-phase re...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer International Publishing
2016
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4978663/ https://www.ncbi.nlm.nih.gov/pubmed/27547676 http://dx.doi.org/10.1186/s40064-016-2984-9 |