An approach for eigenvalue assignment in linear descriptor systems via output feedback is proposed. Sufficient conditions in order that a given set of eigenvalues is assignable are established. Parametric form of the desired output feedback gain matrix is also given. The approach assigns the full number of generalised eigenvalues, guarantees the closed-loop regularity and overcomes the defects ...

This paper investigates common (slack) due-date assignment single-machine scheduling with controllable processing times within a group technology environment. Under linear and convex resource allocation functions, the cost function minimizes (including weighted sum of earliness, tardiness, assignment, where weights are position-dependent) resource-allocation costs. Given some optimal properties...

Given a set S of n radio-stations located on a d-dimensional space, a source node s (∈ S) and an integer h (1 h n − 1), the h-hop broadcast range assignment problem deals with assigning ranges to the members in S so that s can communicate with all other members in S in at most h-hops, and the total power consumption is minimum. The problem is known to be NP-hard for d 2. We propose an O(n2) tim...

We examine the basis structure of the linear relaxation of the generalized assignment problem. The basis gives a surprising amount of information. This leads to a very simple heuristic that uses only generalized network optimization codes. Lower bounds can be generated by cut generation, where the violated inequalities are found directly from the relaxation basis. An improvement heuristic with ...

This paper introduces a notion of partial type assignment on left linear applicative term rewriting systems that is based on the extension defined by Mycroft of Curry’s type assignment system. The left linear applicative TRS we consider are extensions to those suggested by most functional programming languages in that they do not discriminate against the varieties of function symbols that can b...

The problem of pole assignment by state feedback in the class of non-square linear systems is considered in the paper. It is shown that the problem is solvable under the assumption of weak regularizability, a newly introduced concept that can be viewed as a generalization of the regularizability of square systems. Necessary conditions of solvability for the problem of pole assignment are establ...