Search results
We did not find results for: basic feasible solution.
Check spelling or type a new query.
We did not find results for: basic feasible solution.
Check spelling or type a new query.
Term in linear optimizing
In the theory of linear programming, a basic feasible solution (BFS) is a solution with a minimal set of non-zero variables. Geometrically, each BFS corresponds to a vertex of the polyhedron of feasible solutions. If there exists an optimal solution, then there exists an optimal BFS. Hence, to find an optimal solution, it is sufficient to consider the BFS-s. This fact is used by the simplex algori... Wikipedia