On nondifferentiable minimax semi-infinite programming problems in complex spaces

DOI10.1515/gmj-2016-0001zbMath1344.90042OpenAlexW2518243517MaRDI QIDQ313722

Anurag Jayswal, Krishna Kummari

Publication date: 12 September 2016

Published in: Georgian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/gmj-2016-0001

zbMATH Keywords

dualityinvexitysemi-infinite programmingsufficiencycomplex minimax programming problem

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Stochastic programming (90C15) Programming in abstract spaces (90C48) Semi-infinite programming (90C34) Optimality conditions for minimax problems (49K35)

Cites Work

• Second-order duality for a nondifferentiable minimax fractional programming under generalized \(\alpha\)-univexity
• Duality for semi-infinite programming problems involving \((H_p,r)\)-invex functions
• Optimality conditions for a nondifferentiable minimax programming in complex spaces
• Higher-order duality in nondifferentiable minimax programming with generalized type I functions
• Duality for a class of nondifferentiable mathematical programming problems in complex space
• Complex nonlinear programming: Duality with invexity and equivalent real programs
• Second-order duality in nondifferentiable minmax programming involving type-I functions
• Linear programming in complex space
• An extension of the transposition theorems of Farkas and Eisenberg
• Minimax fractional programming problem involving nonsmooth generalized ?-univex functions
• On semi-infinite minmax programming with generalized invexity
• A class of nondifferentiable complex programming problems
• Second order nondifferentiable minimax fractional programming with square root terms
• A duality theory for convex programs with convex constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On nondifferentiable minimax semi-infinite programming problems in complex spaces