Studies on optimum-path ratios in multicriteria De Novo programming problems

Abstract This paper proposes several optimum-path ratios for enforcing different budget levels of resources so as to find alternative optimal system designs for solving multicriteria De Novo programming problems. Then, the study of optimum-path ratios is applied to solve an optimal pattern matching problem which is formulated by the De Novo programming with a given initial budget level and an optimal pattern preferred by the decision maker. An interactive algorithm is developed to continuously reshape the problem for matching the optimal pattern. A numerical example is also used to illustrate the algorithm.