Complex minimax fractional programming of analytic functions
From MaRDI portal
Publication:927245
DOI10.1007/s10957-007-9332-8zbMath1145.90091OpenAlexW2079862904MaRDI QIDQ927245
Jen-chwan Liu, Siegfried Schaible, Hang-Chin Lai
Publication date: 4 June 2008
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-007-9332-8
Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)
Related Items (10)
Mixed-Type Duality on Nonsmooth Minimax Fractional Programming Involving Exponential (p, r)-Invexity ⋮ A new linearization technique for minimax linear fractional programming ⋮ Duality for nondifferentiable minimax programming in complex spaces ⋮ Nondifferentiable minimax fractional programming in complex spaces with parametric duality ⋮ Duality on a 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 ⋮ A taxonomy and review of the multi-objective fractional programming (MOFP) problems ⋮ 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
- Nondifferentiable fractional programming in complex spaces involving \(({\mathfrak L},\varrho,\theta)\)-convex analytic functions
- Complex fractional programming and the Charnes-Cooper transformation
- Parametric duality on minimax programming involving generalized convexity in complex space
- Duality for a class of nondifferentiable mathematical programming problems in complex space
- Duality for a class of nondifferentiable mathematical programming problems
- On nonlinear programming in complex spaces
- Nonlinear complex programming
- Necessary conditions and sufficient conditions for static minmax problems
- Optimality and duality for complex nondifferentiable fractional programming
- 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
- Sufficiency criteria and duality in complex nonlinear programming involving pseudoinvex function
- Duality for fractional minimax programming problems
- Nondifferentiable Fractional Programming in Complex Space
- A class of nondifferentiable complex programming problems
- Complex Fractional Programming Involving Generalized Quasi/Pseudo Convex Functions
- On Nonlinear Nondifferentiable Complex Programming Problems
- Nonlinear programming in complex space
This page was built for publication: Complex minimax fractional programming of analytic functions
