Inner approximation algorithm for generalized linear multiplicative programming problems

An efficient inner approximation algorithm is presented for solving the generalized linear multiplicative programming problem with generalized linear multiplicative constraints. The problem is firstly converted into an equivalent generalized geometric programming problem, then some magnifying-shrink...

Descripción completa

Detalles Bibliográficos
Autores principales: Zhao, Yingfeng, Yang, Juanjuan
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer International Publishing 2018
Materias:
Research
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6302060/
https://www.ncbi.nlm.nih.gov/pubmed/30839907
http://dx.doi.org/10.1186/s13660-018-1947-9

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6302060/
https://www.ncbi.nlm.nih.gov/pubmed/30839907
http://dx.doi.org/10.1186/s13660-018-1947-9

Ejemplares similares