Specific subset effective option in technology design decisions

Abstract

The article deals with the theoretical aspects of effective allocation of subsets of the valid options sets in
technology making design decisions. As a result of analysis of the current state of the problem revealed that due to the combinatorial
nature of most tasks synthesis number of alternative solutions dramatically increases with the dimension of design problems. The
vast majority of options is ineffective. They can be improved at the same time on all the quality parameters. This leads to the need to
develop methods for the isolation procedures subsets of effective design solutions tailored to the features of the original sets, as the
complexity of the requirements and the accuracy of the solution. To meet the challenges of various dimensions on convex and nonconvex set of feasible options to choose the exact and approximate methods based on pair-wise analysis of the options, theorems
Karlin and Germeyer. To reduce the time complexity problem solutions proposed methods of pre-allocate a plurality of approximate
methods effective solutions “sector” and “segment”. According to the analysis method estimates the computational complexity as a
function of the dimension of the original set of alternatives and the amount of local optimization criteria established that the
selection of sets of effective solutions of approximate the original set of alternatives at high power always is appropriate. This can
significantly reduce the complexity of solving the decision-making tasks without loss of effective alternatives. The analysis time
complexity methods revealed that the most efficient for large-scale problems is to use a scheme based on a modified method
“segment”. The results are recommended to be used in the procedures for multifactor solutions in the design and management
systems. Their use will improve the degree of automation of processes