The trilevel Kth-best algorithm consists of the two subalgorithms: (1) the simplex algorithm, which addresses the problem of determining an optimal solution for ...

The paper we are herewith submitting is entitled “Model, Solution Concept and the Kth-. Best Algorithm for Linear Tri-level Programming” by Guangquan Zhang, Jie ...

This study first proposes a general MFTL decision model for the situation involving both cooperative and uncooperative relationships among multiple ...

Some algorithms are proposed based on penalty method [16], Kuhn-Tucker transformation [2], multi-parametric approach [5], and enumerating extreme points of ...

A tri-level programming model and a set of linear tri-level programming (LTLP) solution concepts are proposed and a Kth-best algorithm is presented to solve ...

Bi-level programming is characterized as a mathematical programming to solve decentralized problems with two decision makers in a hierarchical organization.

Zhang, Guangquan, Lu, Jie, Montero, Javier, Zeng, Yi (2010) Model, solution concept, and Kth-best algorithm for linear trilevel programming. Information ...

The proposed modified Kth-Best algorithm considers the linear trilevel programming problems in which the middle level and the lower level problems are unbounded ...

Abstract: In this paper, we present a modification of the traditional linear trilevel Kth-Best algorithm. The proposed modified Kth-Best algorithm considers ...

It then develops a MFTL Kth-Best algorithm to find an optimal solution to the model. ... Solution concept and the Kth-best algorithm for linear tri-level ...