Global maximization of a generalized concave multiplicative function
type: Item
instance of: scholarly article
title: Global maximization of a generalized concave multiplicative function
zbMATH Open document ID: 1145.90071
published in: Journal of Optimization Theory and Applications
publication date: 2008-06-04T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 5284732
zbMATH Keywords: Global optimization
zbMATH Keywords: Branch-and-bound algorithms
zbMATH Keywords: Multiplicative programming
zbMATH Keywords: Quadratic programming
zbMATH Keywords: Bilinear programming
author: Harold P. Benson
describes a project that uses: LINDO
describes a project that uses: LINGO
MaRDI profile type: Publication
full work available at URL: s10957-007-9323-9
OpenAlex ID: W2077306527
cites work: Global minimization of a generalized convex multiplicative function
cites work: Decomposition methods for solving nonconvex quadratic programs via branch and bound
cites work: Convex analysis and global optimization
cites work: Constrained global optimization: algorithms and applications
cites work: Q4833806
cites work: Introduction to global optimization
cites work: Optimization on low rank nonconvex structures
cites work: Equilibrium Points of Bimatrix Games
cites work: A bilinear programming formulation of the 3-dimensional assignment problem
cites work: A linear max—min problem
cites work: On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
cites work: Q3997222
cites work: Jointly Constrained Biconvex Programming
cites work: Deterministic algorithms for constrained concave minimization: A unified critical survey
DOI: 10.1007/S10957-007-9323-9
description: scientific article; zbMATH DE number 5284732