Hi i am gaving a trouble with loading data in. This is the error log i have. Does anyone know how to make SAS read data in a correct way?   1 OPTIONS NONOTES NOSTIMER NOSOURCE NOSYNTAXCHECK; 68 69 /* Create the distance matrix */ 70 data distance_matrix; 71 input loc1 loc2 distance; 72 datalines; NOTE: The data set WORK.DISTANCE_MATRIX has 36 observations and 3 variables. NOTE: DATA statement used (Total process time): real time 0.00 seconds user cpu time 0.01 seconds system cpu time 0.00 seconds memory 778.25k OS Memory 22180.00k Timestamp 09/18/2024 02:11:35 PM Step Count 258 Switch Count 2 Page Faults 0 Page Reclaims 102 Page Swaps 0 Voluntary Context Switches 9 Involuntary Context Switches 0 Block Input Operations 0 Block Output Operations 264 109 ; 110 run; 111 112 /* Create the weekly hours dataset */ 113 data week_hours; 114 input loc hours; 115 datalines; NOTE: The data set WORK.WEEK_HOURS has 9 observations and 2 variables. NOTE: DATA statement used (Total process time): real time 0.00 seconds user cpu time 0.00 seconds system cpu time 0.00 seconds memory 778.25k OS Memory 22180.00k Timestamp 09/18/2024 02:11:35 PM Step Count 259 Switch Count 2 Page Faults 0 Page Reclaims 85 Page Swaps 0 Voluntary Context Switches 9 Involuntary Context Switches 1 Block Input Operations 0 Block Output Operations 264 125 ; 126 run; 127 128 /* Create the revenue dataset */ 129 data revenue; 130 input loc revenue; 131 datalines; NOTE: The data set WORK.REVENUE has 9 observations and 2 variables. NOTE: DATA statement used (Total process time): real time 0.00 seconds user cpu time 0.00 seconds system cpu time 0.00 seconds memory 778.25k OS Memory 22180.00k Timestamp 09/18/2024 02:11:35 PM Step Count 260 Switch Count 2 Page Faults 0 Page Reclaims 87 Page Swaps 0 Voluntary Context Switches 12 Involuntary Context Switches 0 Block Input Operations 0 Block Output Operations 264 141 ; 142 run; 143 144 data staff; 145 input staff; 146 datalines; NOTE: The data set WORK.STAFF has 8 observations and 1 variables. NOTE: DATA statement used (Total process time): real time 0.00 seconds user cpu time 0.00 seconds system cpu time 0.00 seconds memory 778.25k OS Memory 22180.00k Timestamp 09/18/2024 02:11:35 PM Step Count 261 Switch Count 2 Page Faults 0 Page Reclaims 85 Page Swaps 0 Voluntary Context Switches 12 Involuntary Context Switches 0 Block Input Operations 0 Block Output Operations 264 155 ; 156 run; 157 158 159 /* Create datasets for above and below threshold */ 160 proc sql; 161 create table above_threshold as 162 select loc1, loc2, distance 163 from distance_matrix 164 where distance > 40; NOTE: Table WORK.ABOVE_THRESHOLD created, with 5 rows and 3 columns. 165 166 create table below_threshold as 167 select loc1, loc2, distance 168 from distance_matrix 169 where distance <= 40; NOTE: Table WORK.BELOW_THRESHOLD created, with 31 rows and 3 columns. 170 quit; NOTE: PROCEDURE SQL used (Total process time): real time 0.00 seconds user cpu time 0.01 seconds system cpu time 0.00 seconds memory 5899.12k OS Memory 27560.00k Timestamp 09/18/2024 02:11:35 PM Step Count 262 Switch Count 4 Page Faults 0 Page Reclaims 275 Page Swaps 0 Voluntary Context Switches 23 Involuntary Context Switches 0 Block Input Operations 0 Block Output Operations 528 171 172 proc optmodel; 173 /* First model for locations with distances above threshold */ 174 set LOCS; 175 set STAFF; 176 number distance{LOCS, LOCS}; 177 number hours{LOCS}; 178 number revenue{LOCS}; 179 180 /* Read the distance data */ 181 read data above_threshold into LOCS=[loc1 loc2] distance=distance[loc1, loc2]; ________ _ 587 22 ERROR 587-782: The set element length does not match key count, 1 NE 2. ERROR 22-322: Expecting a name. 182 183 /* Read the weekly hours and revenue data */ 184 read data week_hours into LOCS=[loc] hours=hours; NOTE: There were 9 observations read from the data set WORK.WEEK_HOURS. 185 read data revenue into LOCS=[loc] revenue=revenue; NOTE: There were 9 observations read from the data set WORK.REVENUE. 186 read data staff into STAFF=[staff]; NOTE: There were 8 observations read from the data set WORK.STAFF. 187 188 /* Define your decision variables, objective, and constraints here */ 189 190 num wage = 23.45; 191 num max_hours = 40; 192 193 /* declare decision variables */ 194 var RequiredHour {staff, LOCS} >= 0; 194 ! /* Hours worked by staff i on site j */ 195 196 /* declare objective */ 197 max Profit = sum {j in LOCS} revenue[j] 198 - (wage * sum {i in staff, j in LOCS} RequiredHour[i,j]) 199 - 0.15 * (wage * sum {i in staff, j in LOCS} RequiredHour[i,j]) 200 - 0.04 * (sum {j in LOCS} revenue[j] ); 201 202 /* declare constraints */ 203 con MaximumHours {i in staff}: sum{j in LOCS} RequiredHour[i,j] <= 40; 204 con Totalhours {j in LOCS}: sum {i in staff} RequiredHour[i,j] = hours[j]; 205 206 /* Solve the problem */ 207 solve; NOTE: Problem generation will use 2 threads. NOTE: Previous errors might cause the problem to be resolved incorrectly. NOTE: The problem has 72 variables (0 free, 0 fixed). NOTE: The problem has 17 linear constraints (8 LE, 9 EQ, 0 GE, 0 range). NOTE: The problem has 144 linear constraint coefficients. NOTE: The problem has 0 nonlinear constraints (0 LE, 0 EQ, 0 GE, 0 range). NOTE: The OPTMODEL presolver is disabled for linear problems. NOTE: The problem is a pure network instance. The ALGORITHM=NETWORK option is recommended for solving problems with this structure. NOTE: The LP presolver value AUTOMATIC is applied. NOTE: The LP presolver time is 0.00 seconds. NOTE: The LP presolver removed 8 variables and 1 constraints. NOTE: The LP presolver removed 16 constraint coefficients. NOTE: The presolved problem has 64 variables, 16 constraints, and 128 constraint coefficients. NOTE: The LP solver is called. NOTE: The Dual Simplex algorithm is used. Objective Phase Iteration Value Time D 2 1 4.505280E+03 0 P 2 14 5.949925E+02 0 NOTE: Optimal. NOTE: Objective = 594.9925. NOTE: The Dual Simplex solve time is 0.00 seconds. 208 209 /* Display the results */ 210 print Profit dollar10.2; 211 print 'Allocation'; 212 print RequiredHour; 213 214 215 quit; NOTE: The SAS System stopped processing this step because of errors. NOTE: PROCEDURE OPTMODEL used (Total process time): real time 0.04 seconds user cpu time 0.04 seconds system cpu time 0.00 seconds memory 12913.73k OS Memory 33968.00k Timestamp 09/18/2024 02:11:35 PM Step Count 263 Switch Count 18 Page Faults 0 Page Reclaims 385 Page Swaps 0 Voluntary Context Switches 129 Involuntary Context Switches 2 Block Input Operations 0 Block Output Operations 352 216 217 proc optmodel; 218 /* Second model for locations with distances below threshold */ 219 set LOCS; 220 number distance{LOCS, LOCS}; 221 number hours{LOCS}; 222 number revenue{LOCS}; 223 224 /* Read the distance data */ 225 read data below_threshold into LOCS=[loc1 loc2] distance=distance[loc1, loc2]; ________ _ 587 22 ERROR 587-782: The set element length does not match key count, 1 NE 2. ERROR 22-322: Expecting a name. 226 227 /* Read the weekly hours and revenue data */ 228 read data week_hours into LOCS=[loc] hours=hours; NOTE: There were 9 observations read from the data set WORK.WEEK_HOURS. 229 read data revenue into LOCS=[loc] revenue=revenue; NOTE: There were 9 observations read from the data set WORK.REVENUE. 230 231 /* Define your decision variables, objective, and constraints here */ 232 233 NUM n = card(LOCS); 234 NUM eps = 0.00001; 235 236 /* Define variables */ 237 var x {LOCS, LOCS} binary; 238 var y {LOCS} binary; 239 var u {LOCS} >= 0; 239 ! /* dummy variable - represents the order in which each location is visited */ 240 var NumStaff >= 0 integer; 240 ! /* New variable representing the number of staff */ 241 /*impvar NumVan = ceil(NumEmployees/2) 242 243 /* Define flow in and out of all customer nodes */ 244 impvar FlowOut {i in LOCS} = sum {j in LOCS: i ne j} x[i,j]; 245 impvar FlowIn {j in LOCS} = sum {i in LOCS: i ne j} x[i,j]; 246 247 /* Set "arbitrary" starting point */ 248 num home = 9; 249 250 /* Declare constraints */ 251 252 /* The vehicle must arrive and depart from each customer */ 253 con Arrival_con {i in LOCS}: FlowIn[i] = 1; 254 con Departure_con {j in LOCS}: FlowOut[j] = 1; 255 256 /* Remove subtours */ 257 con Subtour_elimination_con {i in LOCS, j in LOCS: i ne j & i ne home}: 258 u[i] - u[j] + n*x[i,j] <= n-1; 259 con u_restrict1_con {i in LOCS: i ne home}: u[i] >= 1; 260 con u_restrict2_con {i in LOCS: i ne home}: u[i] <= n - 1; 261 262 263 /* Maximum working hours constraint: actual work time + travel time cannot exceed 40 hours per employee */ 264 con Max_Working_Hours_Con: 265 sum {i in LOCS} hours[i] * y[i] + 266 sum {i in LOCS, j in LOCS} (distance[i,j] /60) * x[i,j] <= 40 * NumStaff ; 267 268 269 270 271 /* Declare objective */ 272 max TotalProfit = 273 sum {i in LOCS} revenue[i] * y[i] 274 /* sum of travel cost + actual work cost at location */ 275 - 40 * 26 * NumStaff 276 - 0.04 * sum {i in LOCS} revenue[i] /* Cleaning Material Cost */ 277 - 0.2 * sum {i in LOCS, j in LOCS} distance[i,j] * x[i,j] /* Fuel cost */ 278 - 0.15 * 40 * 26 * NumStaff 279 - 20 * n 280 281 ; 282 solve; NOTE: Problem generation will use 2 threads. NOTE: Previous errors might cause the problem to be resolved incorrectly. ERROR: The array element 'distance[1,1]' has no value at line 266 column 41. NOTE: Unable to create problem instance due to previous errors. 283 284 /* Print results */ 285 title 'Route'; 286 print {i in LOCS, j in LOCS: x[i,j] > 0} x; 287 print u; 288 print FlowOut FlowIn; 289 print NumStaff; 289 ! /* Print number of employees used */ 290 291 quit; NOTE: The SAS System stopped processing this step because of errors. NOTE: PROCEDURE OPTMODEL used (Total process time): real time 0.03 seconds user cpu time 0.03 seconds system cpu time 0.01 seconds memory 1168.85k OS Memory 23212.00k Timestamp 09/18/2024 02:11:35 PM Step Count 264 Switch Count 4 Page Faults 0 Page Reclaims 151 Page Swaps 0 Voluntary Context Switches 56 Involuntary Context Switches 1 Block Input Operations 0 Block Output Operations 224 292 293 294 295 OPTIONS NONOTES NOSTIMER NOSOURCE NOSYNTAXCHECK; 305 ... View more

Hi,   I am new to SAS and wondering what should be the right SAS syntax for the following   /* Time constraints */ con time_constraints_A: sum{i in LOCATIONS, j in LOCATIONS} t_A[i, j] * x[i, j, k] + sum{i in LOCATIONS} s_A[i] * y[i, k] <= max_time[k], for all k in VEHICLES where z[k] = 1; I don't think the last line is correct but that is the logic in plain english I want to do. I want the sum + sum for all k in set VEHICLE where z[k] = 1   Same for this constraint con type_link: v_A[i] * z[k] + v_B[i] * (1 - z[k]) >= x[i, j, k], for all i in LOCATIONS, j in LOCATIONS, k in VEHICLES; Thanks a lot ... View more

My SAS code  is generating semantic error. It is saying ERROR: The array element 'travel_time[1,2]' has no value at line 228 column 57.   I am not sure what that means. I believe the data is completed and has been loaded in correctly.    /* Patient data: duration of treatment and revenue */ data patient_data; input i duration revenue; datalines; 1 12 200 2 45 181 3 90 255 4 26 150 5 75 220 6 60 200 7 45 180 8 120 300 9 90 250 10 30 158 ; run; /* Travel times between patients (symmetric for simplicity) */ data travel_times; input i j t; datalines; 1 2 15 1 3 20 1 4 25 1 5 30 1 6 3.5 1 7 11 1 8 26 1 9 12 1 10 26 2 3 10 2 4 18 2 5 22 2 6 10 2 7 3 2 8 4 2 9 5.5 2 10 15 3 4 12 3 5 15 3 6 10 3 7 25 3 8 30 3 9 22 3 10 12 4 5 8 4 6 23 4 7 10 4 8 7.5 4 9 6.5 4 10 48 5 6 28 5 7 10 5 8 15 5 9 16 5 10 45 6 7 28 6 8 45 6 9 30 6 10 25 7 8 12 7 9 10 7 10 4 8 9 3.5 8 10 15 9 10 30 1 1 0 2 2 0 3 3 0 4 4 0 5 5 0 6 6 0 7 7 0 8 8 0 9 9 0 10 10 0 ; run; /* Generate full travel time matrix */ data travel_times_full; set travel_times; output; t_temp = t; t = t_temp; i_temp = i; i = j; j = i_temp; output; run; /* Add diagonal elements (travel time to self = 0) */ data travel_times_final; set travel_times_full; do i = 1 to 10; j = i; t = 0; output; end; run; /* Nurse and vehicle data */ data nurse_data; input H_t H_c c_t c_c c_v n_t; datalines; 480 480 30 40 20 8 ; run; /* Macro to set the number of telehealth nurses */ %let n_t = 20; /* Use PROC OPTMODEL to solve the problem */ proc optmodel; /* Define sets */ set PATIENTS = 1..10; set TELEHEALTH_NURSES = 1..&n_t; set TRAVEL_CAREGIVERS = 1..8; set VEHICLES = 1..4; /* Define parameters */ number d{PATIENTS}; number travel_time{PATIENTS, PATIENTS}; number H_t; number H_c; number r{PATIENTS}; number c_t; number c_c; number c_v; /* Read data */ read data patient_data into [i] d=duration r=revenue; read data travel_times_final into [i j] travel_time=t; read data nurse_data into H_t H_c c_t c_c c_v; /* Define variables */ var X{PATIENTS, TELEHEALTH_NURSES} binary; var Y{PATIENTS, TRAVEL_CAREGIVERS} binary; var Z{PATIENTS, PATIENTS, TRAVEL_CAREGIVERS, VEHICLES} binary; var U{PATIENTS} integer >= 1 <= card(PATIENTS); /* Objective function */ max Profit = sum{i in PATIENTS} (r[i] * (sum{tn in TELEHEALTH_NURSES} X[i,tn] + sum{c in TRAVEL_CAREGIVERS} Y[i,c])) - sum{tn in TELEHEALTH_NURSES} (c_t * sum{i in PATIENTS} d[i] * X[i,tn]) - sum{c in TRAVEL_CAREGIVERS} (c_c * (sum{i in PATIENTS} d[i] * Y[i,c] + sum{i in PATIENTS, j in PATIENTS, v in VEHICLES} travel_time[i,j] * Z[i,j,c,v])) - sum{v in VEHICLES} (c_v * sum{c in TRAVEL_CAREGIVERS, i in PATIENTS, j in PATIENTS} travel_time[i,j] * Z[i,j,c,v]); /* Constraints */ con Patient_Assignment{i in PATIENTS}: sum{tn in TELEHEALTH_NURSES} X[i,tn] + sum{c in TRAVEL_CAREGIVERS} Y[i,c] = 1; con Telehealth_Hours{tn in TELEHEALTH_NURSES}: sum{i in PATIENTS} d[i] * X[i,tn] <= H_t; con Travel_Caregiver_Hours{c in TRAVEL_CAREGIVERS}: sum{i in PATIENTS} d[i] * Y[i,c] + sum{i in PATIENTS, j in PATIENTS, v in VEHICLES} travel_time[i,j] * Z[i,j,c,v] <= H_c; con Vehicle_Capacity{v in VEHICLES}: sum{c in TRAVEL_CAREGIVERS, i in PATIENTS, j in PATIENTS} Z[i,j,c,v] <= 2; con Flow_Conservation{i in PATIENTS, c in TRAVEL_CAREGIVERS}: sum{j in PATIENTS, v in VEHICLES} Z[i,j,c,v] = Y[i,c]; con Flow_Conservation_Reverse{i in PATIENTS, c in TRAVEL_CAREGIVERS}: sum{j in PATIENTS, v in VEHICLES} Z[j,i,c,v] = Y[i,c]; con Subtour_Elimination{i in PATIENTS, j in PATIENTS, c in TRAVEL_CAREGIVERS: i ne j}: U[i] - U[j] + 1 <= card(PATIENTS) * (1 - sum{v in VEHICLES} Z[i,j,c,v]); con Ordering_Link{i in PATIENTS, c in TRAVEL_CAREGIVERS}: U[i] >= 1 + card(PATIENTS) * (Y[i,c] - 1); /* Solve the model */ solve; /* Print results */ print X Y Z U; quit; ... View more