Deterministic solution approach for some classes of nonlinear multilevel programs with multiple followers (Q1675573)

This paper reformulates some classes of multilevel programs with multiple followers as an equivalent multilevel program having single follower at each decision level in the hierarchy. The resulting multilevel program with single follower at each level may have non-convex formulation even if each of the followers are convex with respect to their own decision variables. The authors propose a solution approach to the reformulated multilevel programming problem, and it is illustrated by some numerical examples with polyhedral constraints at each level of the hierarchy.