Chapter Contents
Chapter Contents
Previous
Previous
Next
Next
The NETFLOW Procedure

SHOW Statement

SHOW options / qualifiers ;

The options available with the SHOW statement of PROC NETFLOW are summarized by purpose in Table 4.22.



Table 4.22: Functional Summary, SHOW statement: PROC NETFLOW

Description Statement Option
SHOW statement options 
show problem, optimization statusSHOWSTATUS
show network model parametersSHOWNETSTMT
show data sets that have, will be createdSHOWDATA SETS
show options that pause optimizationSHOWPAUSE
show Simplex algorithm optionsSHOWSIMPLEX
show pricing strategy optionsSHOWPRICING
show miscellaneous optionsSHOWMISC
   
SHOW statement qualifiers 
only if relevantSHOWRELEVANT
only stage 1 options when doing stage 1. only stage 2 options when doing stage 2SHOWSTAGE
   


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.

The following options can appear in the SHOW statement.

STATUS
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


DATA SETS
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 DATA SETS)
      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
              .                   .
              .                   .
              .                   .


PAUSE
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


SIMPLEX
produces the following:
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


PRICING
produces the following:
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


MISC
produces the following:
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.

RELEVANT
indicates that you want information only on relevant options of the RESET statement. The following will not be displayed if / RELEVANT is specified:

STAGE
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.

Chapter Contents
Chapter Contents
Previous
Previous
Next
Next
Top
Top

Copyright © 1999 by SAS Institute Inc., Cary, NC, USA. All rights reserved.