Complex minimax programming under generalized type-I functions
From MaRDI portal
Publication:814060
DOI10.1016/j.camwa.2005.04.002zbMath1127.90075OpenAlexW1973576823MaRDI QIDQ814060
Publication date: 2 February 2006
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2005.04.002
Related Items (4)
Generalized \(\alpha\)-invexity and nondifferentiable minimax fractional programming ⋮ Second-order duality for nondifferentiable minimax programming involving generalized type I functions ⋮ Nondifferentiable minimax fractional programming in complex spaces with parametric duality ⋮ Generalized \(\alpha \)-univexity and duality for nondifferentiable minimax fractional programming
Cites Work
- On nonlinear programming in complex spaces
- Nonlinear complex programming
- Optimality and duality for complex nondifferentiable fractional programming
- Symmetric duality for mathematical programming in complex spaces with \(F\)-convexity.
- A duality theorem for a special class of programming problems in complex space
- Complex minimax programming under generalized convexity
- Complex nonlinear programming: Duality with invexity and equivalent real programs
- Linear programming in complex space
- Symmetric duality for quadratic programming in complex space
- A duality theorem for complex quadratic programming
- Duality for nonlinear programming in complex space
- Nonlinear programming in complex space: Sufficient conditions and duality
- Sufficiency criteria and duality in complex nonlinear programming involving pseudoinvex function
- Nondifferentiable Fractional Programming in Complex Space
- A class of nondifferentiable complex programming problems
- Nonlinear Complex Programming with Nonlinear Constraints
- Complex Fractional Programming Involving Generalized Quasi/Pseudo Convex Functions
- Invex functions and their application to mathematical programming
- Nonlinear programming in complex space
- Pseudoconvex complex minimax programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Complex minimax programming under generalized type-I functions