GAMS has strict domain checking (type checking). This has some interesting consequences. Basically all good: much better protection against errors compared to simply using integer indices 1,…,n. Consider the square matrix Ai,j:
set |
I am a full-time consultant and provide services related to the design, implementation and deployment of mathematical programming, optimization and data-science applications. I also teach courses and workshops. Usually I cannot blog about projects I am doing, but there are many technical notes I'd like to share. Not in the least so I have an easy way to search and find them again myself. You can reach me at erwin@amsterdamoptimization.com.
GAMS has strict domain checking (type checking). This has some interesting consequences. Basically all good: much better protection against errors compared to simply using integer indices 1,…,n. Consider the square matrix Ai,j:
set |
This question was posed [1]: How to linearize min(a,b)>min(x,y) where a,b,x,y are variables. The type of variables is not specified so let's assume they all are continuous variables.
I am again looking at simple models based on the transportation model:
Dense Transportation Model |
---|
min∑i,jci,j⋅xi,j∑jxi,j≤ai∀i∑ixi,j≥bj∀jxi,j≥0 |
I am teaching some GAMS classes this summer. The first class is about the transportation model. This is model number 1 from the GAMS model library [1]. It is a tiny model, slightly modified from the original model in [2]. I believe the GAMS version has been made dual degenerate.