Global maximization of a generalized concave multiplicative function

DOI10.1007/s10957-007-9323-9zbMath1145.90071MaRDI QIDQ927239

Harold P. Benson

Publication date: 4 June 2008

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-007-9323-9

zbMATH Keywords

Global optimization; Quadratic programming; Bilinear programming; Branch-and-bound algorithms; Multiplicative programming

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90C30: Nonlinear programming

90C20: Quadratic programming

Related Items

On the solution of generalized multiplicative extremum problems, An outcome space approach for generalized convex multiplicative programs

Uses Software

• LINDO
• LINGO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decomposition methods for solving nonconvex quadratic programs via branch and bound
• Constrained global optimization: algorithms and applications
• Global minimization of a generalized convex multiplicative function
• Optimization on low rank nonconvex structures
• Introduction to global optimization
• Jointly Constrained Biconvex Programming
• A bilinear programming formulation of the 3-dimensional assignment problem
• A linear max—min problem
• Equilibrium Points of Bimatrix Games
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
• Convex analysis and global optimization