Everything About ___
Live briefing

Everything about Basic feasible solution

Concept from linear programming

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 algorithm, which essentially travels from one BFS to another until an optimal solution is found. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Basic feasible solutionA 5-minute orientation
  2. Skim a recent paper: Random forest algorithm integrated with an initial basic feasible solution in buckling analysis of a two-dimensional functionally graded porous taper beamInfluential work since 2022
  3. Pick up a classic book: Technical CommunicationThe most-reprinted book on the subject
  4. Read the landmark paper: A novel approximation method to obtain initial basic feasible solution of transportation problemCited 29 times
  5. Go sideways: Dual linear programA closely related topic
  6. Go sideways: Simplex algorithmA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics