Title: Minmax programming problems with (p, r) - ρ - (η, θ)-invexity

Authors: P. Mandal; C. Nahak

Addresses: Department of Mathematics, Indian Institute of Technology Kharagpur, Kharagpur 721302, India ' Department of Mathematics, Indian Institute of Technology Kharagpur, Kharagpur 721302, India

Abstract: In this paper, we establish the sufficient optimality conditions for minmax programming and generalized fractional minmax programming problems. Based on the sufficient conditions, a duality model is constructed and duality results are derived under a new type of generalised invexity assumption, called (p, r) - ρ - (η, θ)-invexity. Our study extends some of the previously known results in the framework of generalised invexity and duality models. We also provide some examples to illustrate our work.

Keywords: generalised invexity assumption; minmax programming; minmax fractional programming; Schaible dual; weak converse duality; strong converse duality; strict converse duality; optimality conditions.

DOI: 10.1504/IJMOR.2013.050516

International Journal of Mathematics in Operational Research, 2013 Vol.5 No.1, pp.121 - 143

Published online: 31 Mar 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article