EconPapers    
Economics at your fingertips  
 

Efficient Production-Distribution System Design

Samir Elhedhli () and Jean-Louis Goffin ()
Additional contact information
Samir Elhedhli: Department of Management Sciences, University of Waterloo, 200 University West, Waterloo, Ontario N2L 3G1, Canada
Jean-Louis Goffin: Faculty of Management, McGill University, 1001 Sherbrooke West, Montreal, Quebec H3A 1G5, Canada

Management Science, 2005, vol. 51, issue 7, 1151-1164

Abstract: The production-distribution system design is an integral part of the general supply chain design. This paper proposes a novel solution methodology for this problem that is based on Lagrangean relaxation, interior-point methods, and branch and bound. Unlike classical approaches, Lagrangean relaxation is applied in a two-level hierarchy, branch and bound is based on a Lagrangean lower bound and column generation (branch and price), while interior-point methods are used within a cutting-plane context (analytic centre cutting-plane method---ACCPM). Numerical results demonstrate that the two-level approach outperforms the classical approach and provides a very sharp lower bound that is the (proven) optimal in most cases.

Keywords: production-distribution systems; Lagrangean relaxation; nested decomposition; interior-point cutting-plane methods; branch and price (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (17)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.1050.0392 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:51:y:2005:i:7:p:1151-1164

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().

 
Page updated 2025-03-19
Handle: RePEc:inm:ormnsc:v:51:y:2005:i:7:p:1151-1164