Parametric duality on minimax programming involving generalized convexity in complex space
From MaRDI portal
Publication:855427
DOI10.1016/j.jmaa.2005.11.026zbMath1109.90078OpenAlexW2067149853MaRDI QIDQ855427
Publication date: 7 December 2006
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2005.11.026
Related Items (10)
Mixed-Type Duality on Nonsmooth Minimax Fractional Programming Involving Exponential (p, r)-Invexity ⋮ Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions ⋮ Optimality conditions for nondifferentiable minimax programs and vector optimization problems ⋮ Duality for nondifferentiable minimax programming in complex spaces ⋮ Complex minimax fractional programming of analytic functions ⋮ Sufficient conditions and duality theorems for nondifferentiable minimax fractional programming ⋮ Optimality conditions for nondifferentiable minimax fractional programming with complex variables ⋮ Robust necessary optimality conditions for nondifferentiable complex fractional programming with uncertain data ⋮ Optimality conditions for a nondifferentiable minimax programming in complex spaces ⋮ Optimality and duality for nonsmooth multiobjective fractional programming problems involving exponential \(V\)-\(r\)-invexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nondifferentiable fractional programming in complex spaces involving \(({\mathfrak L},\varrho,\theta)\)-convex analytic functions
- Complex fractional programming and the Charnes-Cooper transformation
- Duality for a class of nondifferentiable mathematical programming problems in complex space
- On nonlinear programming in complex spaces
- Necessary conditions and sufficient conditions for static minmax problems
- Optimality and duality for complex nondifferentiable fractional programming
- Optimality conditions for minimax programming of analytic functions
- A duality theorem for a special class of programming problems in complex space
- Complex nonlinear programming: Duality with invexity and equivalent real programs
- Linear programming in complex space
- Duality for nonlinear programming in complex space
- Nonlinear programming in complex space: Sufficient conditions and duality
- 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
- On Nonlinear Nondifferentiable Complex Programming Problems
- On duality in complex linear programming
- Nonlinear programming in complex space
This page was built for publication: Parametric duality on minimax programming involving generalized convexity in complex space
