- Tytuł:
- Branch and bound algorithm for discrete multi- level linear fractional programming problem
- Autorzy:
-
Arora, R.
Gupta, K. - Powiązania:
- https://bibliotekanauki.pl/articles/406478.pdf
- Data publikacji:
- 2018
- Wydawca:
- Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
- Tematy:
-
linear fractional programming problem
bilevel programming
multilevel programming
discrete variables
integer solution
branch and bound cut
programowanie dwustopniowe
programowanie wielopoziomowe
zmienne dyskretne - Opis:
- 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.
- Źródło:
-
Operations Research and Decisions; 2018, 28, 2; 5-21
2081-8858
2391-6060 - Pojawia się w:
- Operations Research and Decisions
- Dostawca treści:
- Biblioteka Nauki
Artykuł