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.
Year Manuscript Completed
nonlinear integer programming; direct search method
Primary Language of Manuscript
Recommended CitationStephen J. Sugden (1992) A Class of Direct Search Methods for Nonlinear Integer Programming, PhD, ePublications@bond, School of Information and Computing Sciences.
01front.pdf (27 kB)