Initializing help system before first use

Uncertains and robust constraints

A model quantity or coefficient whose value is subject to uncertainty is called an uncertain.

Intuitively, an uncertain can be viewed as a unknown quantity that is not under our control, but is controlled by an opponent. The opponent makes his decision for the values of the uncertains after we have made our decision, i.e., after the solver has found an optimal value for the model variables. Hence, the values of the model variables must assume the worst case.

A model constraint that includes some uncertainty in the form of an uncertain coefficient or right hand side is called a robust constraint. A good way to visualize the concept of robust optimization is to consider a robust constraint as a two-phase expression. For the sake of argument, let us assume a less-than or equal-to constraint that contains some uncertain model quantities:

a1 x1 + ... + al xl + (ak + uk ) xk + ... + (an + un ) xn ≤ b.

Here, all ai coefficients are known. However, the values of coefficients of variables xk to xn are only known to some level of uncertainty, denoted by uk to un. As for traditional variables, we must define the values these uncertains can take.

The feasible region of the uncertains is called the uncertainty set, and is modelled by means of constraints on the uncertains. In the example above, we may know that the uncertain quantities are likely to be small and their norm might be bounded from above, hence we want a solution that is robust at a given confidence level. This implies a constraint on the uncertains of the form

uk2 + ... + un2 ≤ r.

Having described the possible values of the uncertains, robust optimization aims to find a solution that is always feasible, thus the robust constraint is equivalent to the constraint

a1 x1 + ... + al xl + max uk2 + ... + un2 ≤ r [(ak + uk ) xk + ... + (an + un ) xn] ≤ b.

A robust model may contain several robust constraints and several uncertainty sets. The solvability of a robust optimization problem depends on whether the robust constraints in the model can be transformed into a form that can be solved by the available mathematical programming solvers. The resulting transformed model that is solved is called the robust counterpart.

© 2001-2020 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.