Optimality conditions for nondifferentiable minimax fractional programming with complex variables
DOI10.1016/J.JMAA.2009.05.049zbMATH Open1172.90016OpenAlexW2025806401MaRDI QIDQ2272043FDOQ2272043
Authors: Hang-Chin Lai, Tone-Yau Huang
Publication date: 5 August 2009
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.2009.05.049
Recommendations
- Optimality and duality for complex nondifferentiable fractional programming
- Nondifferentiable minimax fractional programming in complex spaces with parametric duality
- Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity
- Nondifferentiable Fractional Programming in Complex Space
- Optimality conditions for a nondifferentiable minimax programming in complex spaces
- On necessary conditions for a class of nondifferentiable minimax fractional programming
- Optimality conditions for fractional minmax programming
- Optimality and duality for a class of nondifferentiable minimax fractional programming problems
- Sufficient conditions and duality theorems for nondifferentiable minimax fractional programming
- scientific article; zbMATH DE number 2066918
optimalityfractional programminganalytic functiongeneralized convexity for complex variablesnondifferentiable complex minimax programming
Cites Work
- Optimality conditions for a nondifferentiable minimax programming in complex spaces
- Duality for a class of nondifferentiable mathematical programming problems in complex space
- Linear programming in complex space
- A class of nondifferentiable complex programming problems
- Necessary and sufficient conditions for minimax fractional programming
- Nonlinear complex programming
- Duality for nondifferentiable minimax programming in complex spaces
- Complex Fractional Programming Involving Generalized Quasi/Pseudo Convex Functions
- Parametric duality on minimax programming involving generalized convexity in complex space
- Complex minimax fractional programming of analytic functions
- On nonlinear programming in complex spaces
- Nondifferentiable Fractional Programming in Complex Space
- Title not available (Why is that?)
- Complex fractional programming and the Charnes-Cooper transformation
- Optimality conditions for minimax programming of analytic functions
Cited In (14)
- Optimality conditions for fractional minmax programming
- Nondifferentiable Fractional Programming in Complex Space
- Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions
- A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming
- Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions
- Complex minimax fractional programming of analytic functions
- Complex analysis methods related an optimization problem with complex variables
- Optimality and duality for multi-objective fractional programming in complex spaces
- Robust necessary optimality conditions for nondifferentiable complex fractional programming with uncertain data
- Optimality conditions for a nondifferentiable minimax programming in complex spaces
- Nondifferentiable minimax fractional programming in complex spaces with parametric duality
- A new branch and bound algorithm for minimax ratios problems
- A new linearization technique for minimax linear fractional programming
- Optimality and duality for complex multi-objective programming
This page was built for publication: Optimality conditions for nondifferentiable minimax fractional programming with complex variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2272043)