An Adaptive Algorithm for Pure Binary Programming |
Common terms and phrases
Adaptive Algorithm adaptive device adding the constraint B₁ backward step Balas value basic binary variables binary feasible branch selection cancelled at level complementation scheme complete reduction components compute corresponding to Illustration cost row criteria criterion dual feasibility eliminate feasible node feasible solution forced variable forward step free variables Gomory reduction HHHH imbedded linear program improved binary solution improved solution infeasibility test infeasible nodes infeasible rows Input Parameters Performance Itera iteration Kurt Spielberg level K level K-1 LP origin Minimize negative cost nonbasic null objective function omit optimal tableau permissable branches pivot step preferred set primal feasibility Problem Input Parameters procedure restart search tree corresponding selected branch simplex operations slack variables step is justified Table 2 cont unit interval Update V₁ vector y₁ York Scientific Center Θεσ ΦΡ Уз ने