Mathematical Programming

, Volume 62, Issue 1–3, pp 1–14

Series parallel composition of greedy linear programming problems

  • Wolfgang W. Bein
  • Peter Brucker
  • Alan J. Hoffman
Article

DOI: 10.1007/BF01585157

Cite this article as:
Bein, W.W., Brucker, P. & Hoffman, A.J. Mathematical Programming (1993) 62: 1. doi:10.1007/BF01585157

Abstract

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.

Key words

Greedy algorithm Monge arrays series parallel graphs linear programming network flow transportation problem integrality convexity 

Copyright information

© The Mathematical Programming Society, Inc. 1993

Authors and Affiliations

  • Wolfgang W. Bein
    • 1
  • Peter Brucker
    • 2
  • Alan J. Hoffman
    • 3
  1. 1.American Airlines Decision TechnologiesDallas/Fort Worth AirportUSA
  2. 2.Fachbereich Mathematik/InformatikUniversität OsnabrückGermany
  3. 3.Department of Mathematical ScienceIBM Thomas J. Watson Research CenterYorktown HeightsUSA

Personalised recommendations