Second order duality for nondifferentiable minimax programming problems with generalized convexity

  • Authors:
  • Z. Husain;Anurag Jayswal;I. Ahmad

  • Affiliations:
  • Department of Mathematics, Aligarh Muslim University, Aligarh, India 202 002;Department of Applied Mathematics, Birla Institute of Technology, Extension Centre, Patna, India 800 014;Department of Mathematics, Aligarh Muslim University, Aligarh, India 202 002

  • Venue:
  • Journal of Global Optimization
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we are concerned with a class of nondifferentiable minimax programming problem and its two types of second order dual models. Weak, strong and strict converse duality theorems from a view point of generalized convexity are established. Our study naturally unifies and extends some previously known results on minimax programming.