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

  • Izhar Ahmad*
  • , S. K. Gupta
  • , N. Kailey
  • , Ravi P. Agarwal
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

24 Scopus citations

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

Original languageEnglish
Article number75
JournalJournal of Inequalities and Applications
Volume2011
DOIs
StatePublished - 2011

Keywords

  • B-(p, r)-invex function
  • Duality theorems
  • Nondifferentiable fractional programming
  • Optimality conditions

ASJC Scopus subject areas

  • Analysis
  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Duality in nondifferentiable minimax fractional programming with B-(p, r)-invexity'. Together they form a unique fingerprint.

Cite this