Other Multi-level Programming Algorithms
Although not as efficient, some of the algorithms discussed in the last chapter also can be extended or modified for solving more complicated problems such as MLDPP, MLPP, quadratic MLPP, and even non-linear BLPP. In fact, several algorithms discussed in Chapter 2 were formulated for solving quadratic or linear-quadratic problems. Furthermore, to solve non-linear and discrete problems, heuristic approaches such as descend or gradient approach, branch-and-bound technique, and cutting-plane algorithm have been developed. The use of the more recently developed evolutionary approaches, such as genetic algorithms, tabu search, and simulated annealing have also been proposed. Some of these algorithms will be discussed in this chapter.
KeywordsTabu Search Complementary Slackness Inducible Region Linear Complementary Problem
Unable to display preview. Download preview PDF.