A HYBRID-DUAL INTEGER PROGRAMMING ALGORITHM
CARNEGIE INST OF TECH PITTSBURGH PA GRADUATE SCHOOL OF INDUSTRIAL ADMINISTRATION
Pagination or Media Count:
The hybrid-dual algorithm is divided into two stages. In the first stage a linear program is solved to yield an optimal solution in fractional- valued variables. The final tableau given by the dual linear programming method is then transformed and expanded into a new tableau of a readily specifiable canonical form. In the second stage of the algorithm a variant of the bound escalation method is applied to the new tableau--and to the tableaus successively derived thereafter-until one or more of a distinguished set of columns and a corresponding set of rows attains a predetermined configuration. At this point the indicated rows and columns are dis carded, never to be recovered, and the method continues recursively with the bound escalation algorithm until the problem is solved.
- Operations Research