Abstract
In this paper, we present a modification of the traditional linear trilevel Kth-Best algorithm. The proposed modified Kth-Best algorithm considers the linear trilevel programming problems in which the middle level and the lower level problems are unbounded or their objective functions are inconsistant. These cases are not considered in the trilevel Kth-Best algorithm proposed by Zhang et al. Moreover, we discuss some geometric properties of a linear trilevel programming problem wherein each decision maker might have his (her) own restrictions and the upper level objective function contain lower level variables. Finally, a number of numerical examples are presented and the results are verified as well.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
