## An adaptive algorithm for pure binary programming |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

The Role and Implementation of the Adaptive Device | 12 |

The Imbedded Linear Program | 18 |

Branch Elimination and Selection | 34 |

3 other sections not shown

### Common terms and phrases

Adaptive Algorithm adaptive device adding the constraint backward step Balas value basic binary variables binary feasible branch selection cancelled at level ceiling criterion CM CM complete reduction components compute Constrained by Ay corresponding to Illustration cost row criteria dual feasibility eliminate feasible node feasible solution forced variable forward step free variables G G G Gomory Reduction IBM's New York imbedded linear program implicit enumeration improved binary solution improved solution initial origin iteration Kurt Spielberg Lemke level K-l linear programming solution lnfeasible LP origin Minimize negative cost null objective function omit optimal solution optimal tableau optimallty permissable branches pivot step preferred set preferred variables primal feasibility procedure random origin restart search algorithm search tree corresponding selected branch simplex operations slack variables step is Justified take a backward unit interval Update vector York Scientific Center