Series parallel composition of greedy linear programming problems
- Cite this article as:
- Bein, W.W., Brucker, P. & Hoffman, A.J. Mathematical Programming (1993) 62: 1. doi:10.1007/BF01585157
We study the concept of series and parallel composition of linear programming problems and show that greedy properties are inherited by such compositions. Our results are inspired by earlier work on compositions of flow problems. We make use of certain Monge properties as well as convexity properties which support the greedy method in other contexts.