Necessary and sufficient conditions for minimax fractional programming
type: Item
instance of: scholarly article
title: Necessary and sufficient conditions for minimax fractional programming
zbMATH Open document ID: 0916.90251
published in: Journal of Mathematical Analysis and Applications
publication date: 1999-07-21T00:00:00Z
Mathematics Subject Classification ID: 90C32
Mathematics Subject Classification ID: 26B25
zbMATH DE Number: 1274794
zbMATH Keywords: necessary and sufficient optimality conditions
zbMATH Keywords: nondifferentiable minimax fractional programming
zbMATH Keywords: duality theorems
author: Hang-Chin Lai
author: Jen-chwan Liu
author: Kensuke Tanaka
MaRDI profile type: Publication
full work available at URL: jmaa.1998.6204
OpenAlex ID: W1966662454
cites work: Q3932576
cites work: Q3693272
cites work: Second order duality for a minimax programming problem
cites work: Q4847340
cites work: Supports of a convex function
cites work: A Gradient Inequality for a Class of Nondifferentiable Functions
cites work: Alternative theorems and saddlepoint results for convex programming problems of set functions with values in ordered vector spaces
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: Duality for Fractional Minimax Programming∗∗The research is partly supported by NSC, Taiwan.$ef:
cites work: On minimax fractional optimality conditions with invexity
cites work: On minimax fractional optimality conditions with \((F,\rho)\)-convexity
cites work: Necessary conditions and sufficient conditions for static minmax problems
cites work: Optimality conditions for fractional minmax programming
cites work: An Extension of a Theorem on Supports of a Convex Function
cites work: Duality for a class of nondifferentiable mathematical programming problems
cites work: Q5285557
cites work: Duality for fractional minimax programming problems
cites work: Q3790970
cites work: Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
DOI: 10.1006/JMAA.1998.6204
description: scientific article; zbMATH DE number 1274794