Constraint qualifications in a class of nondifferentiable mathematical programming problems
type: Item
instance of: scholarly article
title: Constraint qualifications in a class of nondifferentiable mathematical programming problems
zbMATH Open document ID: 1151.90578
author: Zengkun Xu
published in: Journal of Mathematical Analysis and Applications
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 49J52
zbMATH DE Number: 2136647
zbMATH Keywords: Necessary conditions
zbMATH Keywords: Nondifferentiable problems
zbMATH Keywords: Constraint qualifications
MaRDI profile type: Publication
full work available at URL: j.jmaa.2003.10.041
OpenAlex ID: W1980854559
cites work: Q4000274
cites work: Necessary and sufficient conditions for minimax fractional programming
cites work: Q5589748
cites work: A class of nondifferentiable mathematical programming problems
cites work: On a constraint qualification in a nondifferentiable programming problem
cites work: Q5599348
cites work: A subgradient duality theorem
cites work: Optimality conditions for fractional minmax programming
cites work: Saddle-point type optimality criteria for generalized fractional programming
DOI: 10.1016/J.JMAA.2003.10.041
description: scientific article; zbMATH DE number 2136647