We present a straightforward linear algebraic model of greed, based only on extensions of classical majorization and convexity theory. This gives an alternative to other models of greedy-solvable problems such as matroids, greedoids, submodular functions, etc., and it is able to express established examples of greedy-solvable optimization problems that they cannot. The linear algebraic approach is also much closer in spirit to established practice in operations research and numerical… CONTINUE READING