Generating all linear transformations

An L1-norm method for generating all of efficient solutions of multi-objective integer linear programming problem

This paper extends the proposed method by Jahanshahloo et al. (2004) (a method for generating all the efficient solutions of a 0–1 multi-objective linear programming problem, Asia-Pacific Journal of Operational Research). This paper considers the recession direction for a multi-objective integer linear programming (MOILP) problem and presents necessary and sufficient conditions to have unbounde...

Linear Transformations

The n×m matrix AT obtained by exchanging rows and columns of A is called the transpose of A. A matrix A is said to be symmetric if A = AT . The sum of two matrices of equal size is the matrix of the entry-by-entry sums, and the scalar product of a real number a and an m× n matrix A is the m× n matrix of all the entries of A, each multiplied by a. The difference of two matrices of equal size A a...

Generating All Wigner Functions

In the context of phase-space quantization, matrix elements and observables result from integration of c-number functions over phase space, with Wigner functions serving as the quasi-probability measure. The complete sets of Wigner functions necessary to expand all phase-space functions include off-diagonal Wigner functions, which may appear technically involved. Nevertheless, it is shown here ...

On One-Sided Ideals of Rings of Linear Transformations

An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network