XKTR_PARAM_BAR_FEASIBLE

Specifies whether special emphasis is placed on getting and staying feasible in the interior-point algorithms.

Integer

0	(no) No special emphasis on feasibility.
1	(stay) Iterates must satisfy inequality constraints once they become sufficiently feasible.
2	(get) Special emphasis is placed on getting feasible before trying to optimize.
3	(get_stay) Implement both options 1 and 2 above.

0

This option can only be used with the Interior/Direct and Interior/CG algorithms. If bar_feasible = stay or bar_feasible = get_stay, this will activate the feasible version of Knitro. The feasible version of Knitro will force iterates to strictly satisfy inequalities, but does not require satisfaction of equality constraints at intermediate iterates. This option and the honorbnds option may be useful in applications where functions are undefined outside the region defined by inequalities. The initial point must satisfy inequalities to a sufficient degree; if not, Knitro may generate infeasible iterates and does not switch to the feasible version until a sufficiently feasible point is found. Sufficient satisfaction occurs at a point x if it is true for all inequalities that cl + tol ≤ c(x) ≤ cu - tol The constant tol is determined by the option bar_feasmodetol. If bar_feasible = get or bar_feasible = get_stay, Knitro will place special emphasis on first trying to get feasible before trying to optimize.