Overview | Group | Index | Concepts |
The routine CPXgetrowinfeas
computes the
infeasibility of a given solution for a range of linear
constraints. The beginning and end of the range must be
specified. For each constraint, the infeasibility value returned is
0 (zero) if the constraint is satisfied. Otherwise, except for ranged
rows, the infeasibility value returned is the amount by which the
righthand side of the constraint must be changed to make the
queried solution valid. It is positive for a less-than-or-equal-to
constraint, negative for a greater-than-or-equal-to constraint,
and can be of any sign for
an equality constraint. For ranged rows, if the infeasibility value
is negative, it indicates the amount by which the lower bound of
the range must be changed; if it is positive, it indicates the
amount by which the upper bound of the range must be changed.
Example
status = CPXgetrowinfeas (env, lp, NULL, infeasout, 0, CPXgetnumrows(env,lp)-1);
env | A pointer to the CPLEX environment as returned by |
lp | A pointer to a CPLEX problem object as returned by |
x | The solution whose infeasibility is to be computed. May be NULL, in which case the resident solution is used. |
infeasout | An array to receive the infeasibility value for each of the constraints. This array must be of length at least ( |
begin | An integer indicating the beginning of the range of linear constraints whose infeasibility is to be returned. |