A simplex branch-and-bound method of a class of multi-product programming problems

MaRDI QIDQ2885973zbMATH OpenFDO

Authors Fei Wei, Yuelin Gao, Junmei Liu

Publication date 1 June 2012

Published in Journal of Natural Science of Heilongjiang University (Search for Journal in Brave)

zbMATH Keywords

global optimizationbranch-and-bound methodconvex envelopeconcave multiplicative programming

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A rectangular branch and bound reduction algorithm for solving a kind of multi-product-sum programming problem
• A finite branch-and-bound algorithm for linear multiplicative programming
• Global minimization of a generalized linear multiplicative programming
• A duality bound method for solving concave multiplicative programming with exponents
• A branch and bound algorithm for solving a class of generalized linear multiplicative programming problems

Cited in

(1)

• A rectangular branch and bound reduction algorithm for solving a kind of multi-product-sum programming problem

This page was built for publication: A simplex branch-and-bound method of a class of multi-product programming problems

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