Solving Linear Fractional Multilevel Programs
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 mu...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wrocław University of Science and Technology
2014-01-01
|
| Series: | Operations Research and Decisions |
| Online Access: | http://orduser.pwr.wroc.pl/DownloadFile.aspx?aid=1066 |