A unified constructive network model for problem-solving

We develop a neural network model that relieves time-consuming trial-and-error computer experiments usually performed in problem-solving with networks where problems, including the traveling salesman problem, pattern matching and pattern classification/learning, are formulated as optimization problems with constraint. First, we specify and uniquely distinguish the model as a set of constituent functions that should comply with restrictive conditions. Next, we demonstrate that it is unified, i.e., it yields most current networks. Finally, we verify that it is constructive, that is, we show a standard method that systematically constructs from a given optimization problem a particular network in that model to solve it.