Solving Multi-level Multi-objective Fractional Programming Problem with Rough Intervals in the Objective Functions

Mohamed S. Osman

El Asher University, 10th of Ramadan City, Egypt.

Kamal R. Raslan

Department of Mathematics, Faculty of Science, Al-Azhar University, Nasr-City, Cairo, Egypt.

Osama E. Emam

Department of Information Systems, Faculty of Computers and Information, Helwan University, P.O.Box 11795, Egypt.

Farahat A. Farahat *

Higher Technological Institute, 10th of Ramadan City, Egypt.

*Author to whom correspondence should be addressed.


Abstract

In this paper multi-level multi-objective fractional programming problem (ML-MOFP) is considered where some or all of its coefficients in the objective function are rough intervals. At the first phase of the solution approach and to avoid the complexity of the problem, two FP problems with interval coefficients will be constructed. One of these problems was a FP problem where all of its coefficients are lower approximations of the rough intervals and the other problem was a FP problem where all of its coefficients are upper approximations of rough intervals. At the second phase, a membership function was constructed to develop a fuzzy goal programming model for obtaining the satisfactory solution of the multi-level multi-objective fractional programming problem. The linearization process introduced by Pal et al. [1] will be applied to linearize the membership functions.. Finally, a numerical example will be introduced to illustrate the theoretical results.

Keywords: Multi-level programming, Multi-objective programming, fractional programming, rough intervals programming, Fuzzy goal programming.


How to Cite

Osman, Mohamed S., Kamal R. Raslan, Osama E. Emam, and Farahat A. Farahat. 2017. “Solving Multi-Level Multi-Objective Fractional Programming Problem With Rough Intervals in the Objective Functions”. Journal of Advances in Mathematics and Computer Science 21 (2):1-17. https://doi.org/10.9734/BJMCS/2017/30626.

Downloads

Download data is not yet available.