Two Kinds Of Multi-level Programming

The structure with upper and follower relationship is called hierarchy. Inpractice, there are lots of hierarchical decision-making systems. For this sake,multilevel programming has caught people's attention. As the basic model inmultilevel programming, linear bileve programming has already many importantachievement. Based on the result that a optimal solution to linear bileve pro-gramming occurs at the extreme point of its constraint regain, we use adjacentextreme point to get the cutting plane to solve this kind problem with the simplemethod and duality theory.This paper is divided into 5 parts. In the first part, we introduce the de-velopment and application of the multilevel programming, summarize some mainthoughts and methods . In the second chapter, we introduce some knowledgewhich we'll use after. In the third chapter, we study the geometric propertiesof linear bileve programming and give an algorithm and some numerical experi-ments. In the forth chapter, we study the geometric properties of linear trileveprogramming. At last, the paper is concluded.