Global Optimization of Linear Multiplicative Programming Using Univariate Search

DOI10.1007/978-3-642-38667-1_6zbMath1308.90141OpenAlexW1846592950MaRDI QIDQ4982140

Xue-Gang Zhou

Publication date: 24 March 2015

Published in: Fuzzy Information & Engineering and Operations Research & Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38667-1_6

zbMATH Keywords

convex programminglinear multiplicative programmingunivariate search

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Linear programming (90C05)

Cites Work

• Unnamed Item
• Global minimization of a generalized convex multiplicative function
• Image space analysis of generalized fractional programs
• Bilinear separation of two sets in \(n\)-space
• Multiplicative programming problems: Analysis and efficient point search heuristic
• Solving long-term financial planning problems via global optimization
• An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
• Outcome-space cutting-plane algorithm for linear multiplicative programming
• A method of acceleration for a class of multiplicative programming problems with exponent
• \(NP\)-hardness of linear multiplicative programming and related problems
• Robust Optimization of Large-Scale Systems