Branch and bound algorithm for discrete multi- level linear fractional programming problem

Journal Title: Operations Research and Decisions - Year 2018, Vol 28, Issue 2

Abstract

An algorithm is proposed to find an integer solution for bilevel linear fractional programming problem with discrete variables. The method develops a cut that removes the integer solutions which are not bilevel feasible. The proposed method is extended from bilevel to multilevel linear fractional programming problems with discrete variables. The solution procedure for both the algorithms is elucidated in the paper.

Authors and Affiliations

Ritu ARORA, Kavita GUPTA

Keywords

Related Articles

Determining an estimate of an equivalence relation for moderate and large sized sets

This paper presents two approaches to determining estimates of an equivalence relation on the basis of pairwise comparisons with random errors. Obtaining such an estimate requires the solution of a discrete programming p...

A one-pass heuristic for nesting problems

A two-dimensional cutting (packing) problem with items of irregular shape and rectangular sheets is studied. Three types of problems are considered: single-sheet problems without restrictions on the number of elements, s...

Review of modelling approaches for healthcare simulation

The goal of this paper is to present a summary of various simulation methods applied to health services and to discuss several internal and external determinants for selecting a particular simulation method to study a gi...

The optimal portfolio under VaR and ES

An analysis of the dependence structure among certain European indices (FTSE100, CAC40, DAX30, ATX20, PX, BUX and BIST) has been conducted. The main features of the financial data were studied: asymmetry, fat-tailedness...

Choquet integral calculus on a continuous support and its applications

The results of the calculation of the Choquet integral of a monotone function on the nonnegative real line have been described. Next, the authors prepresented Choquet integral of nonmonotone functions, by constructing mo...

Download PDF file
  • EP ID EP455322
  • DOI 10.5277/ord180201
  • Views 49
  • Downloads 0

How To Cite

Ritu ARORA, Kavita GUPTA (2018). Branch and bound algorithm for discrete multi- level linear fractional programming problem. Operations Research and Decisions, 28(2), 5-21. https://europub.co.uk/articles/-A-455322