Solving globally the linear multiplicative programming problem via monotonic functions

MaRDI QIDQ2916532zbMATH OpenFDO

Authors Weixin Cheng, Yongqiang Chen

Publication date 5 October 2012

Published in Journal of Henan Normal University. Natural Science (Search for Journal in Brave)

zbMATH Keywords

branch and boundglobal optimizationlinear multiplicative programming

Mathematics Subject Classification ID

Linear programming (90C05) Optimality conditions and duality in mathematical programming (90C46) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Global algorithm for solving linear multiplicative programming problems
• Global optimization method for linear multiplicative programming
• A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
• A nonisolated optimal solution of general linear multiplicative programming problems
• Global minimization of a generalized linear multiplicative programming

Cited in

(1)

• Monotonizing linear programs with up to two nonzeroes per column

This page was built for publication: Solving globally the linear multiplicative programming problem via monotonic functions

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