In this paper, it is shown that by exploiting the explicit parametric state feedback solution, it is feasible to obtain the ultimate solution to minimum sensitivity problem. A numerical algorithm for construction of a robust state feedback in eigenvalue assignment problem for a controllable linear system is presented. By using a generalized parametric vector companion form, the problem of eigen...

This paper presents two recurrent neural networks for solving the assignment problem. Simplifying the architecture of a recurrent neural network based on the primal assignment problem, the first recurrent neural network, called the primal assignment network, has less complex connectivity than its predecessor. The second recurrent neural network, called the dual assignment network, based on the ...

 We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...

In this brief note we consider rank aggregation, a popular method in voting theory, social choice, business decisions etc. Mathematically the problem is to find a permutation – viewed as a vector – that minimizes the sum of the `1-distances to a given family of permutations. The problem may be solved as an assignment problem and we establish several properties of optimal solutions in this problem.

Proof of Theorem 3.3: The proof of the first part of the theorem is similar to that of Theorem 3.1, and is omitted. Next, we prove the second part of the theorem. Suppose that the state estimator (5) with 1G given by (6) is a nonfragile quadratic guaranteed cost estimator with cost matrix Q 0 , then from Lemma 3E, (31) and (44) hold for some

the problem of pole assignment, also known as an eigenvalue assignment, in linear discrete-time periodic systems in discs was solved by a novel method which employs elementary similarity operations. the former methods tried to assign the points inside the unit circle while preserving the stability of the discrete time periodic system. nevertheless, now we can obtain the location of eigenvalues ...