Question

basic feasible solution of linear programing is said to be?
​

Answer 1

Answer:

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 corner of the polyhedron of feasible solutions. If there exists an optimal solution, then there exists an optimal BFS.

Explanation:

I hope it's help u

plz mark me as brainliest