On nondifferentiable minimax semi-infinite programming problems in complex spaces-Reference-Cited by-同舟云学术

On nondifferentiable minimax semi-infinite programming problems in complex spaces

Published:2016-09-01 Issue:3 Volume:23 Page:367-380
ISSN:1572-9176
Container-title:Georgian Mathematical Journal
language:
Short-container-title:

Author:

Jayswal Anurag¹,Kummari Krishna²

Affiliation:

1. 1Department of Applied Mathematics, Indian School of Mines, Dhanbad-826 004, Jharkhand, India

2. 2Department of Applied Mathematics, Indian School of Mines, Dhanbad-826 004, Jharkhand, India

Abstract

AbstractThe purpose of this paper is to study a nondifferentiable minimax semi-infinite programming problem in a complex space. For such a semi-infinite programming problem, necessary and sufficient optimality conditions are established by utilizing the invexity assumptions. Subsequently, these optimality conditions are utilized as a basis for formulating dual problems. In order to relate the primal and dual problems, we have also derived appropriate duality theorems.

Funder

University Grant Commission, New Delhi, India

Publisher

Walter de Gruyter GmbH

Subject

General Mathematics

Link

https://www.degruyter.com/downloadpdf/journals/gmj/23/3/article-p367.xml

Reference34 articles.

1. A class of nondifferentiable complex programming problems;Math. Operationsforsch. Statist.,1975

2. Higher-order duality in nondifferentiable minimax programming with generalized type I functions;J. Optim. Theory Appl.,2009

3. Second-order duality in nondifferentiable minmax programming involving type-I functions;J. Comput. Appl. Math.,2008

4. Second-order duality in nondifferentiable minmax programming involving type-I functions;J. Comput. Appl. Math.,2008

5. A duality theory for convex programs with convex constraints;Bull. Amer. Math. Soc.,1962