This paper discusses theory and algorithms for two-level decision problems such as Stackelberg, Min-Max, General Resource Allocation, Optimization-Satisfaction, and Multi-Objective Decision Problems, all of which are characterized by plural objectives and a parametric approach. These decision problems are represented by a hierarchical optimization, where a part of constraints in the upper-level problem consists of constrained parametric optimization ones in the lower level. New computational methods are proposed based on the theory of penalty function method
Read full abstract