Solving a Fully Rough Integer Linear Fractional Programming Problem

Document Type : Research and Reference

Authors

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

Files

Share

How to cite

Statistics