Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/956
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBarua, Samir K.-
dc.date.accessioned2010-03-13T07:25:48Z-
dc.date.available2010-03-13T07:25:48Z-
dc.date.copyright1983-07-
dc.date.issued2010-03-13T07:25:48Z-
dc.identifier.urihttp://hdl.handle.net/11718/956-
dc.description.abstractMany important class of economic problems find their mathematical models in linear programs with variables taking only one of the values, zero or one. The major difficulty with these models is that the time required to solve even medium size problems is enormous. In the present work, a new approach called Aggregate and Branch Method has been suggested for solving such programs. Limited computational experience with the algorithm is also reported in the paper.en
dc.language.isoenen
dc.relation.ispartofseriesWP;1983/466-
dc.subjectLinear Programmingen
dc.titleAggregate and branch method for solving multi constraint linear programs with zero-one variablesen
dc.typeWorking Paperen
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
WP 1983_466.pdf177.91 kBAdobe PDFView/Open


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.