A. Brooke, D. Kendrick, and A. Meeraus (1988). GAMS: A User's Guide, The Scientific Press, San Francisco, CA.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....inequalities in the reformulation. The constraints given by (5) can be expressed alternatively as (16) l i )h i (x) u i )h i (x) 0, i = 1, m. Slack variables can also be used in this situation in any of the three forms outlined above. 3.2. Modeling Languages. Both gams [2] and ampl [7] provide constructs for expressing complementarity constraints. Codes using Newton s method require second partial derivatives. Hence, the models used in our study are formulated in ampl [7] which is currently the only modeling language providing second derivative information. The ....

A. Brooke, D. Kendrick, and A. Meeraus. GAMS: A User's Guide. Scientific Press, 1988.

....and in the quality assurance process of mathematical programming software. Many researchers have devoted considerable work to collecting suitable test problems, benchmarking, and performance testing of optimization software, see for example [1, 2, 5, 27, 29, 31] and more notably [15, 25, 26] Unfortunately, before the seminal paper by Crowder, Dembo, and Mulvey [10] the first to give clear guidelines and standards on how to report computational experiments, little emphasis was placed on the reproducibility of experiments and data analyses. Historically, most of the results involve ....

....PAVER seeks to automate and simplify specific tasks in the performance data analysis phase. PAVER provides simple online tools for automated performance analysis, visualization, and processing of benchmarking data. An optimization engine, either a modeling environment such as AMPL [19] or GAMS [6] or a stand alone solver, generally provides solution information such as objective function value, resource time, number of iterations, and the solver status. The latter gives information of optimality or feasibility of the solution, or infeasibility or unboundedness of the model. Within GAMS, ....

[Article contains additional citation context not shown here]

A. Brooke, D. Kendrick, and A. Meeraus (1988). GAMS: A User's Guide, The Scientific Press, San Francisco, CA.

....set of nonlinear models and in we draw conclusions. 2 PAVER Server Design The PAVER Server (http: www.gamsworld.org performance paver) is a web based service for reproducible performance analysis of optimization software. Similar in scope to the Network Enabled Optimization System (NEOS) 26, 9, 19, 11] PAVER seeks to automate and simplify specific tasks in the benchmarking process. While NEOS is an environment for the solution of optimization problems, PAVER provides simple online tools for automated performance analysis, visualization, and processing of benchmarking data. An ....

....in the benchmarking process. While NEOS is an environment for the solution of optimization problems, PAVER provides simple online tools for automated performance analysis, visualization, and processing of benchmarking data. An optimization engine, either a modeling environment such as AMPL [16] or GAMS [6] or a stand alone solver, generally provides solution information such as objective function value, resource time, number of iterations, and the solver status. The latter gives information of optimality or feasibility of the solution, or infeasibility or unboundedness of the model. ....

[Article contains additional citation context not shown here]

A. Brooke, D. Kendrick, and A. Meeraus (1988). GAMS: A User's Guide, The Scientific Press, San Francisco, CA.

....that are obtained as outer approximations to the mixed integer nonlinear programming problem. A series of nonlinear programming subproblems are solved to obtain the outer approximations. In this note, we use GAMS DICOPT, a commercially available implementation of the outer approximation algorithm [3,6]. 2 Computational Comparison In order to compare the performance of our branch and bound approach with the performance of an outer approximation algorithm, we solved a number of convex 0 1 MINLP test problems with our branch and bound code and with GAMS DICOPT. In this section we present the ....

....selection problems that are similar to but somewhat larger than meanvarx. Both codes were run on a Sun SPARC 10 30 workstation under SunOS. The branch and bound code, BB, is described in [2] We used version 2. 25.078 of GAMS DICOPT, with OSL as the MILP solver and MINOS5.3 as the NLP solver [3,6]. Default settings for DICOPT parameters were used with two exceptions. CPU time and iteration limits were increased to solve the larger problems in our test set. Also, DICOPT stopping option 1, which stops DICOPT when a solution has been proven optimal was selected instead of the default, ....

Anthony Brooke, David Kendrick, and Alexander Meeraus. GAMS: A User's Guide. Scientific Press, San Francisco, 1988.

....objetivo son no lineales. En [2] 3] se propone un enfoque de Programaci on Difusa al PTSM, desembocando en un modelo que resuelven con el M etodo del Simplex, para el caso lineal, y con alguna otra t ecnica cl asica de optimizaci on para el caso no lineal. Un sistema comercial, GAMS (ver [4]) basado en t ecnicas de gradiente controlado, ha sido comparado por otros autores ( 14] 17] con un Sistema Gen etico para el Problema del Transporte. Las conclusiones son que para funciones convexas ambos sistemas evolucionan bastante bien, pero cuando las funciones son concavas el sistema ....

A. Brooke, D. Kendrick, A. Meeraus, GAMS: A user's guide. The Scientific Press, Redwood City, CA, 1988.

....time optimal ZVD CAP shapers. Thus, we have solved the ZVD CAP problem for a variety of parameter values for the two mass spring damper model of a flexible structure shown in Fig. 1. The shapers were deternfined by solving the above constraint equations with the nonlinear optimization program GAMS [3]. We have found that similar properties do indeed exist for the more robust time optimal ZVD CAP shapers. Typical plots of the variation of the shaper impulse times as a function of system damping and move distance are shown in Fig. 4. The optimal number of impulses is usually 7, except for some ....

A. Brooke, D. Kendrick, and A. Meeraus. GAMS: A User's Guide. Scientific Press, 1988.

....a Fuzzy Programming approach to the MSTP, arriving at a model that solves with the Simplex Method, for the linear case, and with whatever other classic optimization technique for the nonlinear case. The results obtained by other authors have been compared using a comercial system, GAMS (see [4], 12] 15] with the genetic system on a few nonlinear cases. The early results suggest that both systems perform quite well when the cost functions are convex, but when the functions are concave, the genetic system beats GAMS, finding better values. The fundamental cause is the tendency on the ....

A. Brooke, D. Kendrick, A. Meeraus, GAMS: A user's guide. The Scientific Press, Redwood City, CA, 1988.

.... 0. Similarly, h i w i h i , and hence the aspect ratio constraint is enforced. We illustrate the application of both methods in Section 5. 5 Computational Results We tested the models ModCoAR and BPL using MINOS 5.3 [17, 18, 19] accessed via the modelling language GAMS (release 2. 25) [8] on a 300MHz SunSPARC. To set up ModCoAR, we computed the generalized target distances (1) with # = 0.1; we set the radii of the approximating circles to r i = a i #; and we chose K = c ij . To solve ModCoAR, MINOS requires the user to supply an initial configuration. Since it is not clear ....

A. Brooke, D. Kendrick, and A. Meeraus. GAMS -- A User's Guide, Release 2.25. The Scientific Press, South San Francisco, CA, 1992.

.... 0. Similarly, h i w i h i , and hence the aspect ratio constraint is enforced. We illustrate the application of both methods in Section 5. 5 Computational Results We tested the models ModCoAR and BPL using MINOS 5.3 [18, 19, 20] accessed via the modelling language GAMS (release 2. 25) [9] on a SUNSparc. To set up ModCoAR, we computed the generalized target distances (1) with # = 0.1; we set the radii of the approximating circles to r i = a i #; and we chose K = c ij . To solve ModCoAR, MINOS requires the user to supply an initial configuration. Since it is not clear a ....

A. Brooke, D. Kendrick, and A. Meeraus. GAMS -- A User's Guide, Release 2.25. The Scientific Press, South San Francisco, CA, 1992.

....by hand some of these techniques to generate Version 2 [35, 36, 38, 42] as follows. After parallelization, the LCG of the source code was built, and the integer programming problem for the iteration data distributions of each phase was derived. The solutions were obtained by the GAMS solver [7]. Finally, those distributions were hand coded, including the Put Get generation for global or frontier communications. Table 3 illustrates a comparison of the core techniques used in the two versions. The Access Region Test (ART) was applied to both versions, but the main differences between ....

A. Brooke, D. Kendrick, and A. Meeraus. Release 2.25 GAMS A User's Guide. The Scientific Press, 1992.

....objective function is an indefinite quadratic form. Consequently, any optimization technique which requires at least a positive semidefinite form will be unable to locate the global minimum of CSP. Such techniques include the commercial optimization package GAMS using the nonlinear solver MINOS 5 [4]. In Section VC, GAMS MINOS 5 is used as a local optimization technique when comparing its performance on various instances of the CSP with the improved Hopfield network, the SONN, and a simulated annealing heuristic. B. Heuristic and Neural Network Approaches to the CSP In this section, we ....

A. Brooke, D. Kendrick, and A. Meeraus, GAMS---A User's Guide. California: Scientific, 1990.

....(e.g. Harrison, Rutherford and Tarr [1996] 1997] it is important to stress that they are (a) based on explicit econometric estimates, and (b) used in a model that rules out any terms of trade effects by assumption. 6 The SOE model is generated with the GAMS MPSGE software developed by Brooke, Kendrick and Meeraus [1992] and Rutherford [1996] 1999] It is then solved using the PATH algorithm developed by Dirkse and Ferris [1995] Our model runs on standard laptop computers, solving in about one minute per simulation. Readers that do not want to download the model and data, or do not have the necessary ....

Brooke, Anthony; Kendrick, David, and Meeraus, Alexander, GAMS: A User's Guide, Release 2.25 (Danvers, MA.: Boyd & Fraser, 1992).

....like and , they provide a convenient way to form expressions such as: i I j ij i y x a I i = AMLs are computer readable equivalents of algebraic notations. They have become very popular in the Operations Research community through languages like AMPL [Fourer et al. 1990] and GAMS [Brooke et al. 1988]. More recently, AMLs have also been used in Artificial Intelligence for constraint programming [Michel and van Hentenryck, 1996] AMLs are appropriate in our context because mathematical modelers are familiar with algebraic notations. AMLs are very expressive languages: in addition of ....

A. Brooke, D. Kendrick, and A. Meeraus. GAMS: a User's Guide. Scientific Press, Redwood City, CA, 1988.

.... expressions, sets, variables and iterated operators like and , they provide a convenient way to form expressions such as: I j ij i y x a I i AMLs have become very popular in the Operations Research community through languages like AMPL (Fourer, Gay and Kernighan 1990) and GAMS (Brooke, Kendrick and Meeraus 1988). More recently, AMLs have also been used in AI for constraint programming (Michel and van Hentenryck 1996) The popularity of AMLs for numerical modeling comes from different factors. First, it is not necessary to be a computer scientist in order to use these languages: the effort to implement a ....

Brooke, A.; Kendrick, D.; Meeraus, A. 1988: GAMS: a User's Guide. Scientific Press, Redwood City, CA.

....variables. The traveling salesman problems in Step 7 of the cycle cover heuristic (Stage 3) all involved 16 or less cities, and we used a well known mixed 0 Gamma 1 integer programming formulation for each of them (Tucker [10] We solved each of these integer programming models using the GAMS [1] modeling language with the OSL solver on a Sun Sparc workstation. Each problem was solved to optimality in no more than 5 minutes of CPU time. We now discuss the solutions we obtained. Home Bases Selected, Implemented In the optimum solution of the p median models, 11 (10) home base sites were ....

A. Brooke, D. Kendrick, and A. Meeraus, GAMS: A User's Guide, Release 2.25, The Scientific Press, San Francisco, 1992.

....the vector of constraint function values. The needed derivatives are either explicitly coded, computed by using numerical differences or derived using automatic differentiation techniques. In recent years several modeling languages has been developed, like AIMMS [7] AMPL [21] ASCEND [40] GAMS [8, 11] and LINGO [2] The modeling system acts as a preprocessor. The user describes his problem in detail in a very verbal language, an opposite to a concise mathematical description of the problem. This problem description file is normally modified in a text editor, with help from example files ....

A. Brooke, D. Kendrick, and A. Meeraus. GAMS - A User's Guide. The Scientific Press, Redwood City, CA, 1988.

....emergence of modeling methodologies and supporting environments. Recognition of the importance of modeling methodologies and computer assisted support is evident in the prescriptive modeling community through efforts such as ANALYZE (Greenberg 1983; 1987; 1993) GAMS (Bisschop and Meeraus 1982; Brooke, Kendrick and Meeraus 1992) and Structured Modeling (Geoffrion 1987, 1992a, 1992b) Within the discrete event simulation community, the maturation of research in methodology based support environments is seen in KBSim (Rothenberg 1989) Knowledge Based Simulation (KBS) Baskaran and Reddy 1984) MODSYN (Rozenblit and Huang ....

Brooke, A., D. Kendrick and A. Meeraus. 1992. GAMS: A user's guide, release 2.25, San Francisco, CA: The Scientific Press.

....algorithmic issues. A good example is the seminal paper by Crowder, Dembo and Mulvey [3] on computational experiments. The second phase is dominated by data and model representation issues. This phase has re sulted in a number of algebra based modeling systems pioneered by LINDO [18] CAMS [1] and AMPL [7] in that chronological order) We are now transitioning into a third phase dominated by real life problem solving. There has been a permanent shift from a scientific, supply driven regime into a market oriented, user demand driven business environment. In this environment, quality ....

Brooke, A., Kendrick, D., Meeraus, A.: GAMS: A User's Guide, The Scientific Press, Redwood City, California (1988)

No context found.

A. Brooke, D. Kendrick, and A. Meeraus (1988). GAMS: A User's Guide, The Scientific Press, San Francisco, CA.

No context found.

A. Brooke, D. Kendrick, and A. Meeraus, GAMS - A User's Guide, The Scientific Press, Redwood City, CA, 1988.

No context found.

A. Brook, D. Kendrick, and A. Meeraus. GAMS: A User's Guide, Release 2.25. Scientific Press, San Francisco, CA, 1992.

No context found.

A. Brooke, D. Kendrick and A. Meeraus, 1988. GAMS: A User's Guide. The Scienti c Press, South San Francisco, California.

No context found.

A. Brooke, D. Kendrick, and A. Meeraus (1988). GAMS: A User's Guide, The Scientific Press, San Francisco, CA.

No context found.

Brooke, A., D. Kendrick, and A. Meeraus (1992), GAMS: A User's Guide. Release 2.25. San Francisco: Scientific Press.

No context found.

Tony Brooke, David Kendrick, and Alex Meeraus. GAMS: A User's Guide. The Scientific Press, Redwood City, California, 1988.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC