On Higher-order Duality in Nondifferentiable Minimax Fractional Programming

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we consider a nondifferentiable minimax fractional programming problem with continuously differentiable functions and formulated two types of higher-order dual models for such optimization problem. Weak, strong and strict converse duality theorems are derived under higher-order generalized invexity.
Original languageEnglish
JournalPRAIRIE VIEW A & M UNIV, DEPT MATHEMATICS
StatePublished - 2020

Fingerprint

Dive into the research topics of 'On Higher-order Duality in Nondifferentiable Minimax Fractional Programming'. Together they form a unique fingerprint.

Cite this