MSP Attributes

Number of feasible solutions for the problem.

Number of solutions with the same number of columns as the problem.

A bit map with fields containing the logical attribute values for the solution e.g., MSP_SOL_ISREPROCESSEDUSERSOLUTION and MSP_SOL_ISUSERSOLUTION.

Number of columns in the solution.

Whether or not the solution arises from a user solution (i.e., passed in by the user via XPRS_msp_loadsol or XPRS_msp_readslxsol) being loaded into an attached problem and the resulting "cleaned up" solution being loaded back into the MIP solution pool.

Whether or not the solution was passed in by the user (via XPRS_msp_loadsol or XPRS_msp_readslxsol) or whether the solution was loaded internally from an attached problem.

Number of non-zeros in the solution.

Number of binary variable MIP infeasibilities for the solution with respect to the problem.

Number of column bound infeasibilities for the solution with respect to the problem.

Number of delayed row infeasibilities for the solution with respect to the problem.

Number of integer variable MIP infeasibilities for the solution with respect to the problem.

Number of MIP infeasibilities that the solution has with respect to the problem.

Number of partial integer variable MIP infeasibilities for the solution with respect to the problem.

Number of primal infeasibilities that the solution has with respect to the problem. This count includes the column bound infeasibilities and both the row and delayed row infeasibilities.

Number of semi-continuous variable MIP infeasibilities for the solution with respect to the problem.

Number of SOS1 set MIP infeasibilities for the solution with respect to the problem.

Number of SOS2 set MIP infeasibilities for the solution with respect to the problem.

Number of semi-continuous integer variable MIP infeasibilities for the solution with respect to the problem.

Number of rows of the problem that are violated for the solution.

The sum of the MIP and primal infeasibility counts for the solution with respect to the problem.

Maximum binary variable MIP infeasibility for the solution with respect to the problem.

Maximum column bound infeasibility for the solution with respect to the problem.

Maximum delayed row infeasibility for the solution with respect to the problem.

Maximum integer variable MIP infeasibility for the solution with respect to the problem.

Maximum partial integer variable MIP infeasibility for the solution with respect to the problem.

Maximum semi-continuous variable MIP infeasibility for the solution with respect to the problem.

Maximum variable value causing a SOS1 set MIP infeasibility.

Maximum variable value causing a SOS2 set MIP infeasibility.

Maximum semi-continuous integer variable MIP infeasibility for the solution with respect to the problem.

Maximum row infeasibility for the solution with respect to the problem.

Index of a column achieving the maximum binary variable MIP infeasibility for the solution with respect to the problem.

Index of a column achieving the maximum column bound infeasibility for the solution with respect to the problem.

Index of a delayed row achieving the maximum delayed row infeasibility for the solution with respect to the problem.

Index of a column achieving the maximum integer variable MIP infeasibility for the solution with respect to the problem.

Index of a column achieving the maximum partial integer variable MIP infeasibility for the solution with respect to the problem.

Index of a column achieving the maximum semi-continuous variable MIP infeasibility for the solution with respect to the problem.

Index of a set that has the maximum SOS1 set MIP infeasibility.

Index of a set that has the maximum SOS2 set MIP infeasibility.

Index of a column achieving the maximum semi-continuous integer variable MIP infeasibility for the solution with respect to the problem.

Index of a row achieving the maximum row infeasibility for the solution with respect to the problem.

Sum of binary variable MIP infeasibilities for the solution with respect to the problem.

Sum of column bound infeasibilities for the solution with respect to the problem.

Sum of delayed row infeasibilities for the solution with respect to the problem.

Sum of integer variable MIP infeasibilities for the solution with respect to the problem.

Sum of MIP infeasibilities that the solution has with respect to the problem.

Sum of partial integer variable MIP infeasibilities for the solution with respect to the problem.

Sum of primal infeasibilities that the solution has with respect to the problem. This sum includes the column bound infeasibilities and both the row and delayed row infeasibilities.

Sum of semi-continuous variable MIP infeasibilities for the solution with respect to the problem.

Sum of SOS1 set MIP infeasibilities for the solution with respect to the problem.

Sum of SOS2 set MIP infeasibilities for the solution with respect to the problem.

Sum of semi-continuous integer variable MIP infeasibilities for the solution with respect to the problem.

Sum of row infeasibilities for the solution with respect to the problem.

Objective value of the solution with the problem.

The number of solutions stored by the MIP solution pool.