Other Multi-level Programming Algorithms

  • E. Stanley Lee
  • Hsu-shih Shih
Part of the Advanced Manufacturing book series (ADVMANUF)


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.


Tabu Search Complementary Slackness Inducible Region Linear Complementary Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London Limited 2001

Authors and Affiliations

  • E. Stanley Lee
    • 1
  • Hsu-shih Shih
    • 2
  1. 1.Department of Industrial & Manufacturing Systems EngineeringKansas State UniversityManhattanUSA
  2. 2.Graduate School of Management ScienceI-Shou UniversityTa-Hsiang, KaohsiungTaiwan

Personalised recommendations