Solving a Fully Rough Integer Linear Fractional Programming Problem
Ammar, E., El jerbi, T. (2019). Solving a Fully Rough Integer Linear Fractional Programming Problem. EKB Journal Management System, 40(1), 46-58. doi: 10.21608/djs.2019.139195
El-Saeed Ammar; Tarek El jerbi. "Solving a Fully Rough Integer Linear Fractional Programming Problem". EKB Journal Management System, 40, 1, 2019, 46-58. doi: 10.21608/djs.2019.139195
Ammar, E., El jerbi, T. (2019). 'Solving a Fully Rough Integer Linear Fractional Programming Problem', EKB Journal Management System, 40(1), pp. 46-58. doi: 10.21608/djs.2019.139195
Ammar, E., El jerbi, T. Solving a Fully Rough Integer Linear Fractional Programming Problem. EKB Journal Management System, 2019; 40(1): 46-58. doi: 10.21608/djs.2019.139195

Solving a Fully Rough Integer Linear Fractional Programming Problem

Delta Journal of Science
Article 6, Volume 40, Issue 1, June 2019, Page 46-58  XML PDF (1.96 MB)
Document Type: Research and Reference
DOI: 10.21608/djs.2019.139195
View on SCiNiTO View on SCiNiTO
Authors
El-Saeed Ammar; Tarek El jerbi*
Department of mathematics, Faculty of science. Tanta University
Abstract
In this paper, a fully rough integer linear fractional programming
problem is introduced, in which all coefficients and decision variables
in the objective function and the constraints are rough intervals. The
optimal value of decision rough variables is rough interval. In order to
solve this problem, we will construct four crisp integer linear fractional
programming problems. Via these four crisp problems the rough
optimal integer solution is obtained. An illustrative numerical example
is given for the developed theory.
Keywords
Integer programming; Fractional programming; Integer linear fractional programming; Rough set theory; Rough integer interval
Statistics
Article View: 94
PDF Download: 308