Journal of applied mathematics & informatics
- Volume 26 Issue 5_6
- /
- Pages.991-1010
- /
- 2008
- /
- 2734-1194(pISSN)
- /
- 2234-8417(eISSN)
SUFFICIENCY AND DUALITY IN MINMAX FRACTIONAL SUBSET PROGRAMMING INVOLVING GENERALIZED TYPE-I FUNCTIONS
- Ahmad, I. (Department of Mathematics, Aligarh Muslim University) ;
- Sharma, Sarita (Department of Mathematics, Aligarh Muslim University)
- Published : 2008.09.30
Abstract
A discrete minmax fractional subset programming problem is considered. Various parametric and parameter-free global sufficient optimality conditions and duality results are discussed under generalized (
Keywords
- Minmax fractional subset programming;
- Generalized ($F,{\alpha},{\rho},{\theta}$)-V-type-I n-set functions;
- Sufficient optimality conditions;
- Duality