Second-order duality for minimax fractional programming involving generalised Type-I functions

Abstract

A class of minimax fractional programming problem and its two types of second-order dual models are considered with an establishment of weak, strong and strict converse duality theorems from a view point of generalised convexity. Some previously known results in the framework of generalised convexity are naturally unified and extended.

Keywords

• minimax fractional programming
• second-order duality
• Type-I functions
• generalised convexity