Chapter Contents |
Previous |
Next |

The LP Procedure |

- Problem Summary
- Solution Summary including a Variable Summary and a Constraint Summary
- Infeasible Information Summary
- RHS Sensitivity Analysis Summary (the RHS Range Analysis Summary is not discussed)
- Price Sensitivity Analysis Summary (the Price Range Analysis Summary is not discussed)
- Iteration Log.

For integer-constrained problems, the procedure also displays an Integer Iteration Log. The description of this Log can be found in

the Integer Programming section. When you request that the tableau be displayed, the procedure displays the Current Tableau. The description of this can be found in

the The Reduced Costs, Dual Activities, and Current Tableau section.

A problem data set can contain a set of constraints with several right-hand sides and several objective functions. PROC LP considers each combination of right-hand side and objective function as defining a new linear programming problem and solves each, performing all specified sensitivity analysis on each problem. For each problem defined, PROC LP displays a new sequence of output sections. Example 3.1 in the "Examples" section discusses each of these elements.

The LP procedure produces the following displayed output by default.

- type of optimization and the name of the objective row (as identified by the ID or ROW variable)
- name of the SAS variable that contains the right-hand-side constants
- name of the SAS variable that contains the type keywords
- density of the coefficient matrix (the ratio of the number of nonzero elements to the number of total elements) after the slack and surplus variables have been appended
- number of each type of variable in the mathematical program
- number of each type of constraint in the mathematical program

- termination status of the procedure
- objective value of the current solution
- number of phase 1 iterations that were completed
- number of phase 2 iterations that were completed
- number of phase 3 iterations that were completed
- number of integer iterations that were completed
- number of integer feasible solutions that were found
- number of initial basic feasible variables identified
- time used in solving the problem excluding reading the data and displaying the solution
- number of inversions of the basis matrix
- current value of several of the options

- column number associated with each structural or logical variable in the problem
- name of each structural or logical variable in the problem.
(PROC LP gives the logical variables the name of the constraint ID.
If no ID variable is specified, the
procedure names the logical variable _OBS
*n*_, where*n*is the observation that describes the constraint.) - variable's status in the current solution. The status can be BASIC, DEGEN, ALTER, blank, LOWBD, or UPPBD, depending upon whether the variable is a basic variable, a degenerate variable, a variable that can be brought into the basis to define an alternate optimal solution, a nonbasic variable at its default lower bound 0, a nonbasic variable at its lower bound, or a nonbasic variable at its upper bound
- kind of variable (whether it is logical or structural, and, if structural, its bound type, or other value restriction)
- value of the objective coefficient associated with each variable
- activity of the variable in the current solution
- variable's reduced cost in the current solution

- constraint row number and its ID
- the kind of constraint (whether it is an OBJECTIVE, LE, EQ, GE, RANGELE, RANGEEQ, RANGEGE, or FREE row)
- number of the slack or surplus variables associated with the constraint row
- value of the right-hand-side constant associated with the constraint row
- current activity of the row (excluding logical variables)
- current activity of the dual variable (shadow price) associated with the constraint row

- name of the infeasible row or variable
- current activity for the row or the variable
- type of the row or the variable
- value of right-hand-side constant
- name of each nonzero and nonmissing variable in the row
- activity and upper and lower bounds for the variable

- value of
- leaving variable when
- objective value when
- value of
- leaving variable when
- objective value when
- column number and name of each logical and structural variable
- variable's status when
- variable's reduced cost when
- value of right-hand-side constant when
- activity of the variable when
- value of right-hand-side constant when
- activity of the variable when

- value of
- entering variable when
- objective value when
- value of
- entering variable when
- objective value when
- column number and name of each logical and structural variable
- variable's status when
- activity of the variable when
- price of the variable when
- variable's reduced cost when
- price of the variable when
- variable's reduced cost when

- phase number
- iteration number in each phase
- name of the leaving variable
- name of the entering variable
- variable's reduced cost
- objective value

Chapter Contents |
Previous |
Next |
Top |

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