| Article ID: | iaor20001121 |
| Country: | China |
| Volume: | 18 |
| Issue: | 2 |
| Start Page Number: | 159 |
| End Page Number: | 166 |
| Publication Date: | Apr 1998 |
| Journal: | Journal of Systems Science and Complexity |
| Authors: | Ruan G., Zuo X. |
In this paper a model for the linear multilevel programming problem is presented, where the permissible solution set may be unbounded, and each planner's objective may be related to the decision variables of lower levels. A necessary and sufficient condition for optimality is obtained, and the geometrical properties of each planner's feasible set are also discussed.