Minimax fractional programming under nonsmooth generalized \((\mathcal F,\rho, \theta)\)-d-univexity
type: Item
instance of: scholarly article
title: Minimax fractional programming under nonsmooth generalized \((\mathcal F,\rho, \theta)\)-d-univexity
zbMATH Open document ID: 1275.90100
author: X. J. Zheng
author: Cheng Li
published in: Journal of Mathematical Analysis and Applications
publication date: 2007-02-12T00:00:00Z
Mathematics Subject Classification ID: 90C32
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 5124095
zbMATH Keywords: minimax fractional problem
zbMATH Keywords: duality
zbMATH Keywords: sufficient optimality conditions
zbMATH Keywords: generalized convex functions
MaRDI profile type: Publication
full work available at URL: j.jmaa.2006.05.062
OpenAlex ID: W2027302763
cites work: Q3320150
cites work: Further Generalizations of Convexity in Mathematical Programming
cites work: Q3682265
cites work: Q4296818
cites work: Nondifferentiable minimax fractional programming under generalized univexity
cites work: Nondifferentiable multiobjective programming under generalized \(d\)-univexity
cites work: On generalised convex mathematical programming
cites work: Optimality conditions and duality models for minmax fractional subset programming problems with generalized \(({\mathcal F},\alpha,\rho, \theta)\)-\(V\)-convex functions
cites work: Multiobjective duality with invexity
cites work: On sufficiency of the Kuhn-Tucker conditions
cites work: Nondifferentiable optimization by smooth approximations
cites work: Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming
cites work: Three types dual model for minimax fractional programming
cites work: Q4000274
cites work: Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
cites work: Constraint qualification in a general class of nondifferentiable mathematical programming problems
cites work: Constraint qualifications in a class of nondifferentiable mathematical programming problems
DOI: 10.1016/J.JMAA.2006.05.062
description: scientific article; zbMATH DE number 5124095