2013•Journal of Inequalities and ApplicationsOpen access

Second-order duality for nondifferentiable minimax fractional programming problems with generalized convexity

Meraj Ali Khan

Abstract

In the present paper, we are concerned with second-order duality for nondifferentiable minimax fractional programming under the second-order generalized convexity type assumptions. The weak, strong and converse duality theorems are proved. Results obtained in this paper extend some previously known results on nondifferentiable minimax fractional programming in the literature. MSC: 90C32, 49K35, 49N15.

Open-access reader

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Mathematics, Minimax, Convexity, Duality (order theory), Converse, Fractional programming, Strong duality, Order (exchange)