An additive eigenvalue problem of physics related to linear programming (Q1099930): Difference between revisions

Starting from a functional equation for the ground state energy per atom by R. B. Griffiths a discrete approximation of this equation by \(\min_{j=1,...,n}(K_{ij}+x_ j)=\lambda +x_ i,\) \(i=1,...,n\) is investigated. Here \(K_{ij}\) is taken to be an arbitrary real square matrix. \(\lambda\) is termed an additive eigenvalue and x is termed an additive eigenvector. This additive eigenvalue equation had previously arisen in an entirely different area-management science. A motivation problem was cost efficient scheduling of industrial processes. Brouwers fixed point theorem is used to show that a solution exists, that the eigenvalue is unique, but possibly there is more than one associated eigenvector. It is then shown that this equation can be solved by two linear programs. The first program has maximum value \(\lambda\). Then the second linear program furnishes a corresponding eigenvector.