ScholarLens Back to search
2012•American Journal of Computational MathematicsOpen access

Solving the Interval-Valued Linear Fractional Programming Problem

Sohrab Effati, Morteza Pakdaman

Open full text 38 citations

Abstract

This paper introduces an interval valued linear fractional programming problem (IVLFP). An IVLFP is a linear frac-tional programming problem with interval coefficients in the objective function. It is proved that we can convert an IVLFP to an optimization problem with interval valued objective function which its bounds are linear fractional functions. Also there is a discussion for the solutions of this kind of optimization problem.

Open-access reader

About this research paper

What this paper is about

This paper introduces an interval valued linear fractional programming problem (IVLFP). An IVLFP is a linear frac-tional programming problem with interval coefficients in the objective function. It is proved that we can convert an IVLFP to an optimization problem with interval valued objective function which its bounds are linear fractional functions. Also there is a discussion for the solutions of this kind of optimization problem.

Why it matters

OpenAlex reports 38 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper introduces an interval valued linear fractional programming problem (IVLFP). An IVLFP is a linear frac-tional programming problem with interval coefficients in the objective function. It is proved that we can convert an IVLFP to an optimization problem with interval valued objective function which its bounds are linear fractional functions. Also there is a discussion for the solutions of this kind of optimization problem.

Key concepts: Linear-fractional programming, Mathematics, Linear programming, Interval (graph theory), Fractional programming, Mathematical optimization, Function (biology), Optimization problem

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Solving the Interval-Valued Linear Fractional Programming Problem — Research Paper | ScholarLens