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

DOI10.1155/2011/409491zbMath1235.90122OpenAlexW2111903757WikidataQ58693019 ScholiaQ58693019MaRDI QIDQ410377

Chun-Feng Wang, Geng-Zhong Zheng, San-Yang 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

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

Cites Work

• Unnamed Item
• A new linearization method for generalized linear multiplicative programming
• Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
• An outcome-space finite algorithm for solving linear multiplicative programming
• Linearization method for a class of multiplicative programming with exponent
• A new accelerating method for globally solving a class of nonconvex programming problems
• A global optimization approach for solving the convex multiplicative programming problem
• Global optimization of multiplicative programs
• Outcome-space cutting-plane algorithm for linear multiplicative programming
• A method of acceleration for a class of multiplicative programming problems with exponent
• A branch and bound algorithm for globally solving a class of nonconvex programming problems
• Robust Optimization of Large-Scale Systems
• A finite branch-and-bound algorithm for linear multiplicative programming

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