Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions

DOI10.1007/BF01096767zbMath0835.90073MaRDI QIDQ1804585

Bui The Tam, Siegfried Schaible, Le Dung Muu

Publication date: 15 April 1996

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

global minimumbranch-and- boundproduct of two affine fractional functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Fractional programming (90C32)

Related Items

Regional division and reduction algorithm for minimizing the sum of linear fractional functions, A fifth bibliography of fractional programming^*, A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension, An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem, A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-atios problems

Cites Work

• Unnamed Item
• Method for minimizing a convex-concave function over a convex set
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Mathematical programs with a two-dimensional reverse convex constraint
• Image space analysis of generalized fractional programs
• Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• An efficient solution method for rank two quasiconcave minimization problems
• Minimizing the sum of a convex function and the product of two affine functions over a convex set
• A PARAMETRIC SUCCESSIVE UNDERESTIMATION METHOD FOR CONVEX PROGRAMMING PROBLEMS WITH AN ADDITIONAL CONVEX MULTIPLICATIVE CONSTRAINT
• Programming with linear fractional functionals