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
- Read the overview: Basic feasible solutionA 5-minute orientation
- 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
- Pick up a classic book: Technical CommunicationThe most-reprinted book on the subject
- Read the landmark paper: A novel approximation method to obtain initial basic feasible solution of transportation problemCited 29 times
- Go sideways: Dual linear programA closely related topic
- Go sideways: Simplex algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
A novel approximation method to obtain initial basic feasible solution of transportation problem
A new heuristic method of finding the initial basic feasible solution to solve the transportation problem
New Procedure of Finding an Initial Basic Feasible Solution of the Time Minimizing Transportation Problems
Finding an Initial Basic Feasible Solution for DEA Models with an Application on Bank Industry
Three new methods to find initial basic feasible solution of transportation problems
An Advanced Dual Basic Feasible Solution for a Class of Capacitated Generalized Networks
A NEW APPROACH TO FIND THE INITIAL BASIC FEASIBLE SOLUTION OF A TRANSPORTATION PROBLEM
Modified VOGEL Method to Find Initial Basic Feasible Solution (IBFS) Introducing a New Methodology to Find Best IBFS
🆕 Influential since 2022
Random forest algorithm integrated with an initial basic feasible solution in buckling analysis of a two-dimensional functionally graded porous taper beam
A new approach for finding an initial basic feasible solution to a transportation problem
An efficient computational approach for basic feasible solution of fuzzy transportation problems
The maximum range method for finding initial basic feasible solution for transportation problems
Using the largest difference method to find the initial basic feasible solution to the transportation problem
📚 Books worth reading
Technical CommunicationJohn M. Lannon · 2000
Operations ManagementRoberta S. Russell, Bernard Taylor · 1998
Microwave solutions for ceramic engineersDavid E. Clark · 2004
Mathematical programming at Oberwolfach IIB. H. Korte, M. L. Balinski · 1984
NanosystemsK. Eric Drexler · 1992
The veterinary laboratory and field manualS. C. Cork, Susan C. Cork · 2002- 📕Extreme points and basic feasible solutions in continuous time linear programmingAndré F. Perold · 1979
Linear Algebra I Matrices and Row operationsKenneth Kuttler · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Dual linear program The dual of a given linear program (LP) is another LP that is derived from the original (the primal) LP in the following schematic way: Each variable in…
- Simplex algorithm In mathematical optimization, Dantzig's simplex algorithm (or simplex method) is an algorithm for linear programming. The name of the algorithm is derived…
- Karmarkar–Karp bin packing algorithms The Karmarkar–Karp (KK) bin packing algorithms are several related approximation algorithm for the bin packing problem. The bin packing problem is a problem…
- Linear programming Linear programming (LP), also called linear optimization, is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical…
- Semidefinite programming Semidefinite programming (SDP) is a subfield of mathematical programming concerned with the optimization of a linear objective function (a user-specified…
- Linear-fractional programming In mathematical optimization, linear-fractional programming (LFP) is a generalization of linear programming (LP). Whereas the objective function in a linear…
- Duality (optimization) In mathematical optimization theory, duality or the duality principle is the principle that optimization problems may be viewed from either of two perspectives…
- Ellipsoid method In mathematical optimization, the ellipsoid method is an iterative method for minimizing convex functions over convex sets. The ellipsoid method generates…