Parametric duality on minimax programming involving generalized convexity in complex space
From MaRDI portal
Publication:855427
DOI10.1016/J.JMAA.2005.11.026zbMATH Open1109.90078OpenAlexW2067149853MaRDI QIDQ855427FDOQ855427
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
Cites Work
- 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
- A class of nondifferentiable complex programming problems
- Necessary conditions and sufficient conditions for static minmax problems
- A duality theorem for a special class of programming problems in complex space
- Duality for nonlinear programming in complex space
- Title not available (Why is that?)
- Complex Fractional Programming Involving Generalized Quasi/Pseudo Convex Functions
- Nondifferentiable fractional programming in complex spaces involving \(({\mathfrak L},\varrho,\theta)\)-convex analytic functions
- On nonlinear programming in complex spaces
- Nondifferentiable Fractional Programming in Complex Space
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonlinear programming in complex space: Sufficient conditions and duality
- Optimality and duality for complex nondifferentiable fractional programming
- Duality for fractional complex programming with generalized convexity
- Complex fractional programming and the Charnes-Cooper transformation
- Nonlinear Complex Programming with Nonlinear Constraints
- Nonlinear programming in complex space
- Optimality conditions for minimax programming of analytic functions
- On Nonlinear Nondifferentiable Complex Programming Problems
- On duality in complex linear programming
Cited In (10)
- Mixed-Type Duality on Nonsmooth Minimax Fractional Programming Involving Exponential (p, r)-Invexity
- Sufficient conditions and duality theorems for nondifferentiable minimax fractional programming
- Optimality conditions for nondifferentiable minimax programs and vector optimization problems
- Duality for nondifferentiable minimax programming in complex spaces
- Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions
- Complex minimax fractional programming of analytic functions
- 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
- Optimality conditions for nondifferentiable minimax fractional programming with complex variables
Recommendations
- Duality for nondifferentiable minimax programming in complex spaces 👍 👎
- Complex minimax programming under generalized convexity 👍 👎
- Title not available (Why is that?) 👍 👎
- Optimality and duality in complex minimax optimization under generalized \(\alpha\)-invexity 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Optimality and duality with generalized convexity 👍 👎
This page was built for publication: Parametric duality on minimax programming involving generalized convexity in complex space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855427)
