Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions

DOI10.1155/2013/297015zbMath1327.90380OpenAlexW2075024816WikidataQ59020028 ScholiaQ59020028MaRDI QIDQ896726

Ashish Kumar Prasad, Anurag Jayswal, Krishna Kummari

Publication date: 11 December 2015

Published in: Journal of Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/297015

Mathematics Subject Classification ID

Convex programming (90C25) Minimax problems in mathematical programming (90C47)

Cites Work

• Duality for nondifferentiable minimax programming in complex spaces
• Parametric duality on minimax programming involving generalized convexity in complex space
• Higher-order duality in nondifferentiable minimax programming with generalized type I functions
• Duality for a class of nondifferentiable mathematical programming problems in complex space
• Symmetric duality for mathematical programming in complex spaces with \(F\)-convexity.
• A duality theorem for a special class of programming problems in complex space
• Optimality conditions for nondifferentiable minimax fractional programming with complex variables
• Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity
• Second-order duality in nondifferentiable minmax programming involving type-I functions
• Linear programming in complex space
• Programming with linear fractional functionals

This page was built for publication: Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions