Computational results of an objective hyperplane search heuristic for a class of the general ILP

Conference · Sat Dec 31 04:00:00 EST 1994

OSTI ID:36052

Gass, S; Joseph, A

We report on the computational results of an objective hyperplane search procedure for solving the general ILP. The objective hyperplane search is formulated as bounded knapsack problem over the solution space of ILP. When tested on traditional ILP test problems, the procedure found optimal or near-optimal solutions in times competitive with commercial software. For larger randomly generated test problems, the method typically finds feasible solutions early in the search which compare competitively with early solutions found by commercial software. By restricting the search to a specially selected group of variables, we are able to achieve significant improvements in the quality of the solution. Problem parameters were varied to study their effect on the procedure`s performance and these results are presented. Factors affecting the performance of the procedure are identified and their impact discussed.

• OSTI ID: 36052
• Report Number(s): CONF-9408161--
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
ALGORITHMS
LINEAR PROGRAMMING
MATRICES
NUMERICAL SOLUTION
PARAMETRIC ANALYSIS