A global optimization algorithm for linear fractional and bilinear programs
type: Item
instance of: scholarly article
title: A global optimization algorithm for linear fractional and bilinear programs
zbMATH Open document ID: 0835.90074
DOI: 10.1007/BF01106605
author: Ignacio Quesada
author: Ignacio E. Grossmann
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: 758382
zbMATH Keywords: bilinear programming
zbMATH Keywords: convex underestimators
zbMATH Keywords: global optimization
zbMATH Keywords: linear fractional and bilinear terms
zbMATH Keywords: spatial branch-and-bound
MaRDI profile type: Publication
cites work: Generalized bilinear programming. I: Models, applications and linear programming relaxation
cites work: Jointly Constrained Biconvex Programming
cites work: Q3932576
cites work: Programming with linear fractional functionals
cites work: On Nonlinear Fractional Programming
cites work: A collection of test problems for constrained global optimization algorithms
cites work: Deterministic methods in constrained global optimization: Some recent advances and new fields of application
cites work: Q3997222
cites work: Parametric simplex algorithms for solving a special class of nonconvex minimization problems
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: Q4040374
cites work: Stochastic techniques for global optimization: A survey of recent advances
cites work: A new reformulation-linearization technique for bilinear programming problems
full work available at URL: https://doi.org/10.1007/bf01106605
OpenAlex ID: W2051668769
description: scientific article; zbMATH DE number 758382