gams:model_a_band_matrix

This shows you the differences between two versions of the page.

Both sides previous revision Previous revision | |||

gams:model_a_band_matrix [2008/09/25 14:55] support |
gams:model_a_band_matrix [2008/09/25 14:56] (current) support |
||
---|---|---|---|

Line 2: | Line 2: | ||

- | A [[http://en.wikipedia.org/wiki/Band_matrix|band matrix]] can be modeled efficiently in GAMS using circular leads (''++'') and circular lags(''%%--%%''). See chapter 13.4 of the GAMS User's Guide for more information. Using circular leads and lags, the first and last members of the set are assumed to be adjacent, so as to form a circular sequence of members. These operators only work with ordered sets. | + | A [[http://en.wikipedia.org/wiki/Band_matrix|band matrix]] can be modeled efficiently in GAMS using circular leads (''++'') and circular lags (''%%--%%''). See chapter 13.4 of the GAMS User's Guide for more information. Using circular leads and lags, the first and last members of the set are assumed to be adjacent, so as to form a circular sequence of members. These operators only work with ordered sets. |

Find below an example, where the usage of circular leads (equation ''eq'') was ~60 times faster than the original formulation using ''sum'' - statements and lots of comparisons (equation ''eq1'' and ''eq2''). Both models are identical. | Find below an example, where the usage of circular leads (equation ''eq'') was ~60 times faster than the original formulation using ''sum'' - statements and lots of comparisons (equation ''eq1'' and ''eq2''). Both models are identical. |

IMPRESSUM / LEGAL NOTICE
PRIVACY POLICY
gams/model_a_band_matrix.txt ยท Last modified: 2008/09/25 14:56 by support