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.
Year Manuscript Completed
1992
Subject Category
Computer Science (0984)
Keywords
nonlinear integer programming, direct search method
Primary Language of Manuscript
EN