The OPTMILP Procedure |
Macro Variable _OROPTMILP_ |
OROPTMILP_OROPTMILP_ The OPTMILP procedure defines a macro variable named _OROPTMILP_. This variable contains a character string that indicates the status of the OPTMILP procedure upon termination. The various terms of the variable are interpreted as follows.
indicates the solver status at termination. It can take one of the following values:
procedure terminated normally
incorrect use of syntax
inconsistent input data
insufficient memory allocated to the procedure
problem in reading or writing data
status that cannot be classified into any of the preceding categories
indicates the solution status at termination. It can take one of the following values:
solution is optimal
optimal solution within absolute gap specified using ABSOBJGAP= option
optimal solution within relative gap specified using RELOBJGAP= option
solution is optimal, but some infeasibilities (primal, bound, or integer) exceed tolerances due to scaling or choice of small INTTOL= value
solution not worse than target specified using TARGET= option
problem is infeasible
problem is unbounded
problem is infeasible or unbounded
solver reached maximum number of solutions specified using option MAXSOLS=
solver reached maximum number of nodes specified using MAXNODES= option and found a solution
solver reached maximum number of nodes specified using MAXNODES= option and did not find a solution
solver reached the execution time limit specified using MAXTIME= option and found a solution
solver reached the execution time limit specified using MAXTIME= option and did not find a solution
solver was stopped by user but still found a solution
solver was stopped by user and did not find a solution
solver ran out of memory but still found a solution
solver ran out of memory and either did not find a solution or failed to output solution due to insufficient memory
solver stopped due to errors but still found a solution
solver stopped due to errors and did not find a solution
indicates the objective value obtained by the solver at termination.
specifies the relative gap between the best integer objective (BestInteger) and the objective of the best remaining node (BestBound) upon termination of the MILP solver. The relative gap is equal to
specifies the absolute gap between the best integer objective (BestInteger) and the objective of the best remaining node (BestBound) upon termination of the MILP solver. The absolute gap is equal to .
indicates the maximum (absolute) violation of the primal constraints by the solution.
indicates the maximum (absolute) violation by the solution of the lower and/or upper bounds.
indicates the maximum (absolute) violation of the integrality of integer variables returned by the MILP solver.
specifies the best LP objective value of all unprocessed nodes on the branch-and-bound tree at the end of execution. A missing value indicates that the OPTMILP procedure has processed either all or none of the nodes on the branch-and-bound tree.
specifies the number of nodes enumerated by the MILP solver by using the branch-and-bound algorithm.
indicates the number of simplex iterations taken to solve the problem.
indicates the time (in seconds) used in preprocessing.
indicates the time (in seconds) taken to solve the problem.
Note:The time reported in PRESOLVE_TIME and SOLUTION_TIME is either CPU time (default) or real time. The type is determined by the TIMETYPE= option.
Copyright © SAS Institute, Inc. All Rights Reserved.