On Higher-order Duality in Nondifferentiable Minimax Fractional Programming

Suliman Saleh Al-Homidan; V Singh; Izhar Mohammad Gufran Ahmad

On Higher-order Duality in Nondifferentiable Minimax Fractional Programming

Research output: Contribution to journal › Article › peer-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 language	English
Journal	PRAIRIE VIEW A & M UNIV, DEPT MATHEMATICS
State	Published - 2020

Cite this

@article{26b43030277e445cb46d81c8b9255716,

title = "On Higher-order Duality in Nondifferentiable Minimax Fractional Programming",

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.",

author = "Al-Homidan, \{Suliman Saleh\} and V Singh and Ahmad, \{Izhar Mohammad Gufran\}",

year = "2020",

language = "English",

}

TY - JOUR

T1 - On Higher-order Duality in Nondifferentiable Minimax Fractional Programming

AU - Al-Homidan, Suliman Saleh

AU - Singh, V

AU - Ahmad, Izhar Mohammad Gufran

PY - 2020

Y1 - 2020

N2 - 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.

AB - 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.

M3 - Article

SN - 1932-9466

JO - PRAIRIE VIEW A & M UNIV, DEPT MATHEMATICS

JF - PRAIRIE VIEW A & M UNIV, DEPT MATHEMATICS

ER -

On Higher-order Duality in Nondifferentiable Minimax Fractional Programming

Abstract

Fingerprint

Cite this