Best Feasible Solution

computation approximation

Definition

Best Feasible Solution

A best feasible solution for an instance $I$ of an optimisation problem is a feasible solution $S\in {\mathcal{S}}_{\Pi }(I)$ whose value under the objective function $f_{\Pi }$ is best among all feasible solutions.

Minimisation

For a minimisation problem, this means that $S$ minimises $f_{\Pi }(I,S)$ over all feasible solutions.

Maximisation

For a maximisation problem, this means that $S$ maximises $f_{\Pi }(I,S)$ over all feasible solutions.

In other words, a best feasible solution is an optimal solution.