Global maximization of a generalized concave multiplicative function

DOI10.1007/s10957-007-9323-9zbMath1145.90071OpenAlexW2077306527MaRDI 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 optimizationQuadratic programmingBilinear programmingBranch-and-bound algorithmsMultiplicative programming

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Quadratic programming (90C20)

Related Items (11)

Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set ⋮ A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming ⋮ Global optimization algorithm for solving linear multiplicative programming problems ⋮ Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound ⋮ On the solution of generalized multiplicative extremum problems ⋮ A practicable branch-and-bound algorithm for globally solving linear multiplicative programming ⋮ Global optimization for generalized linear multiplicative programming using convex relaxation ⋮ An outcome space approach for generalized convex multiplicative programs ⋮ Global optimization algorithm for a generalized linear multiplicative programming ⋮ Global optimization for the sum of concave-convex ratios problem ⋮ Global optimization method for linear multiplicative programming

Uses Software

• LINDO
• LINGO

Cites Work

• 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
• Deterministic algorithms for constrained concave minimization: A unified critical survey
• Equilibrium Points of Bimatrix Games
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
• Convex analysis and global optimization

This page was built for publication: Global maximization of a generalized concave multiplicative function