 Basic solution (linear programming)

In the context of linear programming, a **basic solution** refers to a specific type of solution obtained from the standard form of a linear programming problem, which can be solved using methods such as the Simplex algorithm. When linear programming problems are formulated, they are often represented in a tableau, where the solution is represented as a combination of basic and non-basic variables.