LPITERLIMIT
|
Description
|
Simplex: Specifies the maximum number of iterations that will be performed by primal Simplex or dual Simplex before the optimization process terminates. For MIP problems, this is the maximum total number of iterations over all nodes explored by the Branch and Bound method.
|
||
|
Type
|
Integer
|
||
|
Topic areas
|
|||
|
Values
|
|
||
|
Default value
|
INF
|
||
|
Unit
|
iterations
|
||
|
Notes
|
When
LPITERLIMIT is set on an objective using
XPRSsetobjintcontrol, then when the limit is reached the solver will stop the current solve but will continue with solving the next objective. This is in contrast to the behaviour when
LPITERLIMIT is set on the problem with
XPRSsetintcontrol, where the overall optimization will be terminated as soon as the limit is reached.
When an
LPITERLIMIT of 0 is set, the solver will stop at the beginning of the simplex solve (i.e., after presolving).
|
||
|
Affects routines
|
|||
|
Category
|
Control
|
© 2001-2026 Fair Isaac Corporation. All rights reserved. This documentation is the property of Fair Isaac Corporation (“FICO”). Receipt or possession of this documentation does not convey rights to disclose, reproduce, make derivative works, use, or allow others to use it except solely for internal evaluation purposes to determine whether to purchase a license to the software described in this documentation, or as otherwise set forth in a written software license agreement between you and FICO (or a FICO affiliate). Use of this documentation and the software described in it must conform strictly to the foregoing permitted uses, and no other use is permitted.