An Additive Algorithm for Solving Linear Programs with Zero-One Variables: In Finitely Many Iterations the Additive Algorithm Yields an Optimal Solution or Proves InfeasibilityResearch Paper
Binary decisions arise when a variable records whether a project is selected, a facility is opened, or an action is taken. Linear constraints then describe the resources or conditions those choices must satisfy. Egon Balas's 1965 paper gives a direct algorithm for a finite linear program with zero-one variables: it begins with all variables at zero, adds…