Matrix analysis
Theory of linear and integer programming
Theory of linear and integer programming
Integer and combinatorial optimization
Integer and combinatorial optimization
A new lower bound for the quadratic assignment problem
Operations Research - Supplement
On lower bounds for a class of quadratic 0, 1 programs
Operations Research Letters
| Hi-index | 0.00 |
This paper presents a unifying perspective for analyzing certain systems of linear equations in nonnegative variables that arise in diverse areas of operations research: economic exchange models, finite Markov chains, directed graphs, and zero-one quadratic programs. Farkas' lemma is seen to play a central role in establishing general existence, uniqueness, and positivity results. A new application involving Lagrangian duality is developed.