Duality without a constraint qualification for minimax fractional programming
type: Item
instance of: scholarly article
title: Duality without a constraint qualification for minimax fractional programming
zbMATH Open document ID: 0945.90078
DOI: 10.1023/A:1021771011210
published in: Journal of Optimization Theory and Applications
publication date: 1999-06-29T00:00:00Z
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C32
zbMATH DE Number: 1310608
zbMATH Keywords: generalized fractional programming
zbMATH Keywords: cone of directions
zbMATH Keywords: duality
author: Hang-Chin Lai
author: Jen-chwan Liu
author: Kensuke Tanaka
MaRDI profile type: Publication
cites work: Q3202144
cites work: Generalized fractional programming duality: A parametric approach
cites work: Duality for minmax programming involvingV-invex functions
cites work: Generalized fractional programming duablity: a ratio game approach
cites work: Duality in generalized linear fractional programming
cites work: An algorithm for generalized fractional programs
cites work: Parametric approaches to fractional programs
cites work: Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions
cites work: Optimality and duality for generalized fractional programming involving nonsmooth pseudoindex functions
cites work: Optimality and duality for generalized fractional variational problems involving generalized (fρ)-convex functions
cites work: Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
cites work: Q3902815
cites work: Q4187594
cites work: Q3706855
cites work: Q5202038
cites work: Q3978710
cites work: Duality without constraint qualification for multiobjective programming
cites work: Q4767789
cites work: Moreau-Rockafellar type theorem for convex set functions
description: scientific article; zbMATH DE number 1310608