Linear programming with matrix variables

AbstractLinear programming is formulated with the vector variable replaced by a matrix variable, with the inner product defined using trace of a matrix. The theorems of Motzkin, Farkas (both homogeneous and inhomogeneous forms), and linear programming duality thus extend to matrix variables. Duality theorems for linear programming over complex spaces, and over quaternion spaces, follow as special cases