A branch-and-reduce approach for solving generalized linear multiplicative programming

DOI10.1155/2011/409491MaRDI QIDQ410377zbMATH OpenOpenAlexWikidataFDO

Authors Chunfeng Wang, Geng-Zhong Zheng, Sanyang Liu

Publication date 3 April 2012

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2011/409491

Mathematics Subject Classification ID

Linear programming (90C05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• A branch and bound algorithm for solving a class of generalized linear multiplicative programming problems
• A new linearization method for generalized linear multiplicative programming
• Global minimization of a generalized linear multiplicative programming
• A branch and bound reduction algorithm for solving a class of linear multiplicative programming problems with constant coefficients
• Global optimization algorithm for a generalized linear multiplicative programming

Cites work

• scientific article; zbMATH DE number 3769296 (Why is no real title available?)
• A branch and bound algorithm for globally solving a class of nonconvex programming problems
• A finite branch-and-bound algorithm for linear multiplicative programming
• A global optimization approach for solving the convex multiplicative programming problem
• A method of acceleration for a class of multiplicative programming problems with exponent
• A new accelerating method for globally solving a class of nonconvex programming problems
• A new linearization method for generalized linear multiplicative programming
• An outcome-space finite algorithm for solving linear multiplicative programming
• Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
• Global optimization of multiplicative programs
• Linearization method for a class of multiplicative programming with exponent
• Outcome-space cutting-plane algorithm for linear multiplicative programming
• Robust Optimization of Large-Scale Systems

Cited in

(2)

• Solving linear multiplicative programs via branch-and-bound: a computational experience
• A practicable branch-and-bound algorithm for globally solving linear multiplicative programming

This page was built for publication: A branch-and-reduce approach for solving generalized linear multiplicative programming

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