On duality theorems for a nondifferentiable minimax fractional programming

  • Authors:
  • H. C. Lai;J. C. Lee

  • Affiliations:
  • Department of Mathematics, Chung Yuan Christian University, Chung Li 320, Taiwan;Department of Mathematics, Chung Yuan Christian University, Chung Li 320, Taiwan

  • Venue:
  • Journal of Computational and Applied Mathematics - Special issue: Papers presented at the 1st Sino--Japan optimization meeting, 26-28 October 2000, Hong Kong, China
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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.