'is there a way in OPL to maximize the minimun of a list of decision variables?
I want to do something like this:
dvar Q [1..10];
maximize min(i in 1..10) Q[i] ;
Q has 10 different values which i don´t know, i want that the minimun of all those values be as high as possible
But this doesn´t allow me to use Q which is a desicion variable
Is it possible somehow?
Solution 1:[1]
dvar int+ Q [1..10] in 0..20;
maximize min(i in 1..10) Q[i] ;
works fine
Sources
This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.
Source: Stack Overflow
| Solution | Source |
|---|---|
| Solution 1 | Alex Fleischer |
