Duality in nondifferentiable minimax fractional programming with B-p, r- invexityReport as inadecuate




Duality in nondifferentiable minimax fractional programming with B-p, r- invexity - Download this document for free, or read online. Document in PDF available to download.

Journal of Inequalities and Applications

, 2011:75

First Online: 30 September 2011Received: 06 November 2010Accepted: 30 September 2011

Abstract

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.

Keywordsnondifferentiable fractional programming optimality conditions B-p, r-invex function duality theorems Electronic supplementary materialThe online version of this article doi:10.1186-1029-242X-2011-75 contains supplementary material, which is available to authorized users.

Download fulltext PDF



Author: Izhar Ahmad - SK Gupta - N Kailey - Ravi P Agarwal

Source: https://link.springer.com/



DOWNLOAD PDF




Related documents