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
- EP ID EP455322
- DOI 10.5277/ord180201
- Views 48
- Downloads 0
The impact of weights on the quality of agricultural producers' multicriteria decision models
Decisions regarding agricultural production involve multiple goals. A multicriteria approach al-lows decision makers to consider more aspects of the decision scenario, although it also leads to other problems, such as di...
Factors affecting the result of matches in the one day format of cricket
Factors contributing to winning games are imperative, as the ultimate objective in a game is vic-tory. The aim of this study was to identify the factors that characterize the game of cricket, and to investigate the facto...
Forecast value added (FVA) analysis as a means to improve the efficiency of a forecasting process
A praxeological approach has been proposed in order to improve a forecasting process through the employment of the forecast value added (FVA) analysis. This may be interpreted as a manifestation of lean management in for...
A multifaceted analysis of the electoral system of the Republic of Suriname
The electoral system of Suriname has been analyzed. Suriname has a unicameral parliament, the National Assembly. The 51 seats of the National Assembly are distributed among 10 districts. There are large discrepancies bet...
Branch and bound algorithm for discrete multi- level linear fractional programming problem
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....