Reversed geometric programming: A branch-and-bound method involving linear subproblems
type: Item
instance of: scholarly article
title: Reversed geometric programming: A branch-and-bound method involving linear subproblems
zbMATH Open document ID: 0436.90098
DOI: 10.1016/0377-2217(80)90070-3
author: F. Cole
author: Willy Gochet
author: F. Van Assche
author: J. G. Ecker
author: Yves Smeers
published in: European Journal of Operational Research
publication date: 1980-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3681515
zbMATH Keywords: reversed geometric programming
zbMATH Keywords: global optimization
zbMATH Keywords: branch-and-bound method
zbMATH Keywords: global solution
zbMATH Keywords: general polynomial programs
zbMATH Keywords: reversed posynomial program
zbMATH Keywords: cutting plane algorithm
zbMATH Keywords: linear subproblems
zbMATH Keywords: computational evidence
MaRDI profile type: Publication
full work available at URL: 0377-2217(80)90070-3
OpenAlex ID: W1974138128
cites work: Solution of generalized geometric programs
cites work: Q5589755
cites work: A set of geometric programming test problems and their solutions
cites work: Geometric programming with signomials
cites work: An Easy Primal Method for Geometric Programming
cites work: An Algorithm for Separable Nonconvex Programming Problems
cites work: Q4777059
cites work: A modified reduced gradient method for a class of nondifferentiable problems
cites work: Q5652460
cites work: Q4051922
cites work: Global solutions of mathematical programs with intrinsically concave functions
cites work: Constrained derivatives and equilibrium conditions in generalized geometric programming
description: scientific article; zbMATH DE number 3681515