Complex minimax programming under generalized type-I functions

DOI10.1016/J.CAMWA.2005.04.002MaRDI QIDQ814060zbMATH OpenOpenAlexFDO

Authors S. K. Mishra

Publication date 2 February 2006

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.camwa.2005.04.002

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Minimax problems in mathematical programming (90C47)

Recommendations

• scientific article; zbMATH DE number 1343521
• Complex minimax programming under generalized convexity
• Optimality and duality in complex minimax optimization under generalized \(\alpha\)-invexity
• Pseudoconvex complex minimax programming
• Optimality conditions for minimax programming of analytic functions

Cites work

• scientific article; zbMATH DE number 3856832 (Why is no real title available?)
• scientific article; zbMATH DE number 3672000 (Why is no real title available?)
• scientific article; zbMATH DE number 1343521 (Why is no real title available?)
• scientific article; zbMATH DE number 1095224 (Why is no real title available?)
• A class of nondifferentiable complex programming problems
• A duality theorem for a special class of programming problems in complex space
• A duality theorem for complex quadratic programming
• Complex Fractional Programming Involving Generalized Quasi/Pseudo Convex Functions
• Complex minimax programming under generalized convexity
• Complex nonlinear programming: Duality with invexity and equivalent real programs
• Duality for fractional complex programming with generalized convexity
• Duality for nonlinear programming in complex space
• Invex functions and their application to mathematical programming
• Linear programming in complex space
• Nondifferentiable Fractional Programming in Complex Space
• Nonlinear Complex Programming with Nonlinear Constraints
• Nonlinear complex programming
• Nonlinear programming in complex space
• Nonlinear programming in complex space: Sufficient conditions and duality
• On nonlinear programming in complex spaces
• Optimality and duality for complex nondifferentiable fractional programming
• Pseudoconvex complex minimax programming
• Sufficiency criteria and duality in complex nonlinear programming involving pseudoinvex function
• Symmetric duality for mathematical programming in complex spaces with \(F\)-convexity.
• Symmetric duality for quadratic programming in complex space

Cited in

(6)

• Second-order duality for nondifferentiable minimax programming involving generalized type I functions
• Optimality and duality in complex minimax optimization under generalized \(\alpha\)-invexity
• Generalized \(\alpha\)-invexity and nondifferentiable minimax fractional programming
• Nondifferentiable minimax fractional programming in complex spaces with parametric duality
• Generalized \(\alpha \)-univexity and duality for nondifferentiable minimax fractional programming
• Complex minimax programming under generalized convexity

This page was built for publication: Complex minimax programming under generalized type-I functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814060)