Abstract:
The paper addresses the equivalence of sequential and single-shot optimization in solution of multi-criterial problems. Problems are considered where the solution goal is achieving a specified upper level by a maximal number of sequentially optimized bilaterally constrained local criteria. A single-stage solution method for this class of multi-criterial problems is proposed which insures a pre-specified smallness of deflections from the upper-bounds by the actual values of the criteria. The actual use of numerical procedures is illustrated for the case of complete and partial orderiliness of preference series for local criteria in control of sets of incomplete activities.