Issue: 2014/Vol.24/No.1, Pages 5-21


Shifali Bhargava

Full paper (PDF)    RePEC

Cite as: S. Bhargava. Solving linear fractional multi-level programs. Operations Research and Decisions 2014: 24(1), 5-21. DOI 10.5277/ord140101

The linear fractional multilevel programming (LFMP) problem has been studied and it has been proved that an optimal solution to this problem occurs at a boundary feasible extreme point. Hence the Kth-best algorithm can be proposed to solve the problem. This property can be applied to quasiconcave multilevel problems provided that the first (n – 1) level objective functions are explicitly quasimonotonic, otherwise it cannot be proved that there exists a boundary feasible extreme point that solves the LFMP problem.

Keywords: combinatorial problems, stable matching, Gale–Shapley model

Received: 27 May 2013    Accepted: 11 December 2013