Using duality to solve generalized fractional programming problems
type: Item
instance of: scholarly article
title: Using duality to solve generalized fractional programming problems
zbMATH Open document ID: 0858.90126
DOI: 10.1007/BF00138690
author: J. B. G. Frenk
author: Ana Isabel Barros
author: S. Schaible
author: Shuzhong Zhang
published in: Journal of Global Optimization
publication date: 1997-03-23T00:00:00Z
Mathematics Subject Classification ID: 90C32
zbMATH DE Number: 934392
zbMATH Keywords: quasiconvexity
zbMATH Keywords: convex generalized fractional programming
zbMATH Keywords: strong duality
zbMATH Keywords: Dinkelbach-type algorithm
describes a project that uses: Algorithm 431
MaRDI profile type: Publication
cites work: Generalized concavity
cites work: A new algorithm for generalized fractional programs
cites work: Convergence of interval-type algorithms for generalized fractional programming
cites work: Q5801628
cites work: Programming with linear fractional functionals
cites work: Fractional programming - a survey
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: Q3141900
cites work: Duality in generalized fractional programming via Farkas' lemma
cites work: Global optimization of fractional programs
cites work: Sufficient conditions for extremum, penalty functions and regularity
cites work: Convex Analysis
cites work: Q4178771
cites work: Fractional programming
cites work: On general minimax theorems
cites work: Q3820394
full work available at URL: https://doi.org/10.1007/bf00138690
OpenAlex ID: W2015973352
description: scientific article; zbMATH DE number 934392