The Aggregate and Branch Method for Solving Multi Constraint Linear Programs with Zero-One Variables

Samir K. Barua

IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department

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.

Date: 1983-07-01
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:iim:iimawp:wp00542

Access Statistics for this paper

More papers in IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department Contact information at EDIRC.
Bibliographic data for series maintained by ().