Minimax fractional programming involving generalised invex functions

• Autores: J.C. Liu, H.C. Lai
• Localización: Anziam journal: The Australian & New Zealand industrial and applied mahtematics journal, ISSN 1446-1811, Vol. 44, Nº 3, 2003, págs. 339-354
• Idioma: inglés
• DOI: 10.1017/s1446181100008063
• Texto completo no disponible (Saber más ...)
• Resumen

  • The convexity assumptions for a minimax fractional programming problem of variational type are relaxed to those of a generalised invexity situation. Sufficient optimality conditions are established under some specific assumptions. Employing the existence of a solution for the minimax variational fractional problem, three dual models, the Wolfe type dual, the Mond-Weir type dual and a one parameter dual type, are constructed. Several duality theorems concerning weak, strong and strict converse duality under the framework of invexity are proved.