A Branch-and-Bound Method for Reversed Geometric Programming

DOI10.1287/opre.27.5.982zbMath0427.90077OpenAlexW1990619819MaRDI QIDQ3863446

Yves Smeers, Willy Gochet

Publication date: 1979

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.27.5.982

zbMATH Keywords

convergencebranch-and-bound methodsequence of convex programscutting plane techniquereversed geometric programs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Mathematical programming (90C99)

Related Items (5)

Computing lower and upper expectations under epistemic independence ⋮ A piecewise linearization for retail shelf space allocation problem and a local search heuristic ⋮ Reduction of indefinite quadratic programs to bilinear programs ⋮ An efficient algorithm to allocate shelf space ⋮ Credal networks

This page was built for publication: A Branch-and-Bound Method for Reversed Geometric Programming