Pseudoconvex complex minimax programming
From MaRDI portal
Recommendations
Cited in
(17)- Nondifferentiable minimax fractional programming under generalized univexity
- Optimality and duality for multiple-objective optimization under generalized type I univexity
- Complex minimax programming under generalized convexity
- Generalized \(\alpha\)-invexity and nondifferentiable minimax fractional programming
- Generalized \(\alpha \)-univexity and duality for nondifferentiable minimax fractional programming
- Sufficiency criteria and duality in complex nonlinear programming involving pseudoinvex function
- scientific article; zbMATH DE number 5665898 (Why is no real title available?)
- scientific article; zbMATH DE number 3918106 (Why is no real title available?)
- scientific article; zbMATH DE number 3936949 (Why is no real title available?)
- scientific article; zbMATH DE number 20895 (Why is no real title available?)
- scientific article; zbMATH DE number 1343521 (Why is no real title available?)
- scientific article; zbMATH DE number 222438 (Why is no real title available?)
- Extension to sufficient optimality conditions in complex programming
- Optimality conditions for nondifferentiable minimax programs and vector optimization problems
- (G, V)-invexity nondifferentiable generalized minimax fractional programming
- Complex minimax programming under generalized type-I functions
- Second-order duality for nondifferentiable minimax programming involving generalized type I functions
This page was built for publication: Pseudoconvex complex minimax programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5936385)