Polynomial algorithms for LP over a subring of the algebraic integers with applications to LP with circulant matrices (Q687079)

This is a discussion of polynomial algorithms for linear programming with particular reference to constraint matrices which are circulant matrices; that is, matrices of the type: \[ \left[\begin{matrix} A_ 0\quad & A_ 1\;&\cdots\;& A_{n-2}\quad &A_{n-1}\\ A_{n-1}\quad & A_ 0\;&\cdots\;& A_{n-3}\quad & A_{n-2}\\ \vdots\quad &\vdots\;&\;&\quad &\vdots\\ A_ 1\quad & A_ 2\;&\cdots\;& A_{n-1}\quad& A_ 0\end{matrix}\right] \] There is some discussion of practical problems associated with matrices of this type.