A new method for solving a class of multiplicative programming

DOI10.16366/J.CNKI.1000-2367.2015.04.001MaRDI QIDQ3463093zbMATH OpenFDO

Authors Yonghong Zhang, Xiaodi Wu, Yongqiang Chen

Publication date 15 January 2016

Full work available at URL https://doi.org/10.16366/J.CNKI.1000-2367.2015.04.001

zbMATH Keywords

algorithmbranch and boundconvergenceglobal optimizationlinear relaxationlinearization methodmultiplicative constraintsnumerical resultsregion reducing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A new linearization method for generalized linear multiplicative programming
• A new branch and bound algorithm for linear multiplicative programming
• Linearization method for a class of multiplicative programming with exponent
• An accelerating algorithm for a class of multiplicative programming
• A global optimization for a class of multiplicative programming problems

Cited in

(8)

• The linearization method: Principal concepts and perspective directions
• Multiplicative programming problems: Analysis and efficient point search heuristic
• A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
• New class of multiplicative algorithms for solving of entropy-linear programs
• A parametric method for solving linear multiplicative programming problem
• scientific article; zbMATH DE number 6501301 (Why is no real title available?)
• scientific article; zbMATH DE number 3881793 (Why is no real title available?)
• A new method for solution of linear programming with additional multiplicative constraints

This page was built for publication: A new method for solving a class of multiplicative programming

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