Skip to main content

Some Mathematical Algorithms and Problems in GAMS Technology

  • Chapter
  • First Online:
Nonlinear Optimization Applications Using the GAMS Technology

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

  • 3491 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • 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 

  • Andrei, N. (2003). Models, test problems and applications for mathematical programming. Bucharest: Technical Press.

    Google Scholar 

  • 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 

  • Graham, R. L. (1975). The largest small hexagon. Journal of Combinatorial Theory, (A), 18, 165–170.

    Article  MATH  Google Scholar 

  • Himmelblau, D. M. (1972). Applied nonlinear programming. New York: McGraw-Hill. Problem 16, pp. 415.

    Google Scholar 

  • Kalvelagen, E. (2001). Nonlinear programming models 1: A collection of simple models. GAMS Development Corp., 1 Aug 2001.

    Google Scholar 

  • Kalvelagen, E. (2002). Solving systems of linear equations with GAMS (GAMS Technical Report, 12 Nov 2002).

    Google Scholar 

  • Pearson, J. D. (1968). On variable metric methods of minimization (Research Analysis Corporation Report, RAC-TP-302). McLean: Research Analysis Corp.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

Andrei, N. (2013). Some Mathematical Algorithms and Problems in GAMS Technology. In: Nonlinear Optimization Applications Using the GAMS Technology. Springer Optimization and Its Applications, vol 81. Springer, Boston, MA. https://doi.org/10.1007/978-1-4614-6797-7_3

Download citation

Publish with us

Policies and ethics