A Branch-and-Bound Method for Reversed Geometric Programming

DOI10.1287/OPRE.27.5.982MaRDI QIDQ3863446zbMATH OpenOpenAlexFDO

Authors 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

branch-and-bound methodconvergencecutting plane techniquereversed geometric programssequence of convex programs

Mathematics Subject Classification ID

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

Cited in

(5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3863446)