Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions
type: Item
instance of: scholarly article
title: Nondifferentiable minimax programming problems in complex spaces involving generalized convex functions
zbMATH Open document ID: 1327.90380
DOI: 10.1155/2013/297015
author: Anurag Jayswal
author: Ashish Kumar Prasad
author: Krishna Kummari
published in: Journal of Optimization
publication date: 2015-12-11T00:00:00Z
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.
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6519545
Wikidata QID: Q59020028
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2013/297015
OpenAlex ID: W2075024816
cites work: Linear programming in complex space
cites work: 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
cites work: Optimality conditions and duality in nondifferentiable minimax fractional programming with generalized convexity
cites work: Parametric duality on minimax programming involving generalized convexity in complex space
cites work: Programming with linear fractional functionals
cites work: Optimality conditions for nondifferentiable minimax fractional programming with complex variables
cites work: Duality for nondifferentiable minimax programming in complex spaces
cites work: Second-order duality in nondifferentiable minmax programming involving type-I functions
cites work: Higher-order duality in nondifferentiable minimax programming with generalized type I functions
cites work: Symmetric duality for mathematical programming in complex spaces with \(F\)-convexity.
description: scientific article; zbMATH DE number 6519545