Analyzing infeasibility: IIS
A general technique to analyze infeasibility is to find a small portion of the matrix that is itself infeasible. Xpress Optimizer does this by finding irreducible infeasible sets (IISs). An IIS is a minimal set of constraints and variable bounds which is infeasible, but becomes feasible if any constraint or bound in it is removed.
»Scenario 1 (Mosel)
Take a look at the Mosel model in file examples\getting_started\Mosel\folioiis.mos. This example retrieves the IIS sets for an LP-infeasible problem and displays their contents.
»Scenario 2 (BCL)
Similarly, you can use the IIS access functionality of BCL to retrieve and display IIS (see file folioiis.[c|cxx|java] in directory examples\bcl\[C|Cxx|Java]\UGExpl).
© 2001-2019 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.