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

Polish and Ukrainian foresight into the directions for the innovation of power plants

The main aim of this article is to present an approach to planning the implementation of innovative technologies and introducing strategical modernization into power plants using the results of two foresight studies cond...

Decisions involving databases, fuzzy databases and codatabases

The authors consider the following three ways of decision making: (i) decisions involving databases by means of standard tools of sequential logic and universal algebra; (ii) deci sions involvingfuzzy databases by means...

Modelling the steady state of sewage networks as a support tool for their planning and analysis

Fundamental questions connected with the modelling of communal sewage networks have been considered and formulas used to model the functioning of the basic network have been analyzed. The problem described concerns gravi...

Robust bi-level optimization for an opportunistic supply chain network design problem in an uncertain and risky environment

This paper introduces the problem of designing a single-product supply chain network in an agile manufacturing setting under a vendor managed inventory (VMI) strategy to seize a new market oppor-tunity. The problem addre...

Modeling the process of purchase payment as a constituent of information security in e-commerce

A mathematical model of the process of payment for purchases in an online store has been pre-sented. The model belongs to the class of semi-open queueing networks with four phases of exponential servers and Poisson arriv...

Download PDF file
  • EP ID EP455322
  • DOI 10.5277/ord180201
  • Views 38
  • 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