Global optimization for generalized geometric programming problems with discrete variables
From MaRDI portal
Publication:2868905
DOI10.1080/02331934.2011.604871zbMath1278.90321OpenAlexW2063276780MaRDI QIDQ2868905
Publication date: 19 December 2013
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2011.604871
global optimizationgeneralized geometric programmingdiscrete variablelinearization techniquereduction cut
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Linear programming (90C05)
Related Items (4)
Fuzzy geometric programming approach in multivariate stratified sample surveys under two stage randomized response model ⋮ A novel optimization method for nonconvex quadratically constrained quadratic programs ⋮ Multi-objective geometric programming approach in multivariate stratified sample survey with quadratic cost function ⋮ An effective global optimization algorithm for quadratic programs with quadratic constraints
Cites Work
- A robust algorithm for generalized geometric programming
- Generalized geometric programming applied to problems of optimal control. I: Theory
- Global optimization of signomial geometric programming using linear relaxation.
- Global optimization of generalized geometric programming
- A global optimization using linear relaxation for generalized geometric programming
- A branch and bound algorithm for globally solving a class of nonconvex programming problems
- Geometric programming with signomials
- A deterministic global optimization algorithm for generalized geometric programming
- Geometric Programming: Methods, Computations and Applications
- Duality Theory for Geometric Programming
This page was built for publication: Global optimization for generalized geometric programming problems with discrete variables