This form allows you to search for text in the abstracts of individual modules. In general, Search By Problem is a much more reliable way to find things in GAMS, so use this text search form only as a last resort.
See below for instructions on how to use the form.
Allowable patterns consist of a sequence of words separated by blanks. Words must only contain alphanumeric characters. The character * can be used as a wildcard; it matches any number, including 0, of arbitrary characters. Each word must have at least two alphanumeric characters.
AND means that only modules whose abstracts contain all of the words in the pattern are to be selected. OR means that only one of the given words needs to be found in the abstract for its module to be selected.
Full means that the words in the search pattern must match complete words in the text (that is, the word in the text must be surrounded by nonalphanumeric characters). Partial matching treats the words as sequences of characters which are matched anywhere they appear in the text. For example, in full word search, the pattern "function" would not match the word "functions" in the text, but in partial word matching it would.
This provides a rudimentary means for avoiding huge retrievals. It specifies the maximum number of modules that can be retrieved as part of the search process. It must be more than 0 and less than 251. It only applies when showing matched lines (see below).
GAMS is a service of the Mathematical and Computational Sciences Division / Information Technology Laboratory / National Institute of Standards and Technology
Last change in this page : 12 February 2002. [ ].