Generalized α-univexity and duality for nondifferentiable minimax fractional programming

S. K. Mishra, R. P. Pant, J. S. Rautela

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)

Abstract

The aim of the present paper is to study a nondifferentiable minimax fractional programming problem under the assumptions of α-univex and related functions. In this paper we introduce the concepts of α-univex, pseudo α-univex, strict pseudo α-univex and quasi α-univex functions respectively by unifying the notions of α-invex and univex functions. We derive Karush-Kuhn-Tucker-type sufficient optimality conditions and establish weak, strong and converse duality theorems for the problem and its three different dual problems. The results in this paper extend several known results in the literature.

Original languageEnglish
Pages (from-to)144-158
Number of pages15
JournalNonlinear Analysis, Theory, Methods and Applications
Volume70
Issue number1
DOIs
Publication statusPublished - 1 Jan 2009
Externally publishedYes

Keywords

  • Duality
  • Generalized convexity
  • Nondifferentiable minimax fractional programming problems
  • Sufficient optimality conditions
  • α-univexity

ASJC Scopus subject areas

  • Analysis
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Generalized α-univexity and duality for nondifferentiable minimax fractional programming'. Together they form a unique fingerprint.

Cite this