basic feasible solution of linear programing is said to be?
Answers
Answered by
5
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
Similar questions
Science,
7 months ago
Math,
7 months ago
India Languages,
11 months ago
Chemistry,
11 months ago
Social Sciences,
11 months ago