Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions
type: Item
instance of: scholarly article
title: Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions
zbMATH Open document ID: 0835.90073
DOI: 10.1007/BF01096767
published in: Journal of Global Optimization
publication date: 1996-04-15T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C32
zbMATH DE Number: 755310
zbMATH Keywords: global minimum
zbMATH Keywords: product of two affine fractional functions
zbMATH Keywords: branch-and- bound
author: Le Dung Muu
author: Bui The Tam
author: S. Schaible
MaRDI profile type: Publication
cites work: Programming with linear fractional functionals
cites work: Image space analysis of generalized fractional programs
cites work: Q3997222
cites work: BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
cites work: Parametric simplex algorithms for solving a special class of nonconvex minimization problems
cites work: A PARAMETRIC SUCCESSIVE UNDERESTIMATION METHOD FOR CONVEX PROGRAMMING PROBLEMS WITH AN ADDITIONAL CONVEX MULTIPLICATIVE CONSTRAINT
cites work: Method for minimizing a convex-concave function over a convex set
cites work: Minimizing the sum of a convex function and the product of two affine functions over a convex set
cites work: Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
cites work: Mathematical programs with a two-dimensional reverse convex constraint
cites work: An efficient solution method for rank two quasiconcave minimization problems
description: scientific article; zbMATH DE number 755310