Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Refine search results

Journals help

  1. 1 Operations Research and Decisions

Years help

  1. 1 2014

Authors help

  1. 1 BHARGAVA S.

Results found: 1

first rewind previous Page / 1 next fast forward last

Search results

Search:
in the keywords:  multilevel
help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
1
Content available remote

Solving linear fractional multilevel programs

100%
BHARGAVA S.
Operations Research and Decisions
|
2014
|
vol. 24
|
issue 1
5-21
EN
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.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.