Aggregate and branch method for solving multi constraint linear programs with zero-one variables
dc.contributor.author | Barua, Samir K. | |
dc.date.accessioned | 2010-03-13T07:25:48Z | |
dc.date.available | 2010-03-13T07:25:48Z | |
dc.date.copyright | 1983-07 | |
dc.date.issued | 2010-03-13T07:25:48Z | |
dc.identifier.uri | http://hdl.handle.net/11718/956 | |
dc.description.abstract | Many 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.iso | en | en |
dc.relation.ispartofseries | WP;1983/466 | |
dc.subject | Linear Programming | en |
dc.title | Aggregate and branch method for solving multi constraint linear programs with zero-one variables | en |
dc.type | Working Paper | en |
Files in this item
This item appears in the following Collection(s)
-
Working Papers [2627]
Working Papers