Feasible Solution

computation

Definition

Feasible Solution

A feasible solution for an instance of an optimisation problem is a solution that satisfies all constraints of the instance.

Equivalently, if $\mathcal{S}(I)$ denotes the set of feasible solution for instance $I$, then $S$ is feasible exactly if $S\in \mathcal{S}(I)$.