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

01/07/1983

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

Samir K. Barua

Working Papers

  • facebook
  • linkedin
  • twitter
  • whatsapp

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.

IIMA