Affordable Access

Optimality and duality for minimax fractional programming with support function under [formula omitted]-convexity

Authors
Journal
Journal of Computational and Applied Mathematics
0377-0427
Publisher
Elsevier
Publication Date
Volume
274
Identifiers
DOI: 10.1016/j.cam.2014.06.025
Keywords
  • Generalized Convexity
  • Minimax Fractional Programming
  • Support Function
  • Sufficiency
  • Duality
Disciplines
  • Computer Science
  • Mathematics

Abstract

Abstract Sufficient optimality conditions are established for a class of nondifferentiable generalized minimax fractional programming problem with support functions. Further, two dual models are considered and weak, strong and strict converse duality theorems are established under the assumptions of (C,α,ρ,d)-convexity. Results presented in this paper, generalizes several results from literature to more general model of the problems as well as for more general class of generalized convexity.

There are no comments yet on this publication. Be the first to share your thoughts.