Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions

DOI10.1155/2013/297015MaRDI QIDQ896726zbMATH OpenOpenAlexWikidataFDO

Authors Anurag Jayswal, Ashish Kumar Prasad, Krishna Kummari

Publication date 11 December 2015

Published in Journal of Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2013/297015

Mathematics Subject Classification ID

Convex programming (90C25) Minimax problems in mathematical programming (90C47)

Review text

Summary: We start our discussion with a class of nondifferentiable minimax programming problems in complex space and establish sufficient optimality conditions under generalized convexity assumptions. Furthermore, we derive weak, strong, and strict converse duality theorems for the two types of dual models in order to prove that the primal and dual problems will have no duality gap under the framework of generalized convexity for complex functions.

Recommendations

• Duality for nondifferentiable minimax programming in complex spaces
• Optimality conditions for a nondifferentiable minimax programming in complex spaces
• Optimality and duality for nondifferentiable minimax fractional programming with generalized convexity
• On nondifferentiable minimax semi-infinite programming problems in complex spaces
• Duality for a class of nondifferentiable mathematical programming problems in complex space

Cites work

• A duality theorem for a special class of programming problems in complex space
• Duality for a class of nondifferentiable mathematical programming problems in complex space
• Duality for nondifferentiable minimax programming in complex spaces
• Higher-order duality in nondifferentiable minimax programming with generalized type I functions
• Linear programming in complex space
• Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity
• Optimality conditions for nondifferentiable minimax fractional programming with complex variables
• Parametric duality on minimax programming involving generalized convexity in complex space
• Programming with linear fractional functionals
• Second-order duality in nondifferentiable minmax programming involving type-I functions
• Symmetric duality for mathematical programming in complex spaces with \(F\)-convexity.

Cited in

(6)

• Optimality conditions for a nondifferentiable minimax programming in complex spaces
• Duality for a class of nondifferentiable mathematical programming problems in complex space
• On nondifferentiable minimax semi-infinite programming problems in complex spaces
• Duality for nondifferentiable minimax programming in complex spaces
• Complex analysis methods related an optimization problem with complex variables
• Parametric duality on minimax programming involving generalized convexity in complex space

This page was built for publication: Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions

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