Abstract
The general multilevel programming problem is a set of nested optimization problems over a single feasible region. Control over the decision variables is partitioned among ordered levels within a hierarchical structure. The two-level resource control problem is a special case where the level-two planner controls the effective resource space for the level-one planner. This produces a solution structure with the feasible region viewed by level-two planner as a nonconvex subset of the overall feasible region. In this paper, we will develop an algorithm to solve this problem. Computational results are presented. © 1983 Taylor and Francis Group, LLC.