CPXXcopypnorms and CPXcopypnorms

The routine CPXXcopypnorms/CPXcopypnorms copies the primal steepest-edge norms to the specified LP problem object.

int  CPXXcopypnorms( CPXCENVptr env, CPXLPptr lp, double const * cnorm, double const * rnorm, CPXDIM len )

int  CPXcopypnorms( CPXCENVptr env, CPXLPptr lp, double const * cnorm, double const * rnorm, int len )

Description

Warning:

This is an advanced routine. Advanced routines typically demand a thorough understanding of the algorithms used by CPLEX. Thus they incur a higher risk of incorrect behavior in your application, behavior that can be difficult to debug. Therefore, the team encourages you to consider carefully whether you can accomplish the same task by means of other Callable Library routines instead.

The routine CPXXcopypnorms/CPXcopypnorms copies the primal steepest-edge norms to the specified LP problem object.

Arguments

env
The pointer to the CPLEX environment, as returned by CPXXopenCPLEX/CPXopenCPLEX.
lp
A pointer to a CPLEX LP problem object, as returned by CPXXcreateprob/CPXcreateprob.
cnorm
An array containing values to be used in a subsequent call to CPXXprimopt and CPXprimopt with a setting of the parameter to control the primal simplex pricing algorithm (CPXPARAM_Simplex_PGradient) equal to 2, as the initial values for the primal steepest-edge norms of the first len columns in the LP problem object. The array must be of length at least equal to the value of the argument len.
rnorm
An array containing values to be used in a subsequent call to CPXXprimopt and CPXprimopt with a setting of the parameter to control the primal simplex pricing algorithm (CPXPARAM_Simplex_PGradient) equal to 2, as the initial values for the primal steepest-edge norms of the slacks and ranged variables that are nonbasic. The array must be of length at least equal to the number of rows in the LP problem object.
len
An integer that specifies the number of entries in the array cnorm[].

Return

The routine returns 0 (zero) if successful and nonzero if an error occurs.