On minimax fractional programming problems involving generalized (Hp, r)-Invex functions

  • Anurag Jayswal*
  • , Ashish Kumar Prasad
  • , Izhar Ahmad
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

In the present paper, we move forward in the study of minimax fractional programming problem and establish sufficient optimality conditions under the assumptions of generalized (Hp, r)-invexity. Weak, strong and strict converse duality theorems are also derived for two types of dual models related to minimax fractional programming problem involving aforesaid invex functions. In order to show the existence of introduced class of functions, examples are given.

Original languageEnglish
Pages (from-to)1001-1018
Number of pages18
JournalJournal of Industrial and Management Optimization
Volume10
Issue number4
DOIs
StatePublished - Oct 2014

Keywords

  • (H, r)-invexity
  • Duality
  • Minimax fractional programming
  • Sufficiency

ASJC Scopus subject areas

  • Business and International Management
  • Strategy and Management
  • Control and Optimization
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'On minimax fractional programming problems involving generalized (Hp, r)-Invex functions'. Together they form a unique fingerprint.

Cite this