Global maximization of a generalized concave multiplicative function

DOI10.1007/S10957-007-9323-9MaRDI QIDQ927239zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• An outcome-space normal cone method for generalized concave multiplicative problems
• On the solution of generalized multiplicative extremum problems
• A global optimization approach for solving generalized nonlinear multiplicative programming problem
• Global optimization of multiplicative programs
• A finite branch-and-bound algorithm for linear multiplicative programming

Cites work

• scientific article; zbMATH DE number 47153 (Why is no real title available?)
• scientific article; zbMATH DE number 757677 (Why is no real title available?)
• A bilinear programming formulation of the 3-dimensional assignment problem
• A linear max—min problem
• Constrained global optimization: algorithms and applications
• Convex analysis and global optimization
• Decomposition methods for solving nonconvex quadratic programs via branch and bound
• Deterministic algorithms for constrained concave minimization: A unified critical survey
• Equilibrium Points of Bimatrix Games
• Global minimization of a generalized convex multiplicative function
• Introduction to global optimization
• Jointly Constrained Biconvex Programming
• On Connections Between Zero-One Integer Programming and Concave Programming Under Linear Constraints
• Optimization on low rank nonconvex structures

Cited in

(18)

• Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound
• Global optimization algorithm for a generalized linear multiplicative programming
• A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming
• A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming
• A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
• An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs
• Global optimization algorithm for solving linear multiplicative programming problems
• Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set
• An outcome space approach for generalized convex multiplicative programs
• A new approach to optimization under monotonic constraint
• scientific article; zbMATH DE number 4009675 (Why is no real title available?)
• Global optimization for generalized linear multiplicative programming using convex relaxation
• Global optimization method for linear multiplicative programming
• Global minimization of a generalized convex multiplicative function
• A method based on parametric convex programming for solving convex multiplicative programming problem
• Global optimization for the sum of concave-convex ratios problem
• An outcome-space normal cone method for generalized concave multiplicative problems
• On the solution of generalized multiplicative extremum problems

Describes a project that uses

Uses Software

• LINDO
• LINGO

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

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