Duality in nondifferentiable minimax fractional programming with B-(p, r)- invexity

In this article, we are concerned with a nondifferentiable minimax fractional programming problem. We derive the sufficient condition for an optimal solution to the problem and then establish weak, strong, and strict converse duality theorems for the problem and its dual problem under B -( p , r )-i...

Full description

Saved in:
Bibliographic Details
Published inJournal of inequalities and applications Vol. 2011; no. 1; pp. 1 - 14
Main Authors Ahmad, Izhar, Gupta, SK, Kailey, N, Agarwal, Ravi P
Format Journal Article
LanguageEnglish
Published Cham Springer International Publishing 30.09.2011
Springer Nature B.V
BioMed Central Ltd
SpringerOpen
Subjects
Analysis
Applications of Mathematics
B-(p, r)-invex function
Classification
Duality theorem
duality theorems
Inequalities
Mathematics
Mathematics and Statistics
Minimax technique
nondifferentiable fractional programming
optimality conditions
Optimization
Programming
optimality conditions
duality theorems
,
nondifferentiable fractional programming
-
invex function
Online AccessGet full text

Cover

More Information
Summary:In this article, we are concerned with a nondifferentiable minimax fractional programming problem. We derive the sufficient condition for an optimal solution to the problem and then establish weak, strong, and strict converse duality theorems for the problem and its dual problem under B -( p , r )-invexity assumptions. Examples are given to show that B -( p , r )-invex functions are generalization of ( p , r )-invex and convex functions AMS Subject Classification: 90C32; 90C46; 49J35.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1029-242X
1025-5834
1029-242X
DOI:10.1186/1029-242X-2011-75