Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
J. Appl. Math. & Informatics Vol. 26(2008), No. 5 -6, pp. 991 -1010 Website: http://www.kcam.biz
 

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
TYPE-I FUNCTIONS
I. AHMAD AND SARITA SHARMA
Abstract. A discrete minmax fractional subset programming problem is
considered. Various parametric and parameter-free global sufficient op-
timality conditions and duality results are discussed under generalized
(F, , , )-V-type-I n-set functions.
AMS Mathematics Subject Classification : 90C30, 90C32, 90C46, 90C47
Key words and phrases : Minmax fractional subset programming; General-
ized (F, , , )-V-type-I n-set functions; Sufficient optimality conditions;
Duality
1. Introduction
The notion of duality for generalized linear fractional programming problem
with point-functions 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

  

Source: Ahmad, Izahr - Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals

 

Collections: Mathematics