Upper bounds and approximate solutions for multidisk problems

Approximate solutions of multiobjective H/sup infinity /-optimization problems, also referred to as multidisk problems, are considered. The main result is an algorithm that makes it possible to compute an upper bound for linear two-disk problems and also a (suboptimal) controller that achieves this bound. The algorithm involves some graphical techniques which can also be used to demonstrate explicitly the design tradeoffs inherent in problems involving competing objectives. The results can be generalized to multidisk problems.<
>