Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions
From MaRDI portal
Publication:896726
DOI10.1155/2013/297015zbMATH Open1327.90380OpenAlexW2075024816WikidataQ59020028 ScholiaQ59020028MaRDI QIDQ896726FDOQ896726
Authors: Anurag Jayswal, Ashish Kumar Prasad, 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
Recommendations
- Duality for nondifferentiable minimax programming in complex spaces
- Optimality conditions for a nondifferentiable minimax programming in complex spaces
- Optimality and duality for nondifferentiable minimax fractional programming with generalized convexity
- On nondifferentiable minimax semi-infinite programming problems in complex spaces
- Duality for a class of nondifferentiable mathematical programming problems in complex space
Cites Work
- Programming with linear fractional functionals
- Second-order duality in nondifferentiable minmax programming involving type-I functions
- Higher-order duality in nondifferentiable minimax programming with generalized type I functions
- Duality for a class of nondifferentiable mathematical programming problems in complex space
- Linear programming in complex space
- Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity
- A duality theorem for a special class of programming problems in complex space
- Duality for nondifferentiable minimax programming in complex spaces
- Parametric duality on minimax programming involving generalized convexity in complex space
- Optimality conditions for nondifferentiable minimax fractional programming with complex variables
- Symmetric duality for mathematical programming in complex spaces with \(F\)-convexity.
Cited In (6)
- Duality for nondifferentiable minimax programming in complex spaces
- Parametric duality on minimax programming involving generalized convexity in complex space
- Complex analysis methods related an optimization problem with complex variables
- On nondifferentiable minimax semi-infinite programming problems in complex spaces
- Optimality conditions for a nondifferentiable minimax programming in complex spaces
- Duality for a class of nondifferentiable mathematical programming problems in complex space
This page was built for publication: Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896726)
