ScholarLens Back to search
1995•OptimizationRequires access

Multi-criteria integer linear fractional programming problem

R.K. Gupta, Raghav Malhotra

Open publisher page 14 citations

Abstract

In the present paper an algorithm, based on cutting plane approach, is developed which seeks all the efficient r-tuples to multi-criteria integer linear fractional programming problem. A single objective integer linear fractional programming problem with any one of the objectives is considered and a cutting plane technique is used to this single objective programming problem. The cut developed in the present paper scans and truncates whole of an edge of the feasible region. The numerical illustrations are included in support of the algorithm developed.

About this research paper

What this paper is about

In the present paper an algorithm, based on cutting plane approach, is developed which seeks all the efficient r-tuples to multi-criteria integer linear fractional programming problem. A single objective integer linear fractional programming problem with any one of the objectives is considered and a cutting plane technique is used to this single objective programming problem. The cut developed in the present paper scans and truncates whole of an edge of the feasible region. The numerical illustrations are included in support of the algorithm developed.

Why it matters

OpenAlex reports 14 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

In the present paper an algorithm, based on cutting plane approach, is developed which seeks all the efficient r-tuples to multi-criteria integer linear fractional programming problem. A single objective integer linear fractional programming problem with any one of the objectives is considered and a cutting plane technique is used to this single objective programming problem. The cut developed in the present paper scans and truncates whole of an edge of the feasible region. The numerical illustrations are included in support of the algorithm developed.

Key concepts: Cutting-plane method, Integer programming, Linear-fractional programming, Mathematics, Fractional programming, Linear programming, Branch and cut, Mathematical optimization

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Multi-criteria integer linear fractional programming problem — Research Paper | ScholarLens