Non-differentiable minimax fractional programming with higher-order type I functions

G. Muhiuddin*, Abdullah M. Al-roqi, I. Ahmad

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

In this article, we are concerned with a class of non-differentiable minimax fractional programming problems and their higher-order dual model. Weak, strong and converse duality theorems are discussed involving generalized higher-order type I functions. The presented results extend some previously known results on non-differentiable minimax fractional programming.

Original languageEnglish
Article number484
JournalJournal of Inequalities and Applications
Volume2013
DOIs
StatePublished - Nov 2013

Bibliographical note

Funding Information:
This work was partially supported by the Deanship of Scientific Research Unit,University of Tabuk, Tabuk, Kingdom of Saudi Arabia. The authors are grateful tothe anonymous referee for a careful checking of the details and for helpfulcomments that improved this paper.

ASJC Scopus subject areas

  • Analysis
  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Non-differentiable minimax fractional programming with higher-order type I functions'. Together they form a unique fingerprint.

Cite this