This monograph is aimed at presenting a smooth and unified transition from the general
fractional programming (or program) to the semi-infinite fractional programming (or …

This work is included in the search of optimality conditions for solutions to the scalar interval
optimization problem, both constrained and unconstrained, by means of second-order …

A higher-order dual for a non-differentiable minimax fractional programming problem is
formulated. Using the generalized higher-order η-convexity assumptions on the functions …

In this paper, we study a nondifferentiable minimax fractional programming problem under
the assumptions of generalized second order (ℱ, 𝛼, 𝜌, 𝑑)− convexity. A second order …

In this paper, three approaches given by Dinklebaeh (Manag Sci 13 (7): 492–498, 1967)
and Jagannathan (Z Oper Res 17: 618–630, 1968) for both primal and mixed type dual of a …

In this paper, we concentrate our study to derive appropriate duality theorems for two types
of second-order dual models of a nondifferentiable minimax fractional programming problem …

Semi-infinite minimax fractional programming problems with both inequality and equality
constraints are considered. The sets of parametric saddle point conditions are established …

Duality for semi-infinite programming problems involving ( H p , r ) -invex functions | Journal of
Inequalities and Applications Skip to main content SpringerLink Account Menu Find a journal …

We focus our study on a discussion of duality relationships of a minimax fractional
programming problem with its two types of second‐order dual models under the second …

The aim of this work is to study optimality conditions for nonsmooth minimax programming
problems involving locally Lipschitz functions by means of the idea of convexifactors that has …