Some Mathematical Algorithms and Problems in GAMS Technology

  • Neculai Andrei
Part of the Springer Optimization and Its Applications book series (SOIA, volume 81)


In this chapter we present some mathematical problems expressed and solved using the GAMS technology. The applications include computing the inverse of a matrix, the determinant, and the rank of real or complex matrices, solving algebraic systems of real or complex linear equations, determining the polygon of maximal area among all polygons with a given number of sides and diameter less than or equal to one, computing the smallest circle that contains a given number of points, maximizing the area of a hexagon in which the diameter must be less than or equal to one, solving minimal surface problems, generating and prime numbers. The purpose of this chapter is to illustrate the power of the GAMS language with an emphasis on the use of loops, while and dynamic definition of sets.


Gaming Technology Complex Linear Algebraic Equations Dynamic Definition Minimal Surface Problem Maximum Area 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Andrei, N. (2001). Numerical examples solved with SPENBAR – Modified penalty barrier method for large-scale nonlinear programming problems (ICI Technical Report No. 1/2001, Feb 2001).Google Scholar
  2. Andrei, N. (2003). Models, test problems and applications for mathematical programming. Bucharest: Technical Press.Google Scholar
  3. Dolan, E. D., Moré, J. J., & Munson, T. S. (2004). Benchmarking optimization software with COPS 3.0. Preprint ANL/MCS-TM-273. Argonne: Argonne National Laboratory, Feb 2004.Google Scholar
  4. Graham, R. L. (1975). The largest small hexagon. Journal of Combinatorial Theory, (A), 18, 165–170.zbMATHCrossRefGoogle Scholar
  5. Himmelblau, D. M. (1972). Applied nonlinear programming. New York: McGraw-Hill. Problem 16, pp. 415.Google Scholar
  6. Kalvelagen, E. (2001). Nonlinear programming models 1: A collection of simple models. GAMS Development Corp., 1 Aug 2001.Google Scholar
  7. Kalvelagen, E. (2002). Solving systems of linear equations with GAMS (GAMS Technical Report, 12 Nov 2002).Google Scholar
  8. Pearson, J. D. (1968). On variable metric methods of minimization (Research Analysis Corporation Report, RAC-TP-302). McLean: Research Analysis Corp.Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Neculai Andrei
    • 1
    • 2
  1. 1.Center for Advanced Modeling and OptimizationNational Research Institute for InformaticsBucharestRomania
  2. 2.Academy of Romanian ScientistsBucharestRomania

Personalised recommendations