And a nice book : https://www.amazon.com/Decision-Optimization-CPLEX-Studio-Hands/dp/3662654806
And a youtube tutorial https://www.youtube.com/playlist?list=PLyY17uOd5sPNgeqy2CguqyW0IENeEW4kS
And many links at https://www.linkedin.com/pulse/low-barrier-entry-optimization-through-cplex-alex-fleischer/
------------------------------
[Alex] [Fleischer]
[Data and AI Technical Sales]
[IBM]
------------------------------
Original Message:
Sent: Mon April 22, 2024 03:17 PM
From: Paul Rubin
Subject: Re: opl
https://www.ibm.com/docs/en/icos/22.1.1?topic=opl-optimization-programming-language
------------------------------
Paul Rubin
Professor Emeritus
Michigan State University
Original Message:
Sent: Mon April 22, 2024 11:46 AM
From: Sheeba Pathak
Subject: Re: opl
Please share a link of the syntax used in IBM OPL CPLEX ILOG! I just can't find it anywhere.
------------------------------
Sheeba Pathak
Original Message:
Sent: Mon April 22, 2024 11:46 AM
From: ALEX FLEISCHER
Subject: Re: opl
A draft model to start with:
int N=10; range rooms=1..N; int Acc[i in rooms][j in rooms]=(abs(i-j)<=3)?1:0; int Input[i in rooms]=0; int Output[i in rooms]=0; dvar int+ XG[rooms][rooms]; dvar int+ XR[rooms][rooms]; minimize sum (i,j in rooms) (XG[i][j]+XR[i][j]); subject to { forall(i in rooms) { sum(j in rooms:j!=i) XG[j][i]*Acc[j][i]-sum(j in rooms:j!=i) XG[i][j]*Acc[i][j] +Input[i]-Output[i]==XG[i][i]; sum(j in rooms:j!=i) XR[j][i]*Acc[j][i]-sum(j in rooms:j!=i) XR[i][j]*Acc[i][j] -Input[i]+Output[i]==XR[i][i]; } }
regards
#CPLEXOptimizers
#DecisionOptimization