In the theory of linear programming, a basic feasible solution (BFS) is a solution with a minimal set of non-zero variables.