 
Summary: J. Appl. Math. & Informatics Vol. 26(2008), No. 5  6, pp. 991  1010
Website: http://www.kcam.biz
SUFFICIENCY AND DUALITY IN MINMAX FRACTIONAL
SUBSET PROGRAMMING INVOLVING GENERALIZED
TYPEI FUNCTIONS
I. AHMAD AND SARITA SHARMA
Abstract. A discrete minmax fractional subset programming problem is
considered. Various parametric and parameterfree global sufficient op
timality conditions and duality results are discussed under generalized
(F, , , )VtypeI nset functions.
AMS Mathematics Subject Classification : 90C30, 90C32, 90C46, 90C47
Key words and phrases : Minmax fractional subset programming; General
ized (F, , , )VtypeI nset functions; Sufficient optimality conditions;
Duality
1. Introduction
The notion of duality for generalized linear fractional programming problem
with pointfunctions was initiated by Von Neumann [10] in the context of an
economic equilibrium problem. Recently, various optimality conditions, duality
results, and computational algorithms for several classes of generalized fractional
programs have been appeared in the related literature. A fairly extensive list of
