The NETFLOW Procedure |
SHOW Statement |
The options available with the SHOW statement of PROC NETFLOW are summarized by purpose in the following table.
Description |
Statement |
Option |
---|---|---|
SHOW Statement Options: |
||
Show problem, optimization status |
||
Show network model parameters |
NETSTMT |
|
Show data sets that have been or will be created |
||
Show options that pause optimization |
||
Show simplex algorithm options |
||
Show pricing strategy options |
||
Show miscellaneous options |
||
SHOW Statement Qualifiers: |
||
Display information only on relevant options |
||
Display options for current stage only |
The SHOW statement enables you to examine the status of the problem and values of the RESET statement options. All output of the SHOW statement appears on the SAS log. The amount of information displayed when a SHOW statement is processed can be limited if some of the options of the SHOW statement are specified. These options indicate whether the problem status or a specific category of the RESET options is of interest. If no options are specified, the problem status and information on all RESET statement options in every category is displayed. The amount of displayed information can be limited further by following any SHOW statement options with a slash (/) and one or both qualifiers, RELEVANT and STAGE.
produces one of the following optimization status reports, whichever is applicable. The warning messages are issued only if the network or entire problem is infeasible.
NOTE: Optimization Status. Optimization has not started yet. NOTE: Optimization Status. Optimizing network (ignoring any side constraints). Number of iterations=17 Of these, 3 were degenerate WARNING: This optimization has detected that the network is infeasible. NOTE: Optimization Status. Found network optimum (ignoring side constraints) Number of iterations=23 Of these, 8 were degenerate NOTE: Optimization Status. Optimizing side constrained network. Number of iterations=27 Of these, 9 were degenerate WARNING: This optimization has detected that the problem is infeasible. NOTE: Optimization Status. Found side constrained network optimum Number of iterations=6 Of these, 0 were degenerate
produces a report on output data sets.
NOTE: Current output SAS data sets No output data sets have been specified NOTE: Current output SAS data sets ARCOUT=libname.memname NODEOUT=libname.memname CONOUT=libname.memname DUALOUT=libname.memname
NOTE: Other SAS data sets specified in previous ARCOUT=, NODEOUT=, CONOUT=, or DUALOUT=. libname.memname . . . NOTE: Current output SAS data sets (SHOW DATASETS) libname.memname . . . NOTE: SAS data sets specified as ARCOUT= NODEOUT= CONOUT= or DUALOUT= data sets in previous PROC NETFLOW, SET, RESET and SAVE statements. The number following the data set specification was the iteration number when observations were placed into the data set. libname.memname iteration_number . . . . . .
produces a report on the current settings of options used to make optimization pause.
NOTE: Options and parameters that stop optimization for reasons other than infeasibility or optimality (SHOW PAUSE) FEASIBLEPAUSE1=FALSE ENDPAUSE1=FALSE PAUSE1=999999 MAXIT1=1000 FEASIBLEPAUSE2=FALSE PAUSE2=999999 MAXIT2=999999
NOTE: Options and parameters that control the primal simplex network algorithm (excluding those that affect the pricing strategies) (SHOW SIMPLEX) LRATIO1=FALSE BIGM1=NOTWOPHASE1=TRUE, TWOPHASE1=NOBIGM1=FALSE CYCLEMULT1=0.15 PERTURB1=FALSE MINBLOCK1=2 INTFIRST=TRUE LRATIO2=FALSE BIGM2=NOTWOPHASE2=TRUE, TWOPHASE2=NOBIGM2=FALSE REFACTFREQ=50 U=0.1 MAXLUUPDATES=6 MAXL=40
NOTE: Options and parameters that control the primal simplex network algorithm pricing strategies (SHOW PRICING) PRICETYPE1=Q P1SCAN=FIRST P1NPARTIAL=10 Q1FILLSCAN=FIRST QSIZE1=24 REFRESHQ1=0.75 REDUCEQSIZE1=1 Q1FILLNPARTIAL=10 PRICETYPE2=Q P2SCAN=FIRST P2NPARTIAL=10 DUALFREQ=4 Q2FILLSCAN=FIRST QSIZE2=24 REFRESHQ2=0.75 REDUCEQSIZE2=1 Q2FILLNPARTIAL=10
NOTE: Miscellaneous options and parameters (SHOW MISC) VERBOSE=12 ZTOL1=TRUE ZERO1=1E-6 FUTURE1=FALSE ZTOL2=TRUE ZERO2=1E-6 FUTURE2=FALSE
Following a slash (/), the qualifiers below can appear in any SHOW statement.
indicates that you want information only on relevant options of the RESET statement. The following will not be displayed if / RELEVANT is specified:
information on noncurrent data sets
the options that control the reasons why stage 1 optimization should be halted and the options that control the simplex algorithm during stage 1 optimization, if the unconstrained optimum has been reached or constrained optimization has been performed
if P1SCAN=BEST or P1SCAN=FIRST, the P1NPARTIAL= option is irrelevant
if PRICETYPE1=BLAND or PRICETYPE1=NOQ, the options QSIZE1=, Q1FILLSCAN=, REFRESHQ1=, and REDUCEQSIZE1= are irrelevant
if Q1FILLSCAN=BEST or Q1FILLSCAN=FIRST, the Q1FILLNPARTIAL= option is irrelevant
the options that control the reasons stage 2 optimization should be halted, the options that control the simplex algorithm during stage 2 optimization, if the constrained optimum has been reached
if P2SCAN=BEST or P2SCAN=FIRST, the P2NPARTIAL= option is irrelevant
if PRICETYPE2=BLAND or PRICETYPE2=NOQ, the options QSIZE2=, Q2FILLSCAN=, REFRESHQ2=, and REDUCEQSIZE2= are irrelevant
if Q2FILLSCAN=BEST or Q2FILLSCAN=FIRST, the Q2FILLNPARTIAL= option is irrelevant
indicates that you want to examine only the options that affect the optimization that is performed if a RUN statement is executed next. Before any optimization has been done, only stage 2 options are displayed if the problem has side constraints and the SCRATCH option is used, or if the CONOPT statement is specified. Otherwise, stage 1 options are displayed. If still optimizing neglecting constraints, only stage 1 options will be displayed. If the unconstrained optimum has been reached and optimization that considers constraints has not been performed, stage 1 options are displayed. If the problem has constraints, stage 2 options are displayed. If any optimization that considers constraints has been performed, only stage 2 options are displayed.
Copyright © SAS Institute, Inc. All Rights Reserved.