Solving linear fractional multilevel programs
Journal Title: Operations Research and Decisions - Year 2014, Vol 24, Issue 1
Abstract
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.
Authors and Affiliations
Shifali Bhargava
Keywords
Related Articles
- EP ID EP166770
- DOI -
- Views 39
- Downloads 0
Choosing what to protect when attacker resources and asset valuations are uncertain
The situation has been modelled where the attacker’s resources are unknown to the defender. Protecting assets presupposes that the defender has some information on the attacker’s resource capabilities. An attacker target...
Solving some deterministic finite horizon inventory models
Two single-item, deterministic, continuous, finite horizon inventory models having no shortage have been considered. A demand rate function, which is relatively general, for the item has been assumed. In the first model,...
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...
Spectral analysis of business cycles in Poland and its major trading partners
The properties of business cycles in Poland and its major trading partners have been examined. The business cycle synchronization (BCS) between Poland and other countries was studied in order to assess the impact of inte...
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...