Duality for a class of nondifferentiable mathematical programming problems in complex space
From MaRDI portal
Publication:1079500
DOI10.1016/0022-247X(84)90053-2zbMath0597.90073OpenAlexW2032405138MaRDI QIDQ1079500
Publication date: 1984
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(84)90053-2
Related Items (16)
On nondifferentiable minimax semi-infinite programming problems in complex spaces ⋮ Parametric duality on minimax programming involving generalized convexity in complex space ⋮ Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions ⋮ Duality for nondifferentiable minimax programming in complex spaces ⋮ Set-valued minimax programming problems under generalized cone convexity ⋮ Solving the complex quadratic double-ratio minimax optimization under a quadratic constraint ⋮ Complex minimax fractional programming of analytic functions ⋮ Optimality and duality for multi-objective fractional programming in complex spaces ⋮ Optimality conditions for nondifferentiable minimax fractional programming with complex variables ⋮ Complex nonlinear programming: Duality with invexity and equivalent real programs ⋮ 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 minmax problems involving arcwise connected and generalized arcwise connected functions ⋮ Extension to necessary optimality conditions in complex programming ⋮ Optimality and duality for complex multi-objective programming ⋮ Sufficiency criteria and duality in complex nonlinear programming involving pseudoinvex function
Cites Work
This page was built for publication: Duality for a class of nondifferentiable mathematical programming problems in complex space
