Branch-and-reduce algorithm for convex programs with additional multiplicative constraints

DOI10.1016/j.ejor.2008.09.023zbMath1176.90455OpenAlexW1994701878MaRDI QIDQ1042085

Erjiang Sun, Harold P. Benson

Publication date: 7 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2008.09.023

zbMATH Keywords

global optimizationmultiplicative programmingbranch-and-reduceproduct of convex functions

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

On optimization over the efficient set of a multiple objective linear programming problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type
• Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints
• Mathematical programs with a two-dimensional reverse convex constraint
• Linear programs with an additional rank two reverse convex constraint
• Convex programs with an additional constraint on the product of several convex functions
• A finite algorithm for globally optimizing a class of rank-two reverse convex programs
• A deterministic approach to linear programs with several additional multiplicative constraints
• Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• A PARAMETRIC SUCCESSIVE UNDERESTIMATION METHOD FOR CONVEX PROGRAMMING PROBLEMS WITH AN ADDITIONAL CONVEX MULTIPLICATIVE CONSTRAINT
• Solving Bicriterion Mathematical Programs
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• A new approach to optimization under monotonic constraint