GAMS lets the user concentrate on modeling. By eliminating the need to think about purely technical machine-specific problems such as address calculations, storage assignments, subroutine linkage, and input-output and flow control, GAMS increases the time available for conceptualizing and running the model, and analyzing the results. GAMS structures good modeling habits itself by requiring concise and exact specification of entities and relationships. The GAMS language is formally similar to commonly used programming languages. It is therefore familiar to anyone with programming experience.
Using GAMS, data are entered only once in familiar list and table form. Models are described in concise algebraic statements which are easy for both humans and machines to read. Whole sets of closely related constraints are entered in one statement. GAMS automatically generates each constraint equation, and lets the user make exceptions in cases where generality is not desired. Statements in models can be reused without having to change the algebra when other instances of the same or related problems arise. The location and type of errors are pinpointed before a solution is attempted. GAMS handles dynamic models involving time sequences, lags and leads and treatment of temporal endpoints.
GAMS is flexible and powerful. Models are fully portable from one computer platform to another when GAMS is loaded to each platform. GAMS facilitates sensitivity analysis. The user can easily program a model to solve for different values of an element and then generate an output report listing the solution characteristics for each case. Models can be developed and documented simultaneously because GAMS allows the user to include explanatory text as part of the definition of any symbol or equation. GAMS is being enhanced and expanded on a continuing basis. Please inspect the release notes for more details.
