Title of article
On duality theorems for a nondifferentiable minimax fractional programming
Author/Authors
Lai، نويسنده , , H.C. and Lee، نويسنده , , J.C.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
12
From page
115
To page
126
Abstract
The optimality conditions of [Lai et al. (J. Math. Anal. Appl. 230 (1999) 311)] can be used to construct two kinds of parameter-free dual models of nondifferentiable minimax fractional programming problems which involve pseudo-/quasi-convex functions. In this paper, the weak duality, strong duality, and strict converse duality theorems are established for the two dual models.
Keywords
minimax fractional problem , Pseudo-convex , Quasi-convex , Duality , Polyhedral cone
Journal title
Journal of Computational and Applied Mathematics
Serial Year
2002
Journal title
Journal of Computational and Applied Mathematics
Record number
1551865
Link To Document