Mojtaba Borza

TL;DR: In the literature, there exists several approaches to address the multi-objective linear fractional programming problem (MOLFPP), however, there is a drawback to these methods as discussed by the authors.

TL;DR: In this article, a parametric approach is used to address a fractional functional programming problem with interval coefficients of the type Minimize, where minimize is defined as √ √ k1[ai,bi]xi+[ai+1,bi+1]| ∑ k 1[ci,di]xi +[ci+1 +1,di+1], subject to √ ax ≥ b,x ≥ 0 subject to ax≤b,x≥ 0

TL;DR: In this article, two approaches were introduced to obtain Stackelberg solutions for two-level linear fractional programming problems with interval coefficients in the objective functions, which were based on the Kth best method and the method for solving fractional programs with intervals.

TL;DR: In this article, the authors considered a fractional functional programming problem with interval coefficients of the type (i.e., interval coefficient of the interval coefficient is the interval of a function).