Computational study of the multiechelon production planning problem

Sunil Chopra, M. R. Rao, Chih Yang Tsai

Research output: Contribution to journalArticlepeer-review

2 Scopus citations


In this article we try to identify appropriate solution procedures for different types of multiechelon production planning problems. We conduct an extensive computational study on uncapacitated multiechelon production planning problems with serial and assembly types of bill-of-material structures. Problems are formulated as both single-source fixed charge network problems and as multicommodity flow problems with fixed charges. Solution procedures considered are branch and cut, Lagrangean relaxation (for the network formulation), and branch and bound (for the multicommodity formulation). Three hundred problems with various problem structures are tested. Our conclusions suggest the best approach for each type of problem structure.

Original languageEnglish (US)
Pages (from-to)1-19
Number of pages19
JournalNaval Research Logistics
Issue number1
StatePublished - Feb 1997

ASJC Scopus subject areas

  • Modeling and Simulation
  • Ocean Engineering
  • Management Science and Operations Research


Dive into the research topics of 'Computational study of the multiechelon production planning problem'. Together they form a unique fingerprint.

Cite this