A global optimization for a class of multiplicative programming problems

MaRDI QIDQ5400050zbMATH OpenFDO

Authors Xiaoai Li, Chunfeng Wang

Publication date 28 February 2014

zbMATH Keywords

global optimizationlinear relaxationbranch and bound algorithmmultiplicative programming

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Recommendations

• Global optimization method for linear multiplicative programming
• Global optimization algorithm for solving linear multiplicative programming problems
• Global optimization for D.C. multiplicative programming
• Global optimization of multiplicative programs
• Linearization method for a class of multiplicative programming with exponent

Cited in

(12)

• Global optimization of linear multiplicative programming using univariate search
• A new global optimization approach for convex multiplicative programming
• A nonisolated optimal solution of general linear multiplicative programming problems
• An accelerating algorithm for a class of multiplicative programming
• scientific article; zbMATH DE number 1799337 (Why is no real title available?)
• Global optimization for D.C. multiplicative programming
• Multiplicative programming problems: Analysis and efficient point search heuristic
• Global optimization of multiplicative programs
• A method of acceleration for a class of multiplicative programming problems with exponent
• A global optimization approach for solving generalized nonlinear multiplicative programming problem
• A duality bound method for solving concave multiplicative programming with exponents
• A new method for solving a class of multiplicative programming

This page was built for publication: A global optimization for a class of multiplicative programming problems

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