Beta
ManageSearchChatDiscover
139195

Solving a Fully Rough Integer Linear Fractional Programming Problem

Article

Last updated: 23 Jan 2023

OverviewSimilar Items

Subjects

-

Tags

-

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.

DOI

10.21608/djs.2019.139195

Keywords

integer programming, Fractional programming, Integer linear fractional programming, Rough set theory, Rough integer interval

Authors

First Name

El-Saeed

Last Name

Ammar

MiddleName

-

Affiliation

Department of mathematics, Faculty of science. Tanta University

Email

-

City

-

Orcid

-

First Name

Tarek

Last Name

El jerbi

MiddleName

-

Affiliation

Department of mathematics, Faculty of science. Tanta University

Email

-

City

-

Orcid

-

Volume

40

Article Issue

1

Related Issue

20595

Issue Date

2019-06-01

Receive Date

2021-01-13

Publish Date

2019-06-01

Page Start

46

Page End

58

Print ISSN

1012-5965

Online ISSN

2735-5306

Article File

DJS_Volume 40_Issue 1_Pages 46-58.pdf

PDF . 2.1MB

Link

https://djs.journals.ekb.eg/article_139195.html

Detail API

https://djs.journals.ekb.eg/service?article_code=139195

Order

6

Type

Research and Reference

Type Code

1,686

Publication Type

Journal

Publication Title

Delta Journal of Science

Publication Link

https://djs.journals.ekb.eg/

MainTitle

-

Details

Type

Article

Created At

23 Jan 2023