A new algorithm for generalized fractional programs
type: Item
instance of: scholarly article
title: A new algorithm for generalized fractional programs
zbMATH Open document ID: 0853.90106
DOI: 10.1007/BF02592087
author: J. B. G. Frenk
author: Ana Isabel Barros
author: S. Schaible
author: Shuzhong Zhang
published in: Mathematical Programming. Series A. Series B
publication date: 1996-08-01T00:00:00Z
Mathematics Subject Classification ID: 90C32
zbMATH DE Number: 912378
zbMATH Keywords: quasi-convexity
zbMATH Keywords: Karush-Kuhn-Tucker conditions
zbMATH Keywords: convex generalized fractional programs
zbMATH Keywords: Dinkelbach-type algorithm
zbMATH Keywords: superlinear convergence
describes a project that uses: Algorithm 431
MaRDI profile type: Publication
cites work: Generalized fractional programming and cutting plane algorithms
cites work: Q3902815
cites work: Convergence of interval-type algorithms for generalized fractional programming
cites work: Algorithms for generalized fractional programming
cites work: Duality in generalized linear fractional programming
cites work: An algorithm for generalized fractional programs
cites work: A note on an algorithm for generalized fractional programs
cites work: On Nonlinear Fractional Programming
cites work: Generalized fractional programming: Algorithms and numerical experimentation
cites work: Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
cites work: Parametric approaches to fractional programs
cites work: ALGORITHMS FOR QUADRATIC FRACTIONAL PROGRAMMING PROBLEMS
cites work: Duality in generalized fractional programming via Farkas' lemma
cites work: Q3215459
cites work: Convex Analysis
cites work: Q3221767
cites work: Fractional programming
cites work: Q5187067
cites work: On general minimax theorems
cites work: Q3820394
cites work: A simple constraint qualification in convex programming
description: scientific article; zbMATH DE number 912378