VTechWorks staff will be away for the winter holidays starting Tuesday, December 24, 2024, through Wednesday, January 1, 2025, and will not be replying to requests during this time. Thank you for your patience, and happy holidays!
 

A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem

Simple item page
dc.contributor.authorRamachandran, Sridharen
dc.contributor.departmentIndustrial and Systems Engineeringen
dc.date.accessioned2014-03-14T21:47:14Zen
dc.date.adate2009-10-10en
dc.date.available2014-03-14T21:47:14Zen
dc.date.issued1991en
dc.date.rdate2009-10-10en
dc.date.sdate2009-10-10en
dc.description.abstractThis thesis is concerned with the analysis of a Rectilinear Distance Location Allocation Problem, where the costs are directly proportional to rectilinear distances and the amount shipped. The problem is formulated as a Mixed Integer Bilinear Programming Problem and as a Discrete Location Allocation Problem. Using linear programming relaxations constructed via the Reformulation-Linearization Technique (RLT), the latter formulation is shown to provide stronger lower bounds and is therefore adopted for implementation. In addition, cutting planes are developed to further strengthen the linear programming relaxation. The special structure of the resulting linear program is exploited in order to get a quick lower bound via a suitable Lagrangian dual formulation. This lower bounding scheme is embedded within a finitely convergent Branch and Bound algorithm that enumerates over the location decision variable space. An illustrative example and computational experience are provided to demonstrate the efficacy of the proposed algorithm.en
dc.description.degreeMaster of Scienceen
dc.format.extentviii, 78 leaves, illustrations; 28en
dc.format.mediumBTDen
dc.format.mimetypeapplication/pdfen
dc.identifier.otheretd-10102009-020147en
dc.identifier.sourceurlhttp://scholar.lib.vt.edu/theses/available/etd-10102009-020147/en
dc.identifier.urihttp://hdl.handle.net/10919/45116en
dc.language.isoenen
dc.publisherVirginia Techen
dc.relation.haspartLD5655.V855_1991.R363.pdfen
dc.relation.isformatofOCLC# 24344726en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.subjectCombinatorial enumeration problemsen
dc.subject.lccLD5655.V855 1991.R363en
dc.titleA reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problemen
dc.typeThesisen
dc.type.dcmitypeTexten
thesis.degree.disciplineIndustrial and Systems Engineeringen
thesis.degree.grantorVirginia Polytechnic Institute and State Universityen
thesis.degree.levelmastersen
thesis.degree.nameMaster of Scienceen

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
LD5655.V855_1991.R363.pdf
Size:
2.99 MB
Format:
Adobe Portable Document Format
Description:
Download

Collections

Masters Theses