A continuous strategy to solve a class of mixed optimization problems

DOI10.1016/j.dam.2011.12.008zbMath1331.90054OpenAlexW2175279618MaRDI QIDQ496673

Edson Figueiredo Lima, Rúbia Mara de Oliveira Santos, Roberto Quirino do Nascimento

Publication date: 22 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.008

zbMATH Keywords

global optimizationdiscrete optimizationgeneralized geometric programmingfacility location problems

Mathematics Subject Classification ID

Integer programming (90C10) Nonconvex programming, global optimization (90C26)

Cites Work

• Unnamed Item
• Unnamed Item
• A new rectangle branch-and-pruning approach for generalized geometric programming
• A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation
• Investigation of path-following algorithms for signomial geometric programming problems
• Global optimization of signomial geometric programming using linear relaxation.
• A deterministic global optimization algorithm for generalized geometric programming
• On the mixed integer signomial programming problems

This page was built for publication: A continuous strategy to solve a class of mixed optimization problems