A Class of Direct Search Methods for Nonlinear Integer Programming

Abstract

The overriding goal for the work described in this thesis is to obtain a good integer-feasible or near-integer-feasible solution to the general NLIP problem while trying to avoid or at least minimize the use of the ubiquitous branch-and-bound techniques.

Date of Award	Jul 1992
Original language	English
Supervisor	Bruce Murtagh (Supervisor)