On nondifferentiable minimax semi-infinite programming problems in complex spaces
DOI10.1515/GMJ-2016-0001zbMATH Open1344.90042OpenAlexW2518243517MaRDI QIDQ313722FDOQ313722
Authors: 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
Recommendations
- Optimality conditions for a nondifferentiable minimax programming in complex spaces
- Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions
- Duality for nondifferentiable minimax programming in complex spaces
- Nondifferentiable minimax fractional programming in complex spaces with parametric duality
- Duality for a class of nondifferentiable mathematical programming problems in complex space
Stochastic programming (90C15) Minimax problems in mathematical programming (90C47) Optimality conditions for minimax problems (49K35) Semi-infinite programming (90C34) Programming in abstract spaces (90C48)
Cites Work
- Title not available (Why is that?)
- Second-order duality in nondifferentiable minmax programming involving type-I functions
- Second-order duality for a nondifferentiable minimax fractional programming under generalized \(\alpha\)-univexity
- Second order nondifferentiable minimax fractional programming with square root terms
- 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
- 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
- Duality for semi-infinite programming problems involving \((H_p,r)\)-invex functions
- A class of nondifferentiable complex programming problems
- A duality theory for convex programs with convex constraints
- Title not available (Why is that?)
- The \((\mathcal{G},\beta,\phi, h(\cdot, \cdot),\rho,\theta)\)-univexities of higher-orders with applications to parametric duality models in minimax fractional programming
Cited In (6)
- Duality for nondifferentiable minimax programming in complex spaces
- Optimal value functions of generalized semi-infinite min-max programming on a noncompact set
- Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions
- Non-differentiable mathematical programming in complex space
- 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: On nondifferentiable minimax semi-infinite programming problems in complex spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313722)
